Abstract

This paper describes a space-efficient technique for recording successive differences between versions of data. The technique is based on the combined use of differential files and change area b-trees. The strengths of the technique are that a branching tree of versions can be accommodated; any data item in any version can be accessed with approximately equal access time; and very large volumes of data can be accommodated. The paper also describes the use of this technique to support very long transactions in the SDS2 software development system. Here the technique is used in an optimistic concurrency control scheme.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.