Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries
Summary: Provide history-independent (HI) cache-oblivious B-tree, external-memory skip list, and a HI packed-memory array (PMA) that prevents history leakage from on-disk layout while supporting efficient range queries. HI PMA: O(log^2 N) element moves w.h.p.; HI B-tree: O(log_B N) searches and amortized O(log_B^2 N+log_B N) updates; HI skip list: O(log_B N) I/Os — practical overhead small. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael A. Bender (State University of New York at Stony Brook)
- 2. Jonathan W. Berry (Sandia National Laboratories)
- 3. Rob Johnson (State University of New York at Stony Brook)
- 4. Thomas M. Kroeger (Sandia National Laboratories)
- 5. Samuel McCauley (State University of New York at Stony Brook)
- 6. Cynthia A. Phillips (Sandia National Laboratories)
- 7. Bertrand Simon (Ecole Normale Supérieure de Lyon)
- 8. Shikha Singh (State University of New York at Stony Brook)
- 9. David Zage (Intel)
BibTeX Citation
@inproceedings{bender_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902276},
doi = {10.1145/2902251.2902276},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bender, Michael A. and Berry, Jonathan W. and Johnson, Rob and Kroeger, Thomas M. and McCauley, Samuel and Phillips, Cynthia A. and Simon, Bertrand and Singh, Shikha and Zage, David},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,134 | Layered List Labeling | 2024 | PODS | 5.093636e-05 |
| 11,137 | History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures | 2024 | PODS | 5.093636e-05 |
| 11,970 | Write-Optimized Skip Lists | 2017 | PODS | 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 |
|---|---|---|---|---|
| 1,112 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012125766 |
| 2,721 | Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files | 1986 | SIGMOD | 8.206745e-05 |
| 2,950 | An Adaptive Packed-Memory Array | 2006 | PODS | 7.9260861e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,635 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD |
| 2 | 11,137 | History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures | 2024 | PODS |
| 3 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 4 | 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 5 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 6 | 11,970 | Write-Optimized Skip Lists | 2017 | PODS |
| 7 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 8 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 9 | 1,813 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 10 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |