Database Paper Browser

Back to papers

Locality preserving dictionaries: theory & application to clustering in databases

Summary: Locality preserving dictionaries (LPDs): partitioned sorted layouts with deliberate gaps so any key range maps to contiguous space proportional to range size, enabling efficient search/insert/delete. On-disk LPD clustering yields 5–13× faster range/sorted scans vs clustered B-trees, at 0–75% storage and up to 28% update overhead. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1187
Venue
PODS
Year
1999
Pagerank
6.5085743e-05
Overall Rank
4,037 | 71.92%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
3,366 An Adaptive Packed-Memory Array 2006 PODS 7.1726818e-05
10,913 Layered List Labeling 2024 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,982 On-line Reorganization of Sparsely-populated B+-trees 1996 SIGMOD 9.8662834e-05
Previous Page 1 / 1 Next

Semantically Similar Papers