HMSST:一种高效的SPARQL查询优化算法

计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 323-326.

HMSST:一种高效的SPARQL查询优化算法

董书暕,汪璟玢

福州大学数学与计算机科学学院福州350108;福州大学数学与计算机科学学院福州350108

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受福州大学科技发展基金资助

HMSST:An Efficient Algorithm for SPARQL Query

DONG Shu-jian and WANG Jing-bin

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 在缩小海量数据查询范围的前提下,结合哈希映射和选择策略树提出了一种SPARQL优化算法——HMSST(HashMapSelectivityStrategyTree),实现了SPARQL的查询优化。并针对LUBM 1000所大学的测试数据集对查询策略进行了实验,实验结果表明:提出的HMSST算法以及存储策略相比现有的查询方案,具有更小的存储代价以及更高的查询能力,在大数据集下可以高效地工作,并且该优化方案在查询的元组模式个数较多和语义较复杂时效果更加明显。

关键词: 哈希映射,查询优化,RDF,SPARQL

Abstract: The paper proposed a novel efficient algorithm,named HMSST(HashMapSelectivityStrategyTree),to optimiz SPARQL query,combining the Hash Map and Selection Strategy Tree,based on narrowing the range of massive data query.HMSST algorithm is estimated by LUBM Benchmark and it works well when the university number reaches 1000.The experimental results show that the HMSST algorithm and the storage strategy are better than the existing query schemes,its storage cost is smaller,its query performance is higher,and it works effectively in large data sets,especially when SPARQL query contains more triple patterns and more complex semanteme.

Key words: Hash map,Query optimization,RDF,SPARQL

董书暕,汪璟玢. HMSST:一种高效的SPARQL查询优化算法[J]. 计算机科学, 2014, 41(Z11): 323-326. https://doi.org/

DONG Shu-jian and WANG Jing-bin. HMSST:An Efficient Algorithm for SPARQL Query[J]. Computer Science, 2014, 41(Z11): 323-326. https://doi.org/

参考文献

[1] 朱敏,程佳,柏文阳.一种基于HBase的RDF数据存储模型[C]∥Proceedings of the NDBC.2013
[2] 王琰,田翠华,朱顺痣,等.基于SPARQL查询小枝关联的RDF数据索引方案[J].厦门大学学报:自然科学版,2014,3(3):322-329
[3] Schmidt M,Meier M,Lausen G.Foundations of SPARQL query optimization [DB/OL].[2009-01-26].The Computing Research.Repository,http://arxiv.org/abs/0812.3788
[4] Abadi D J,Marcus A,Madden S R,et al.Scalable semantic web data management using vertical partitioning [C]∥Chan C Y.Proceedings of the 33rd International Conference on Very Large Data Bases.New York:ACM,2007:411-422
[5] Weiss C,Karras P,Bemstein A.Hexastore:sextuple indexingfor semantic web data anagementl [C]∥Hass L.Proceedings of the 34rd International Conference on Very Large Data Bases.New York:ACM,2008:1008-1019
[6] 叶育鑫.混合语义约简和选择估值优化SPARQ[J].电子学报,2010,8(5):1205-1210
[7] Hatting O.Querying trust in RDF Data with tSPARQL[C]∥Proceedings of 6th European Semantic Web Conference (ESWC’09).Berlin:Springer,2009:5-20
[8] Stocker M,Seaborne A,et al.SPARQL basic graph pattern Optimization using selectivity estimation[C]∥ Liu Y H.www’ 08.New York:ACM,2008:595-604
[9] Guo Y,Pan Z,Heflin J.LUBM:A benchmark for OWL knowledge base systems[J].Web Semantics:Science,Services and Agents on the World Wide Web,2005,3(2):158-182
[10] Huang H,Liu C.Selectivity estimation for SPARQL graph pattern[C]∥Proceedings of the 19th International Conference on World Wide Web.ACM,2010:1115-1116
[11] Papailiou N,Konstantinou I,Tsoumakos D,et al.H2RDF:adaptive query processing on RDF data in the cloud[C]∥Procee-dings of the 21st International Conference Companion on World Wide Web.ACM,2012:397-400
[12] Abraham J,Brazier P,Chebotko A,et al.Distributed storage and querying techniques for a Semantic Web of scientific workflow provenance[C]∥Services Computing (SCC),2010 IEEE International Conference on.IEEE,2010:178-185
[13] McBride B.Jena:A Semantic Web Toolkit [J].IEEE Internet Computing,2002,6(6):55-9

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed