NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance
Preprint
Abstract
There is an increasing demand for extending existing DBMSs with vector indices so that they become unified systems capable of supporting modern predictive applications, which require joint querying of vector embeddings together with the structured properties and connections of objects. We present NaviX, a native vector index for graph DBMSs (GDBMSs) that has two main design goals. First, we aim to implement a disk-based vector index that leverages the core storage and query-processing capabilities of the underlying GDBMS. To this end, NaviX is built on the Hierarchical Navigable Small-World (HNSW) graph, which itself is a graph-based structure. Second, we aim to support predicate-agnostic filtered vector search queries, in which the k nearest neighbors (kNNs) of a query vector vQ are searched only within an arbitrary subset S of vectors defined by an ad-hoc selection sub-query QS. We adopt a prefiltering approach that evaluates QS first and passes the full description of subset S to the kNN search operator. We study how to design a prefiltering search algorithm that remains robust under varying selectivities and under different correlations between subset S and query vector vQ. We propose an adaptive algorithm that uses the local selectivity of each vector in the HNSW graph to choose an appropriate heuristic at every iteration of the kNN search. Finally, We demonstrate NaviX's robustness and efficiency through extensive experiments against both existing prefiltering- and postfiltering-based baselines.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Multi-Meta-RAG: Improving RAG for Multi-hop Queries Using Database Filtering with LLM-Extracted Metadata2025
- Relative NN-Descent: A Fast Index Construction for Graph-Based Approximate Nearest Neighbor Search2023
- HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints2022
- PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension2020
- Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World GraphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
- A General and Efficient Querying Method for Learning to Hash2018
- Product Quantization for Nearest Neighbor SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 2010
- 80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene RecognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search2008
- Modeling the Shape of the Scene: A Holistic Representation of the Spatial EnvelopeInternational Journal of Computer Vision, 2001