{"title":"演绎数据库递归查询处理的传递闭包新算法","authors":"I. H. Toroslu, G. .. Qadah","doi":"10.1109/TAI.1992.246414","DOIUrl":null,"url":null,"abstract":"An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the page I/O operations are minimized. Simulation is used to study the performance of this algorithm and compare it with that of previous algorithms.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"New transitive closure algorithm for recursive query processing in deductive databases\",\"authors\":\"I. H. Toroslu, G. .. Qadah\",\"doi\":\"10.1109/TAI.1992.246414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the page I/O operations are minimized. Simulation is used to study the performance of this algorithm and compare it with that of previous algorithms.<<ETX>>\",\"PeriodicalId\":265283,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1992.246414\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New transitive closure algorithm for recursive query processing in deductive databases
An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the page I/O operations are minimized. Simulation is used to study the performance of this algorithm and compare it with that of previous algorithms.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
