Database Paper Browser

Back to papers

Minimizing Time-Space Cost For Database Version Control (extended abstract)

Summary: Introduces a "version graph" model for minimizing space vs. regeneration (time) cost in database version control and shows the general optimization and variants are NP-complete. Proposes heuristics with worst-case guarantees and exact algorithms: linear-time for trees, single-cycle, or max-degree-2 graphs, and O(n^3) for uniform edge lengths. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
839
Venue
PODS
Year
1988
Pagerank
4.1945683e-05
Overall Rank
12,953 | 9.89%
DOI
-

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 1 of 1 citing papers.

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
32 Differential Files: Their Application To The Maintenance Of Large Data Bases 1976 SIGMOD 0.00077486306
740 Integration of Time Versions into a Relational Database System 1984 VLDB 0.00017373475
Previous Page 1 / 1 Next

Semantically Similar Papers