{"title":"传递闭关系微分维持的并行算法","authors":"A. Hameurlain, F. Morvan, M. Huguet","doi":"10.1109/PCCC.1992.200516","DOIUrl":null,"url":null,"abstract":"A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"628 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A parallel algorithm for the differential maintenance of a transitively closed relation\",\"authors\":\"A. Hameurlain, F. Morvan, M. Huguet\",\"doi\":\"10.1109/PCCC.1992.200516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"628 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A parallel algorithm for the differential maintenance of a transitively closed relation
A parallel algorithm to propagate the insertion or deletion of a set of tuples in a binary relation into a transitively closed concrete relation without complete recomputation of the transitive closure is presented. The parallel external closure operator is used to determine the tuples which have to be added or deleted from the concrete relation. A performance analysis for the parallel external closure algorithm, the parallel algorithm for the differential maintenance of a transitively closed relation, is presented. The analytical model for the performance analysis is based on the work by P. Valduriez and S. Khoshafian (1988). The performance analysis outlines the improvement in response time for the differential maintenance of a transitively closed relation in contrast to the recomputation of the transitive closure.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
