Modeling concepts for VLSI CAD objects
ACM Transactions on Database Systems (TODS)
RCS—a system for version control
Software—Practice & Experience
Computational geometry: an introduction
Computational geometry: an introduction
Version Support for Engineering Database Systems
IEEE Transactions on Software Engineering
Minimizing time-space cost for database version control
Acta Informatica
Toward a unified framework for version modeling in engineering databases
ACM Computing Surveys (CSUR)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
A technique for isolating differences between files
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A database approach for managing VLSI design data
DAC '82 Proceedings of the 19th Design Automation Conference
Efficient distributed backup with delta compression
Proceedings of the fifth workshop on I/O in parallel and distributed systems
| Hi-index | 0.00 |
An efficient scheme to store and reconstruct versions of sequential files is presented. The reconstruction scheme involves building a data structure representing a complete version, and then successively modifying this data structure by applying a sequence of specially formatted differential files to it. Each application of a differential file produces a representation of an intermediate version, with the final data structure representing the requested version.The scheme uses a linked list to represent an intermediate version, instead of a sequential array, as is used traditionally. A new format for differential files specifying changes to this linked list data structure is presented. The specification of each change points directly to where the change is to take place, thereby obviating a search. Algorithms are presented for using such a new format differential file to transform the representation of a version, and for reconstructing a requested version. Algorithms are also presented for generating the new format differential files, both for the case of a forward differential specifying how to transform the representation of an old version to the representation of a new version, and for the case of a reverse differential specifying how to transform the representation of a new version to the representation of an old version.The new version reconstruction scheme takes time linear in the sum of the size of the initial complete version and the sizes of the file differences involved in reconstructing the requested version. In contrast, the classical scheme for reconstructing versions takes time proportional to the sum of the sizes of the sequence of versions involved in the reconstruction, and therefore has a worst-case time that is quadratic in the sum of the size of the initial complete version and the sizes of the file differences. The time cost of the new differential file generation scheme is comparable to the time cost of the classical differential file generation scheme.