DBScholar

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
2373
Venue
SIGMOD
Year
1986
Pagerank
8.206745e-05
Overall Rank
2,721 | 81.34%
DOI
10.1145/16894.16879

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{willard_sigmod86,
        title = {{Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files}},
        author = {Willard, Dan E.},
        series = {{SIGMOD} '86},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/16894.16879},
        url = {https://dl.acm.org/doi/10.1145/16894.16879},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,950 An Adaptive Packed-Memory Array 2006 PODS 7.9260861e-05
11,134 Layered List Labeling 2024 PODS 5.093636e-05
12,025 Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries 2016 PODS 5.093636e-05
12,164 Cost-Oblivious Storage Reallocation 2014 PODS 5.093636e-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