Database Paper Browser

Back to papers

Cache-oblivious High-performance Similarity Join

Summary: Cache-oblivious similarity join with a space-filling-curve order to boost data locality. Proposes the Fast General Form (FGF) Hilbert-curve: non-recursive, square-agnostic, constant-time per-iteration, enabling cache-oblivious, parallel refinement and operator portability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5671
Venue
SIGMOD
Year
2019
Pagerank
4.6572085e-05
Overall Rank
7,765 | 45.99%
DOI
10.1145/3299869.3319859

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,899 Fast Approximate Similarity Join in Vector Databases 2025 SIGMOD 4.427232e-05
11,467 Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach 2021 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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