Federated SPARQL basic graph pattern optimization using links over the web of linked data

Xuejin Li; Zhendong Niu

doi:10.12785/amis/090607

Federated SPARQL basic graph pattern optimization using links over the web of linked data

Xuejin Li, Zhendong Niu^*

^*Corresponding author for this work

School of Computer Science and Technology

Research output: Contribution to journal › Article › peer-review

Abstract

The fast growth of the web of linked data raises new challenges for distributed query processing. Different from traditional federated databases, linked data sources cannot cooperate with each other. Hence, sophisticated optimization techniques are necessary for efficient query processing. In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for federated SPARQL queries over the Web of Linked Data. We define and analyze the characteristics of source selection for links based static BGP optimization. The classes of bound subject and object associated with bound predicates of triple patterns are first used to select the set of relevant sources. Then links between linked data are used to prune the relevant sources of triple patterns. With the FedBench benchmark, we evaluate the performance of our approach of source selection for FedBench queries. The results of the evaluation show the feasibility of our approach.

Original language	English
Pages (from-to)	2813-2821
Number of pages	9
Journal	Applied Mathematics and Information Sciences
Volume	9
Issue number	6
DOIs	https://doi.org/10.12785/amis/090607
Publication status	Published - 2015

Keywords

Federated query processing
SPARQL
The web of data

Access to Document

10.12785/amis/090607

Cite this

Li, X., & Niu, Z. (2015). Federated SPARQL basic graph pattern optimization using links over the web of linked data. Applied Mathematics and Information Sciences, 9(6), 2813-2821. https://doi.org/10.12785/amis/090607

@article{9342603a8e2c4f01b10fce672ed2ce31,

title = "Federated SPARQL basic graph pattern optimization using links over the web of linked data",

abstract = "The fast growth of the web of linked data raises new challenges for distributed query processing. Different from traditional federated databases, linked data sources cannot cooperate with each other. Hence, sophisticated optimization techniques are necessary for efficient query processing. In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for federated SPARQL queries over the Web of Linked Data. We define and analyze the characteristics of source selection for links based static BGP optimization. The classes of bound subject and object associated with bound predicates of triple patterns are first used to select the set of relevant sources. Then links between linked data are used to prune the relevant sources of triple patterns. With the FedBench benchmark, we evaluate the performance of our approach of source selection for FedBench queries. The results of the evaluation show the feasibility of our approach.",

keywords = "Federated query processing, SPARQL, The web of data",

author = "Xuejin Li and Zhendong Niu",

note = "Publisher Copyright: {\textcopyright} 2015 NSP Natural Sciences Publishing Cor.",

year = "2015",

doi = "10.12785/amis/090607",

language = "English",

volume = "9",

pages = "2813--2821",

journal = "Applied Mathematics and Information Sciences",

issn = "1935-0090",

publisher = "Natural Sciences Publishing",

number = "6",

}

TY - JOUR

T1 - Federated SPARQL basic graph pattern optimization using links over the web of linked data

AU - Li, Xuejin

AU - Niu, Zhendong

PY - 2015

Y1 - 2015

N2 - The fast growth of the web of linked data raises new challenges for distributed query processing. Different from traditional federated databases, linked data sources cannot cooperate with each other. Hence, sophisticated optimization techniques are necessary for efficient query processing. In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for federated SPARQL queries over the Web of Linked Data. We define and analyze the characteristics of source selection for links based static BGP optimization. The classes of bound subject and object associated with bound predicates of triple patterns are first used to select the set of relevant sources. Then links between linked data are used to prune the relevant sources of triple patterns. With the FedBench benchmark, we evaluate the performance of our approach of source selection for FedBench queries. The results of the evaluation show the feasibility of our approach.

AB - The fast growth of the web of linked data raises new challenges for distributed query processing. Different from traditional federated databases, linked data sources cannot cooperate with each other. Hence, sophisticated optimization techniques are necessary for efficient query processing. In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for federated SPARQL queries over the Web of Linked Data. We define and analyze the characteristics of source selection for links based static BGP optimization. The classes of bound subject and object associated with bound predicates of triple patterns are first used to select the set of relevant sources. Then links between linked data are used to prune the relevant sources of triple patterns. With the FedBench benchmark, we evaluate the performance of our approach of source selection for FedBench queries. The results of the evaluation show the feasibility of our approach.

KW - Federated query processing

KW - SPARQL

KW - The web of data

UR - http://www.scopus.com/inward/record.url?scp=84938897193&partnerID=8YFLogxK

U2 - 10.12785/amis/090607

DO - 10.12785/amis/090607

M3 - Article

AN - SCOPUS:84938897193

SN - 1935-0090

VL - 9

SP - 2813

EP - 2821

JO - Applied Mathematics and Information Sciences

JF - Applied Mathematics and Information Sciences

IS - 6

ER -

Federated SPARQL basic graph pattern optimization using links over the web of linked data

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this