Image de couverture de livre

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ning, Baoling, Li, Jianzhong
Format:	Preprint
Publié:	2024
Sujets:	Databases Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

Approximating Queries on Probabilistic Graphs
par: Amarilli, Antoine, et autres
Publié: (2023)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
par: Wang, Kaixin, et autres
Publié: (2026)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
par: Ali, Dildar, et autres
Publié: (2026)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

Range (Rényi) Entropy Queries and Partitioning
par: Esmailpour, Aryan, et autres
Publié: (2023)

Approximate Butterfly Counting in Sublinear Time
par: Luo, Chi, et autres
Publié: (2026)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

Enumeration Algorithms for Conjunctive Queries with Projection
par: Deep, Shaleen, et autres
Publié: (2021)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
par: Fan, Xiaoyu, et autres
Publié: (2024)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
par: Ertl, Otmar
Publié: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
par: Hamada, Kou, et autres
Publié: (2024)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
par: Yin, Ziqi, et autres
Publié: (2026)

Faster Relational Algorithms Using Geometric Data Structures
par: Esmailpour, Aryan, et autres
Publié: (2026)

Efficient Computation of Hyper-triangles on Hypergraphs
par: Yin, Haozhe, et autres
Publié: (2025)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
par: Ertl, Otmar
Publié: (2023)

Computing Data Distribution from Query Selectivities
par: Agarwal, Pankaj K., et autres
Publié: (2024)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
par: Kurkure, Yash, et autres
Publié: (2024)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
par: Zhao, Fuheng, et autres
Publié: (2023)

New Compressed Indices for Multijoins on Graph Databases
par: Arroyuelo, Diego, et autres
Publié: (2024)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
par: De Man, Quinten, et autres
Publié: (2026)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

Accelerating Graph Similarity Search through Integer Linear Programming
par: D'Ascenzo, Andrea, et autres
Publié: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
par: Bressan, Marco, et autres
Publié: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
par: Zhong, Ming, et autres
Publié: (2023)

Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
par: Lu, Shangqi, et autres
Publié: (2025)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
par: Wang, Huayi, et autres
Publié: (2026)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
par: Mundra, Pranay, et autres
Publié: (2025)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
par: Chen, Yuan, et autres
Publié: (2025)

Dimensionality Reduced Clustered Data and Order Partition and Stepwise Dimensionality Increasing Indices
par: Thomasian, Alexander
Publié: (2024)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
Publié: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
par: Qi, Yiyan, et autres
Publié: (2024)

Scalable Order-Preserving Pattern Mining
par: Li, Ling, et autres
Publié: (2024)

Contextual Pattern Mining and Counting
par: Li, Ling, et autres
Publié: (2025)