Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Azizi, Ilias, Echihab, Karima, Palpanas, Themis, Christophides, Vassilis
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Information Retrieval Databases Data Structures and Algorithms Performance
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
di: Azizi, Ilias, et al.
Pubblicazione: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
di: Iff, Patrick, 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)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, 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)

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

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

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
di: Li, Hui, 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)

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

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)

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)

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

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
di: Chen, Yuan, et al.
Pubblicazione: (2025)

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

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

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

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

PHast -- Perfect Hashing made fast
di: Beling, Piotr, et al.
Pubblicazione: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
di: Balasubramanian, Shrinivass Arunachalam
Pubblicazione: (2025)

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

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
di: Ghandeharizadeh, Shahram, et al.
Pubblicazione: (2024)

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

COPR -- Efficient, large-scale log storage and retrieval
di: Reichinger, Julian, et al.
Pubblicazione: (2024)

Triadic First-Order Logic Queries in Temporal Networks
di: Bhalerao, Omkar, et al.
Pubblicazione: (2025)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
di: Pan, Yunjie, et al.
Pubblicazione: (2024)

Model-Free Counterfactual Subset Selection at Scale
di: Nguyen, Minh Hieu, et al.
Pubblicazione: (2025)

Retrieval with Learned Similarities
di: Ding, Bailu, et al.
Pubblicazione: (2024)

Don't Persist All : Efficient Persistent Data Structures
di: Mahapatra, Pratyush, et al.
Pubblicazione: (2019)

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

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

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

Foundations of Vector Retrieval
di: Bruch, Sebastian
Pubblicazione: (2024)

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

From HNSW to Information-Theoretic Binarization: Rethinking the Architecture of Scalable Vector Search
di: Abtahi, Seyed Moein, et al.
Pubblicazione: (2025)

Setchain Algorithms for Blockchain Scalability
di: Karmegam, Arivarasan, et al.
Pubblicazione: (2025)

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)

Results of the Big ANN: NeurIPS'23 competition
di: Simhadri, Harsha Vardhan, et al.
Pubblicazione: (2024)