A Shortest Path Approach to SPARQL Chain Query Optimisation

被引：0

作者：

Chawla, Tanvi ^{[1
]}

Singh, Girdhari ^{[1
]}

Pilli, Emmanuel S. ^{[1
]}

机构：

[1] Malaviya Natl Inst Technol, Dept Comp Sci & Engn, Jaipur, Rajasthan, India

来源：

2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI) | 2017年

关键词：

Semantic Web; RDF; SPARQL; triple patterns; query optimisation; selectivity; heuristics;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Semantic Web paradigm has opened several doors for representing information on the web such that this information can be easily understood by both the humans and the machines. Resource Description Framework (RDF) is a popular format for representing information on the Semantic Web and queries on this RDF data are known as SPARQL queries. There are some popular and successful frameworks available for modeling and processing Semantic Web data such as Apache Jena, Sesame etc. The objective is to optimise SPARQL queries in order to reduce their execution time. Many execution plans may be possible for processing a single SPARQL query so, the challenge lies in choosing an optimal one that will be able to produce the results in minimum time and with minimal overhead. In this paper, we have modified the conventional All Pair Shortest Path (APSP) algorithms which take as input a pre-computed cost matrix of a graph-based SPARQL query. This matrix is obtained after computing join costs between triples patterns in a SPARQL query graph using heuristic based techniques.

引用

页码：1778 / 1783

页数：6

共 18 条

[1]

Apache, 2015, JEN FREE OP SOURC JA

[2]

Bernstein A., 2007, OptARQ: Sparql optimization approach based on triple pattern selectivity estimation

[3]

Dadhaniya D. R., 2016, MULTIDISCIPLINARY J, V2

[4]

Damak N., 2010, CLASSICAL SHORTEST P, P1

[5]

Frosini R, 2017, SEMANT WEB, V8, P533, DOI 10.3233/SW-150206

[6] A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation [J].

Gomathi, Ramalingam ;

Sharmila, Dhandapani .

SCIENTIFIC WORLD JOURNAL, 2014,

[7]

HARTIG O, 2007, PROC 4 EUR C SEM, V4519, P564

[8]

Hogenboom A, 2009, LECT NOTES COMPUT SC, V5692, P181, DOI 10.1007/978-3-642-03964-5_18

[9]

Huang JW, 2011, PROC VLDB ENDOW, V4, P1123

[10] Heuristics-Based Query Processing for Large RDF Graphs Using Cloud Computing [J].

Husain, Mohammad Farhan ;

McGlothlin, James ;

Masud, Mohammad Mehedy ;

Khan, Latifur R. ;

Thuraisingham, Bhavani .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (09) :1312-1327

← 1 2 →