DBScholar

Back to papers

Cost-Oblivious Storage Reallocation

Summary: Introduce storage reallocation: allow moving allocated blocks at a subadditive reallocation cost to minimize footprint, improving on the logarithmic overhead of immovable-memory allocation. Give cost-oblivious algorithms (no knowledge of cost function) achieving (1+ε)·OPT footprint and reallocation cost ≤ O((1/ε)·log(1/ε))·allocation-cost, asymptotically optimal for constant ε. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1623
Venue
PODS
Year
2014
Pagerank
5.093636e-05
Overall Rank
12,164 | 16.55%
DOI
10.1145/2594538.2594548

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{bender_pods14,
        address = {New York, NY, USA},
        series = {{PODS} '14},
        title = {{Cost-Oblivious Storage Reallocation}},
        url = {https://dl.acm.org/doi/10.1145/2594538.2594548},
        doi = {10.1145/2594538.2594548},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bender, Michael A. and Farach-Colton, Martin and Fekete, Sándor P. and Fineman, Jeremy T. and Gilbert, Seth},
        year = {2014}
}

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 2 of 2 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,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