Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gottesbüren, Lars, Dhulipala, Laxman, Jayaram, Rajesh, Lacki, Jakub
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Information Retrieval
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

JAG: Joint Attribute Graphs for Filtered Nearest Neighbor Search
di: Xu, Haike, et al.
Pubblicazione: (2026)

Approximate Nearest Neighbor Search with Window Filters
di: Engels, Joshua, et al.
Pubblicazione: (2024)

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
di: Rubel, Tobias, et al.
Pubblicazione: (2026)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
di: Dhulipala, Laxman, et al.
Pubblicazione: (2023)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

Chamfer-Linkage for Hierarchical Agglomerative Clustering
di: Gowda, Kishen N, et al.
Pubblicazione: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
di: Zhang, Tian, et al.
Pubblicazione: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, et al.
Pubblicazione: (2024)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
di: Iff, Patrick, et al.
Pubblicazione: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
di: Shi, Jifan, et al.
Pubblicazione: (2026)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
di: Bruch, Sebastian, et al.
Pubblicazione: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

Efficiently Constructing Sparse Navigable Graphs
di: Conway, Alex, et al.
Pubblicazione: (2025)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
di: Wheatman, Brian, et al.
Pubblicazione: (2024)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
di: Yu, Shangdi, et al.
Pubblicazione: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

Efficient Centroid-Linkage Clustering
di: Bateni, MohammadHossein, et al.
Pubblicazione: (2024)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
di: Zhang, Ziyu, et al.
Pubblicazione: (2025)

Tera-Scale Multilevel Graph Partitioning
di: Salwasser, Daniel, et al.
Pubblicazione: (2024)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
di: Xu, Zhenxiang, et al.
Pubblicazione: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
di: Szyfelbein, Michał
Pubblicazione: (2026)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
di: Tabei, Yasuo
Pubblicazione: (2025)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
di: Lebeda, Christian Janos, et al.
Pubblicazione: (2024)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
di: Oguri, Yutaro, et al.
Pubblicazione: (2025)

It's Hard to HAC with Average Linkage!
di: Bateni, MohammadHossein, et al.
Pubblicazione: (2024)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
di: Ootomo, Hiroyuki, et al.
Pubblicazione: (2023)

Dynamic PageRank: Algorithms and Lower Bounds
di: Jayaram, Rajesh, et al.
Pubblicazione: (2024)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
di: Gottesbüren, Lars, et al.
Pubblicazione: (2025)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
di: Byriukov, Stanislav
Pubblicazione: (2026)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
di: Bateni, MohammadHossein, et al.
Pubblicazione: (2025)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
di: Azizi, Ilias, et al.
Pubblicazione: (2025)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
di: Azarmehr, Amir, et al.
Pubblicazione: (2024)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
di: Huang, Qiang, et al.
Pubblicazione: (2024)

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
di: Lebeda, Christian Janos, et al.
Pubblicazione: (2023)

Linked Array Tree: A Constant-Time Search Structure for Big Data
di: Liu, Songpeng
Pubblicazione: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)