DBScholar

Back to papers

Fast Join Project Query Evaluation using Matrix Multiplication

Summary: Uses matrix multiplication as a subroutine to accelerate projection-enabled joins under worst-case optimality. Parameterized by final output size to pick the best strategy; experiments show up to 50x speedups leveraging optimized, parallel libraries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5882
Venue
SIGMOD
Year
2020
Pagerank
6.2472125e-05
Overall Rank
5,364 | 63.20%
DOI
10.1145/3318464.3380607

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{deep_sigmod20,
        title = {{Fast Join Project Query Evaluation using Matrix Multiplication}},
        author = {Deep, Shaleen and Hu, Xiao and Koutris, Paraschos},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3380607},
        url = {https://dl.acm.org/doi/10.1145/3318464.3380607},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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