K. Jea, H. Feng, Yang-Ren Yau, Shih-Kung Chen, Jian-Cheng Dai
{"title":"A difference-based version model for OODBMS","authors":"K. Jea, H. Feng, Yang-Ren Yau, Shih-Kung Chen, Jian-Cheng Dai","doi":"10.1109/APSEC.1998.733741","DOIUrl":null,"url":null,"abstract":"Data versioning is important for many applications such as CASE, CAD and CAM. New design objects in these applications are usually created from existing ones because they share a large degree of similarity. In this paper we propose a difference-based version model for object-oriented database systems. The large object stores only the difference data from its parent version. To show the feasibility of this version model, a prototype is implemented and a performance study on the version storage and access time is made. We observe from this study that, when the difference between two versions is less than 10%, the system has the best storage efficiency and incurs the least overhead in access time. Our implementation experience also shows that the proposed version model can be implemented as an independent module to plug in a data storage system easily.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.1998.733741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Data versioning is important for many applications such as CASE, CAD and CAM. New design objects in these applications are usually created from existing ones because they share a large degree of similarity. In this paper we propose a difference-based version model for object-oriented database systems. The large object stores only the difference data from its parent version. To show the feasibility of this version model, a prototype is implemented and a performance study on the version storage and access time is made. We observe from this study that, when the difference between two versions is less than 10%, the system has the best storage efficiency and incurs the least overhead in access time. Our implementation experience also shows that the proposed version model can be implemented as an independent module to plug in a data storage system easily.