Database Paper Browser

Back to papers

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)

Paper ID
5043
Venue
SIGMOD
Year
2015
Pagerank
6.215279e-05
Overall Rank
4,396 | 69.45%
DOI
10.1145/2723372.2747647

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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
8 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015436578
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
1,299 Bayesian Locality Sensitive Hashing for Fast Similarity Search 2012 VLDB 0.00012712766
Previous Page 1 / 1 Next

Semantically Similar Papers