Minimizing time-space cost for database version control

Authors:
Lin Yu;Daniel J. Rosenkrantz
Affiliations:
Department of Computer Science, University of New York at Albany, Albany, NY;Department of Computer Science, University of New York at Albany, Albany, NY
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 11
Cited 2

Data structures and network algorithms

Data structures and network algorithms
RCS—a system for version control

Software—Practice & Experience
Version control in the Inscape environment

ICSE '87 Proceedings of the 9th international conference on Software Engineering
Database system support for software engineering

ICSE '87 Proceedings of the 9th international conference on Software Engineering
Differential files: their application to the maintenance of large databases

ACM Transactions on Database Systems (TODS)
Algorithm 97: Shortest path

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Integration of Time Versions into a Relational Database System

VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Design, implementation, and evaluation of a Revision Control System

ICSE '82 Proceedings of the 6th international conference on Software engineering
An all pairs shortest path algorithm with expected running time O(n 2logn)

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Representability of design objects by ancestor-controlled hierarchical specifications

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Ancestor Controlled Submodule Inclusion in Design Databases

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of a version graph to model the problem of minimising the space and version regeneration cost for database version control. We show that, in general, this problem and several of its variations are NP-complete. Motivated by the practical importance of these problems, we develop several heuristics and obtain worst-case guarantees on their performance. We also present linear time algorithms for problems characterized by special classes of version graphs.