{"title":"关于查询-子查询网络的效率:一个实验观点","authors":"S. Cao","doi":"10.1145/2542050.2542085","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to analyze the efficiency of the QSQN method, which was proposed by us and Nguyen in [10] for evaluating queries to Horn knowledge bases. In order to compare QSQN with the well-known methods QSQR and the one based on the Magic-Set transformation, we have implemented all of these methods. We compare them using representative examples that appear in many articles on deductive databases. Our experimental results show that the QSQN method usually outperforms the two other methods. Apart from the experimental results, we also explain the reasons behind the good performance of QSQN.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"284 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the efficiency of query-subquery nets: an experimental point of view\",\"authors\":\"S. Cao\",\"doi\":\"10.1145/2542050.2542085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of this paper is to analyze the efficiency of the QSQN method, which was proposed by us and Nguyen in [10] for evaluating queries to Horn knowledge bases. In order to compare QSQN with the well-known methods QSQR and the one based on the Magic-Set transformation, we have implemented all of these methods. We compare them using representative examples that appear in many articles on deductive databases. Our experimental results show that the QSQN method usually outperforms the two other methods. Apart from the experimental results, we also explain the reasons behind the good performance of QSQN.\",\"PeriodicalId\":246033,\"journal\":{\"name\":\"Proceedings of the 4th Symposium on Information and Communication Technology\",\"volume\":\"284 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 4th Symposium on Information and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2542050.2542085\",\"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 of the 4th Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2542050.2542085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the efficiency of query-subquery nets: an experimental point of view
The aim of this paper is to analyze the efficiency of the QSQN method, which was proposed by us and Nguyen in [10] for evaluating queries to Horn knowledge bases. In order to compare QSQN with the well-known methods QSQR and the one based on the Magic-Set transformation, we have implemented all of these methods. We compare them using representative examples that appear in many articles on deductive databases. Our experimental results show that the QSQN method usually outperforms the two other methods. Apart from the experimental results, we also explain the reasons behind the good performance of QSQN.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
