iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Xu, Yuexuan, Gao, Jianyang, Gou, Yutong, Long, Cheng, Jensen, Christian S.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Databases Data Structures and Algorithms Information Retrieval
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
di: Gou, Yutong, et al.
Pubblicazione: (2024)

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

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

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

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

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

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
di: Gottesbüren, Lars, et al.
Pubblicazione: (2024)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
di: Diwan, Haya, et al.
Pubblicazione: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
di: Zhao, Fuheng, et al.
Pubblicazione: (2023)

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

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

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

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

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

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
di: Yin, Ziqi, et al.
Pubblicazione: (2026)

Range (Rényi) Entropy Queries and Partitioning
di: Esmailpour, Aryan, et al.
Pubblicazione: (2023)

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

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

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

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

Grafite: Taming Adversarial Queries with Optimal Range Filters
di: Costa, Marco, et al.
Pubblicazione: (2023)

Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
di: Güting, Ralf Hartmut, et al.
Pubblicazione: (2024)

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

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
di: Li, Hui, et al.
Pubblicazione: (2025)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
di: Lu, Kejing, et al.
Pubblicazione: (2024)

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)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
di: Coleman, Benjamin, et al.
Pubblicazione: (2023)

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

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
di: Pan, Yunjie, et al.
Pubblicazione: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
di: Santos, Aécio, et al.
Pubblicazione: (2021)

Accelerating Graph Similarity Search through Integer Linear Programming
di: D'Ascenzo, Andrea, et al.
Pubblicazione: (2025)

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
di: Tekin, Selim Furkan, et al.
Pubblicazione: (2025)

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

Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
di: Lu, Shangqi, et al.
Pubblicazione: (2025)

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

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
di: Fan, Xiaoyu, et al.
Pubblicazione: (2024)