LEMP: Fast Retrieval of Large Entries in a Matrix Product
Summary: LEMP retrieves large entries in the product of two tall-and-skinny matrices without full matrix computation. It reduces large-entry retrieval to multiple cosine similarity searches and introduces tailored cosine search algorithms, achieving up to 10x speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Christina Teflioudi (Max Planck Institute)
- 2. Rainer Gemulla (University of Mannheim)
- 3. Olga Mykytiuk (Sulzer GmbH)
BibTeX Citation
@inproceedings{teflioudi_sigmod15,
title = {{LEMP: Fast Retrieval of Large Entries in a Matrix Product}},
author = {Teflioudi, Christina and Gemulla, Rainer and Mykytiuk, Olga},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2747647},
url = {https://dl.acm.org/doi/10.1145/2723372.2747647},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,273 | SliceLine: Fast, Linear-Algebra-based Slice Finding for ML Model Debugging | 2021 | SIGMOD | 8.8230899e-05 |
| 2,938 | FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems | 2017 | SIGMOD | 7.942728e-05 |
| 3,724 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 7.1715735e-05 |
| 3,806 | On the Complexity of Inner Product Similarity Join | 2016 | PODS | 7.108802e-05 |
| 6,851 | Maximum Inner Product is Query-Scaled Nearest Neighbor | 2025 | VLDB | 5.7546877e-05 |
| 9,317 | Set Similarity Search for Skewed Data | 2018 | PODS | 5.289545e-05 |
| 10,381 | Integrating Vector Databases across Embedding Models | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00056760516 |
| 991 | Bayesian Locality Sensitive Hashing for Fast Similarity Search | 2012 | VLDB | 0.00012793339 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,766 | On Efficient Large Sparse Matrix Chain Multiplication | 2024 | SIGMOD |
| 2 | 6,973 | Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections | 2012 | VLDB |
| 3 | 10,469 | LM-Tree: A Hybrid Learned Index for Similarity Search in Metric Spaces | 2026 | SIGMOD |
| 4 | 7,942 | Efficient and Tunable Similar Set Retrieval | 2001 | SIGMOD |
| 5 | 2,519 | Similarity search in the blink of an eye with compressed indices | 2023 | VLDB |
| 6 | 8,422 | LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying | 2007 | VLDB |
| 7 | 6,851 | Maximum Inner Product is Query-Scaled Nearest Neighbor | 2025 | VLDB |
| 8 | 8,655 | A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases | 2006 | SIGMOD |
| 9 | 3,353 | Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction | 2008 | SIGMOD |
| 10 | 11,702 | LES3: Learning-based Exact Set Similarity Search | 2021 | VLDB |