关于查询-子查询网络的效率:一个实验观点

S. Cao
{"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}
引用次数: 5

摘要

本文的目的是分析QSQN方法的效率,该方法由我们和Nguyen在[10]中提出,用于评估对Horn知识库的查询。为了将QSQN与已知的QSQR方法和基于Magic-Set变换的QSQR方法进行比较,我们实现了所有这些方法。我们使用许多关于演绎数据库的文章中出现的代表性示例对它们进行比较。我们的实验结果表明,QSQN方法通常优于其他两种方法。除了实验结果外,我们还解释了QSQN具有良好性能的原因。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Toward a practical visual object recognition system P2P shared-caching model: using P2P to improve client-server application performance Modeling and debugging numerical constraints of cyber-physical systems design Iterated local search in nurse rostering problem Towards tangent-linear GPU programs using OpenACC
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1