DBScholar

Back to papers

DiskJoin: Large-scale Vector Similarity Join with SSD

Summary: DiskJoin: first disk-based similarity join for billion-scale vectors on one machine, leveraging NVMe SSDs to avoid costly cluster communication. It minimizes read amplification via SSD-aware access, uses dynamic cache+eviction policies, and probabilistic pruning to achieve 50×–1000× speedups. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7566
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,359 | 28.93%
DOI
10.1145/3769780

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{chen_sigmod26,
        title = {{DiskJoin: Large-scale Vector Similarity Join with SSD}},
        author = {Chen, Yanqi and Yan, Xiao and Meliou, Alexandra and Lo, Eric},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769780},
        url = {https://dl.acm.org/doi/10.1145/3769780},
        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 17 of 17 cited papers.

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

Rank Cited Paper Year Venue Pagerank
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
145 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD 0.00029548428
169 Efficient Exact Set-Similarity Joins 2006 VLDB 0.0002743469
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
670 SharedDB: Killing One Thousand Queries With One Stone 2012 VLDB 0.00015157572
911 Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints 2008 VLDB 0.00013283031
1,511 Speedup Graph Processing by Graph Ordering 2016 SIGMOD 0.00010538011
1,760 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 9.8157819e-05
1,993 Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data 2001 SIGMOD 9.3421788e-05
2,303 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 8.7783079e-05
2,519 Similarity search in the blink of an eye with compressed indices 2023 VLDB 8.4741476e-05
2,567 ClusterJoin: A Similarity Joins Framework using Map-Reduce 2014 VLDB 8.4098241e-05
3,041 Spatio-Textual Similarity Joins 2013 VLDB 7.8254399e-05
3,108 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.7499741e-05
3,193 Efficient Exact Edit Similarity Query Processing with the Asymmetric Signature Scheme 2011 SIGMOD 7.649474e-05
6,615 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 5.8214312e-05
Previous Page 1 / 1 Next

Semantically Similar Papers