Dynamic Range-Filtering Approximate Nearest Neighbor Search
Summary: Define dynamic RFANNS: mixed stream of inserts and range-filtered ANN queries over attribute-constrained subsets; static RFANNS builds indexes by attribute order, so arbitrary arrival order breaks prior solutions. Propose the dynamic segment graph that compresses the O(|D|^2) HNSW graphs into a single index (lossless under conditions) with only linear-to-O(log |D|) expected edge additions per insert and practical heuristics, yielding much smaller indexes and superior empirical query performance. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhencan Peng
- 2. Miao Qiao
- 3. Wenchao Zhou
- 4. Feifei Li
- 5. Dong Deng
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,052 | Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study | 2026 | SIGMOD | 4.1945683e-05 |
| 10,273 | An Experimental Evaluation of Hybrid Querying on Vectors | 2026 | VLDB | 4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.