DBScholar

Back to papers

Aker: Density-Aware Approximate Caching for Vector Search

Summary: Aker is a density-aware approximate cache for disk-based ANNS, using per-query thresholds that adapt to local neighbor density for higher recall and throughput. Its del-consistency model eagerly applies deletions and lazily refreshes insertions, bounding staleness at low cost. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
h87ecc67dfdf7a3b4
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,820 | 27.26%
DOI
10.14778/3828612.3828627

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{oh_vldb26,
        title = {{Aker: Density-Aware Approximate Caching for Vector Search}},
        author = {Oh, Sukjoon and Kang, Minki and Kim, Dohyun and Lu, Baotong and Liu, Jing and Zhang, Qianxi and Chen, Qi and Won, Youjip},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {10},
        pages = {2727--2740},
        doi = {10.14778/3828612.3828627},
        url = {https://doi.org/10.14778/3828612.3828627},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers