cs.DB

Papers

• A Comprehensive Survey on Vector Database: Storage and Retrieval Technique, Challenge (2026)
  Le Ma et al.
  23.45
• TigerVector: Supporting Vector Search in Graph Databases for Advanced RAGs (2026)
  Shige Liu et al.
  12.24
• Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search (2025)
  Shuo Yang et al.
  9.23
• Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search (2025)
  Jiuqi Wei et al.
  9.23
• PANDA: Query Evaluation in Submodular Width (2025)
  Mahmoud Abo Khamis et al.
  9.03
• Learned Offline Query Planning via Bayesian Optimization (2025)
  Jeffrey Tao et al.
  8.60
• Valori: A Deterministic Memory Substrate for AI Systems (2025)
  Varshith Gudur
  8.42
• A Topology-Aware Localized Update Strategy for Graph-Based ANN Index (2025)
  Song Yu et al.
  7.50
• LEANN: A Low-Storage Vector Index (2025)
  Yichuan Wang et al.
  6.88
• Maximum Inner Product is Query-Scaled Nearest Neighbor (2025)
  Tingyang Chen et al.
  5.84
• CRINN: Contrastive Reinforcement Learning for Approximate Nearest Neighbor Search (2025)
  Xiaoya Li et al.
  5.67
• High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks (2025)
  Xinjie Zhou et al.
  5.24
• Outback: Fast and Communication-efficient Index for Key-Value Store on Disaggregated Memory (2025)
  Yi Liu et al.
  5.24
• SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search (2025)
  Joe Oakley et al.
  4.52
• DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees (2025)
  Alireza Heidari et al.
  4.52
• Low-Latency Sliding Window Connectivity (2025)
  Chao Zhang et al.
  2.26
• Indexing Join Inputs for Fast Queries and Maintenance (2025)
  Wenhui Lyu et al.
  2.26
• Linked Array Tree: A Constant-Time Search Structure for Big Data (2025)
  Songpeng Liu
  0.00
• Indexing Strings with Utilities (2025)
  Giulia Bernardini and Huiping Chen and Alessio Conte and Roberto Grossi and Veronica Guerrini and Grigorios Loukides and Nadia Pisanti and and Solon P. Pissis
  0.00
• QPAD: Quantile-Preserving Approximate Dimension Reduction for Nearest Neighbors Preservation in High-Dimensional Vector Search (2025)
  Jiuzhou Fu et al.
  0.00
• flexvec: SQL Vector Retrieval with Programmatic Embedding Modulation (2026)
  Damian Delmas
  0.00
• PI : a Parallel in-memory skip list based Index (2016)
  Zhongle Xie et al.
  —
• Streaming Similarity Self-Join (2016)
  Gianmarco De Francisci Morales and Aristides Gionis
  —
• Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph (2016)
  Huanhuan Wu et al.
  —
• INSQ: An Influential Neighbor Set Based Moving kNN Query Processing System (2021)
  Chuanwen Li et al.
  —
• TopCom: Index for Shortest Distance Query in Directed Graph (2016)
  Vachik S. Dave and Mohammad Al Hasan
  —
• Scalability and Total Recall with Fast CoveringLSH (2016)
  Ninh Pham et al.
  —
• HDBSCAN: Density based Clustering over Location Based Services (2016)
  Md Farhadur Rahman et al.
  —
• ZeroDB white paper (2016)
  Michael Egorov and MacLane Wilkison
  —
• Frequent-Itemset Mining using Locality-Sensitive Hashing (2016)
  Debajyoti Bera et al.
  —
• Efficient Authentication of Outsourced String Similarity Search (2016)
  Boxiang Dong et al.
  —
• Consistently faster and smaller compressed bitmaps with Roaring (2018)
  Daniel Lemire et al.
  —
• LSH Ensemble: Internet-Scale Domain Search (2016)
  Erkang Zhu et al.
  —
• A Generic Inverted Index Framework for Similarity Search on the GPU - Technical Report (2018)
  Jingbo Zhou et al.
  —
• Document Selection in a Distributed Search Engine Architecture (2016)
  Ibrahim AlShourbaji et al.
  —
• Hippo: A Fast, yet Scalable, Database Indexing Approach (2016)
  Jia Yu et al.
  —
• SLING: A Near-Optimal Index Structure for SimRank (2016)
  Boyu Tian and Xiaokui Xiao
  —
• Large-Scale Query-by-Image Video Retrieval Using Bloom Filters (2016)
  Andre Araujo et al.
  —
• Efficient Routing for Cost Effective Scale-out Data Architectures (2016)
  Ashwin Narayan et al.
  —
• A Density-Based Approach to the Retrieval of Top-K Spatial Textual Clusters (2016)
  Dingming Wu et al.
  —
• PowerWalk: Scalable Personalized PageRank via Random Walks with Vertex-Centric Decomposition (2016)
  Qin Liu et al.
  —
• Efficient Error-tolerant Search on Knowledge Graphs (2020)
  Zhaoyang Shao et al.
  —
• Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1 (2016)
  Sairam Gurajada et al.
  —
• Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing (2018)
  Sepehr Eghbali and Ladan Tahvildari
  —
• Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0) (2016)
  Wen Li et al.
  —
• Boost K-Means (2016)
  Wan-Lei Zhao et al.
  —
• A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs (2017)
  Elias Stehle et al.
  —
• A Formal Definition for Configuration (2016)
  Mar\'ia Carmen Calvo Yanguas (DAE) et al.
  —
• Optimally Leveraging Density and Locality to Support LIMIT Queries (2017)
  Albert Kim et al.
  —
• Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions (2017)
  Daniel Lemire and Christoph Rupp
  —