【24h】

Benchmarking Query Complexity between RDB and OWL

机译:基准测试RDB和OWL之间的查询复杂性

获取原文

摘要

This paper describes how to benchmark relational database; RDB and web ontology language; OWL using query complexity concept on two difference speed machines. The domain was based on Hua Hin tourism. The purpose of this experiment was to benchmarking Semantic Web Knowledge Base Systems on relational perspective of query complexity. We use our tool to run on different speed machines to measure data complexity factors and the time of each activity. As a result, we conclude that if there is more data size and joined variables, the query complexity of RDB will increase but the ontology will reduce one. The advantage, the approach has been implemented and evaluated on improving the search engine of semantic web and reducing the expression complexity on a real archive.
机译:本文介绍了如何基准关系数据库; RDB和Web本体语言;猫头鹰在两个差分速度机器上使用查询复杂性概念。该领域是基于华欣旅游。该实验的目的是基于查询复杂性的关系视角来基准测试语义网络知识库系统。我们使用工具在不同的速度机上运行,​​以测量数据复杂性因素和每个活动的时间。结果,我们得出的结论是,如果有更多的数据大小和连接变量,则RDB的查询复杂性将增加,但本体将减少一个。优点是,该方法已经实现和评估了改进语义Web的搜索引擎并降低真正存档的表达式复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号