DBScholar

Back to papers

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector

Summary: BBC targets the overlooked large-k regime in quantization-based ANN, where top-k maintenance and weak pruning dominate cost. Its distance-bucketed result buffer improves cache efficiency and candidate handling, while specialized re-ranking yields up to 3.8× speedups at 0.95 recall. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
h0411c8f877c8ac57
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,874 | 26.89%
DOI
10.14778/3836663.3836702

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{yin_vldb26,
        title = {{BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector}},
        author = {Yin, Ziqi and Cong, Gao and Zeng, Kai and Zhu, Jinwei and Cui, Bin},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {11},
        pages = {3468--3482},
        doi = {10.14778/3836663.3836702},
        url = {https://doi.org/10.14778/3836663.3836702},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,829 RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search 2026 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 26 of 26 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
36 Accurate Estimation Of The Number Of Tuples Satisfying A Condition 1984 SIGMOD 0.00047863192
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040370171
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
194 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00025636725
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020445545
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015149775
713 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00014571977
804 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013832333
839 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013547412
916 PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension 2020 SIGMOD 0.00013094482
1,328 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011003106
1,373 High-Throughput Vector Similarity Search in Knowledge Graphs 2023 SIGMOD 0.0001088854
2,060 Similarity search in the blink of an eye with compressed indices 2023 VLDB 9.0983169e-05
2,821 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.9711961e-05
2,871 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9229231e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
3,086 New Trends in High-D Vector Similarity Search: AI-driven, Progressive, and Distributed 2021 VLDB 7.6629311e-05
3,385 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.3548612e-05
3,546 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.2123214e-05
8,370 MicroNN: An On-device Disk-resident Updatable Vector Database 2025 SIGMOD 5.34483e-05
10,163 GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search 2026 SIGMOD 5.0682654e-05
10,166 Vector Databases: What’s Really New and What’s Next? (VLDB 2024 Panel) 2024 VLDB 5.0682654e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 839 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD
2 3,774 Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces 2006 SIGMOD
3 8,259 Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study 2026 SIGMOD
4 10,769 Harmonizing Efficiency and Accuracy in Filtered Vector Search 2026 VLDB
5 3,546 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD
6 345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB
7 10,848 QBAT: Model-based Query Budget Autotuner for Clustering-based Approximate Nearest Neighbor Search 2026 VLDB
8 10,547 Beyond Vector Search: Querying With and Without Predicates 2026 SIGMOD
9 2,821 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD
10 6,459 Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search 2025 SIGMOD