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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,951 | An Adaptive Packed-Memory Array | 2006 | PODS | 7.9796299e-05 |
| 10,917 | Layered List Labeling | 2024 | PODS | 5.1725247e-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 |
|---|---|---|---|---|
| 2,913 | On-line Reorganization of Sparsely-populated B+-trees | 1996 | SIGMOD | 8.0358014e-05 |
Previous
Page 1 / 1
Next