Database Paper Browser

Back to papers

History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures

Summary: History-independent dynamic partitioning for ordered sets S achieved, enabling operation-order privacy with groups of size Theta(B) in partition-based indexes. Against an oblivious adversary, inserts/deletes run in O(1) expected time; high-probability bound is O(B log N / log log N). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1939
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,916 | 24.06%
DOI
10.1145/3651609

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 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,117 Cache-Oblivious String B-trees 2006 PODS 0.00013882205
2,558 Rose: Compressed, log-structured replication 2008 VLDB 8.5455497e-05
11,822 Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries 2016 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers