Optimization of RDF link traversal based query execution  

基于RDF链接遍历查询方案的优化(英文)

作　　者：朱艳琴[1] 花岭[1] 

机构地区：[1]苏州大学计算机科学与技术学院,苏州215006

出　　处：《Journal of Southeast University(English Edition)》2013年第1期27-32,共6页东南大学学报（英文版）

基　　金：The National Natural Science Foundation of China(No.61070170);the Natural Science Foundation of Higher Education Institutions of Jiangsu Province(No.11KJB520017);Suzhou Application Foundation Research Project(No.SYG201238)

摘　　要：Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.针对采用现有的RDF链接遍历查询执行方案只能回答部分类型SPARQL查询的问题,结合具体的SPARQL查询,讨论了元组模式执行顺序对查询结果及查询代价的影响,分析了互联数据Web的2个问题:缺乏反向链接性与不支持偶然发现的解.然后,提出了3个启发式的逻辑查询计划优化原则:FBGP原则、元组模式链原则和种子URIs原则.这3个原则有助于减少中间解和增加可回答的查询类型数目.并通过实验证明了其有效性和可行性.实验结果表明,优化后的方案能够以较小的代价得到更多的查询结果,从而有助于用户更好地发挥互联数据Web的潜能.

关 键 词：web of linked data resource description framework link traversal based query execution （RDF-LTE） SPARQL query query optimization 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]