首页> 外文会议>IEEE Wireless Communications and Networking Conference Workshops >Efficient and Scalable SPARQL Query Processing with Transformed Table
【24h】

Efficient and Scalable SPARQL Query Processing with Transformed Table

机译:具有转换表的高效且可扩展的SPARQL查询处理

获取原文

摘要

Resource Description Framework (RDF) is the core technology of Semantic Web and has been more and more popular in recent years. With the rapid growth of the RDF data, the Triple Store, which is the query engine and RDF data storage, requires more scalable and efficient technologies. To improve the scalability and the performance of triple query, which is called SPARQL query processing, Map Reduce programming model and NoSQL database system such as H Base are well-known solutions for large scale data processing. However, in general case, the subject of a triple is regarded as Row Key in the table. In some queries, finding matched triple patterns is a time-consuming job. Therefore, we design another table with different storage schema called Transformed Table to reduce the time cost for read operation. The experimental results show that using Transformed Table can improve the triple query performance significantly.
机译:资源描述框架(RDF)是语义Web的核心技术,近年来越来越流行。随着RDF数据的快速增长,作为查询引擎和RDF数据存储的Triple Store需要更可扩展和高效的技术。为了提高称为SPARQL查询处理的三重查询的可伸缩性和性能,Map Reduce编程模型和NoSQL数据库系统(例如H Base)是用于大规模数据处理的著名解决方案。但是,通常情况下,三元组的主题在表中被视为行键。在某些查询中,查找匹配的三重模式是一项耗时的工作。因此,我们设计了另一个具有不同存储模式的表,称为“转换表”,以减少读取操作的时间成本。实验结果表明,使用转换表可以显着提高三重查询的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号