首页> 外文会议>Future generation information technology >Benchmarking Query Complexity between RDB and OWL
【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本体语言; OWL在两个不同速度的机器上使用查询复杂性概念。该域名基于华欣旅游。该实验的目的是从查询复杂度的关系角度对语义Web知识库系统进行基准测试。我们使用我们的工具在不同速度的机器上运行,以测量数据复杂性因素和每个活动的时间。结果,我们得出结论,如果有更多的数据大小和连接的变量,RDB的查询复杂性将增加,但是本体将减少一个。优点在于,该方法已得到实施和评估,可改善语义Web的搜索引擎并降低实际档案中的表达复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号