Database Paper Browser

Back to papers

Similarity Caching

Summary: Introduce similarity caching: a metric-space caching variant where a query is a hit if some cached point lies within radius r, optimizing misses under competitive analysis. Prove intractability without extra power, then quantify hardness across metrics (general → bounded doubling → Euclidean) and study variable r and miss–similarity trade-offs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1484
Venue
PODS
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,293 | 14.48%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
128 An Evaluation of Buffer Management Strategies for Relational Database Systems 1985 VLDB 0.00044535268
Previous Page 1 / 1 Next

Semantically Similar Papers