Database Paper Browser

Back to papers

Worst-Case-Optimal Similarity Joins on Graph Databases

Summary: Worst-case-optimal graph equijoins extended to k-NN similarity by fusing the data graph with a k-NN graph and using LTJ on a Ring to integrate similarity predicates. Wikidata–IMGpedia experiments show clear gains over a two-phase baseline, especially for dense similarity connections (up to an order of magnitude). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6848
Venue
SIGMOD
Year
2024
Pagerank
4.2456408e-05
Overall Rank
9,940 | 30.85%
DOI
10.1145/3639294

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,367 Aster: Enhancing LSM-structures for Scalable Graph Database 2025 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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