Database Paper Browser

Back to papers

Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files

Summary: Worst-case insertion and deletion for dense sequential files on M pages with gaps. For O(M) changes, runtime ~ log^2 M / page-size, illustrating robust worst-case guarantees for ordered-file data management. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2311
Venue
SIGMOD
Year
1986
Pagerank
0.00010696521
Overall Rank
1,746 | 87.86%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 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
11,822 Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries 2016 PODS 4.1945683e-05
11,966 Cost-Oblivious Storage Reallocation 2014 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

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

Semantically Similar Papers