{"title":"面向对象数据库基于模式处理的多种波前算法","authors":"S. Su, Yaw-Huei Chen, H. Lam","doi":"10.1109/PDIS.1991.183066","DOIUrl":null,"url":null,"abstract":"The authors have show previously (1989, 1991) that processing OODBs can be viewed as the manipulation of patterns of object associations. Parallel, multiple wavefront algorithms based on an identification approach for verifying association patterns have been introduced. The current paper presents an elimination approach for processing OODBs. The new approach allows more processors to operate concurrently on a query, thus allowing a higher degree of parallelism in query processing. A formal proof of the correctness of the new approach is given, and a parallel elimination algorithm for processing tree queries is presented. Some simulation results are also provided to compare the performance of the identification approach with the elimination approach.<<ETX>>","PeriodicalId":210800,"journal":{"name":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Multiple wavefront algorithms for pattern-based processing of object-oriented databases\",\"authors\":\"S. Su, Yaw-Huei Chen, H. Lam\",\"doi\":\"10.1109/PDIS.1991.183066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors have show previously (1989, 1991) that processing OODBs can be viewed as the manipulation of patterns of object associations. Parallel, multiple wavefront algorithms based on an identification approach for verifying association patterns have been introduced. The current paper presents an elimination approach for processing OODBs. The new approach allows more processors to operate concurrently on a query, thus allowing a higher degree of parallelism in query processing. A formal proof of the correctness of the new approach is given, and a parallel elimination algorithm for processing tree queries is presented. Some simulation results are also provided to compare the performance of the identification approach with the elimination approach.<<ETX>>\",\"PeriodicalId\":210800,\"journal\":{\"name\":\"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDIS.1991.183066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDIS.1991.183066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multiple wavefront algorithms for pattern-based processing of object-oriented databases
The authors have show previously (1989, 1991) that processing OODBs can be viewed as the manipulation of patterns of object associations. Parallel, multiple wavefront algorithms based on an identification approach for verifying association patterns have been introduced. The current paper presents an elimination approach for processing OODBs. The new approach allows more processors to operate concurrently on a query, thus allowing a higher degree of parallelism in query processing. A formal proof of the correctness of the new approach is given, and a parallel elimination algorithm for processing tree queries is presented. Some simulation results are also provided to compare the performance of the identification approach with the elimination approach.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
