DBScholar

Back to papers

On the Complexity of Inner Product Similarity Join

Summary: Characterizes complexity of inner-product similarity join: proves SETH-based subquadratic approximation hardness and provides new upper and lower bounds for (A)LSH across signed/unsigned variants. Introduces a relaxed LSH avoiding asymmetry, novel asymmetric embeddings, and a linear-sketch indexing method that nearly matches the hardness limits. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1679
Venue
PODS
Year
2016
Pagerank
7.108802e-05
Overall Rank
3,806 | 73.89%
DOI
10.1145/2902251.2902285

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ahle_pods16,
        address = {New York, NY, USA},
        series = {{PODS} '16},
        title = {{On the Complexity of Inner Product Similarity Join}},
        url = {https://dl.acm.org/doi/10.1145/2902251.2902285},
        doi = {10.1145/2902251.2902285},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ahle, Thomas D. and Pagh, Rasmus and Razenshteyn, Ilya and Silvestri, Francesco},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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