{"title":"通过批处理操作改进树形结构文件组织的差分文件技术","authors":"S. Lang, James R. Driscoll, Jiann H. Jou","doi":"10.1109/ICDE.1986.7266259","DOIUrl":null,"url":null,"abstract":"This paper presents a combined algorithm to perform batch insertion, deletion, and update for tree structured files. The efficiency of the algorithm is analyzed for performing updates only and insertions only. A cost analysis example is reviewed to demonstrate that batch operations for tree structured files achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Improving the differential file technique via batch operations for tree structured file organizations\",\"authors\":\"S. Lang, James R. Driscoll, Jiann H. Jou\",\"doi\":\"10.1109/ICDE.1986.7266259\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a combined algorithm to perform batch insertion, deletion, and update for tree structured files. The efficiency of the algorithm is analyzed for performing updates only and insertions only. A cost analysis example is reviewed to demonstrate that batch operations for tree structured files achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.\",\"PeriodicalId\":415748,\"journal\":{\"name\":\"1986 IEEE Second International Conference on Data Engineering\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-02-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1986 IEEE Second International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1986.7266259\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1986 IEEE Second International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1986.7266259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving the differential file technique via batch operations for tree structured file organizations
This paper presents a combined algorithm to perform batch insertion, deletion, and update for tree structured files. The efficiency of the algorithm is analyzed for performing updates only and insertions only. A cost analysis example is reviewed to demonstrate that batch operations for tree structured files achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.