Evaluating graph traversal algorithms for distributed SPARQL query optimization
Evaluating graph traversal algorithms for distributed SPARQL query optimization
Distributed SPARQL queries enable users to retrieve information by exploiting the increasing amount of linked data being published. However, industrial-strength distributed SPARQL query processing is still at its early stage for efficiently answering queries. Previous research shows that it is possible to apply methods from graph theory to optimize the performance of distributed SPARQL. In this paper we describe a framework that can simulate arbitrary RDF data networks to evaluate different approaches of distributed SPARQL query processing. Using this framework we further explore the graph traversal algorithms for distributed SPARQL optimization. We present an implementation of a Minimum-Spanning-Tree-based (MST-based) algorithm for distributed SPARQL processing, the performance of which is compared to other approaches using this evaluation framework. The contribution of this paper is to show that a MST-based approach seems to perform much better than other non graph-traversal-based approaches, and to provide an evaluation framework for evaluating distributed SPARQL processing.
sparql, Linked Date, distributed query processing, graph theory
Wang, Xin
735297cd-af6a-430e-bf68-8550d1a2f60b
Tiropanis, Thanassis
d06654bd-5513-407b-9acd-6f9b9c5009d8
Davis, Hugh
1608a3c8-0920-4a0c-82b3-ee29a52e7c1b
December 2011
Wang, Xin
735297cd-af6a-430e-bf68-8550d1a2f60b
Tiropanis, Thanassis
d06654bd-5513-407b-9acd-6f9b9c5009d8
Davis, Hugh
1608a3c8-0920-4a0c-82b3-ee29a52e7c1b
Wang, Xin, Tiropanis, Thanassis and Davis, Hugh
(2011)
Evaluating graph traversal algorithms for distributed SPARQL query optimization.
Joint International Semantic Technology Conference (JIST 2011), Hangzhou, China.
04 - 07 Dec 2011.
16 pp
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Distributed SPARQL queries enable users to retrieve information by exploiting the increasing amount of linked data being published. However, industrial-strength distributed SPARQL query processing is still at its early stage for efficiently answering queries. Previous research shows that it is possible to apply methods from graph theory to optimize the performance of distributed SPARQL. In this paper we describe a framework that can simulate arbitrary RDF data networks to evaluate different approaches of distributed SPARQL query processing. Using this framework we further explore the graph traversal algorithms for distributed SPARQL optimization. We present an implementation of a Minimum-Spanning-Tree-based (MST-based) algorithm for distributed SPARQL processing, the performance of which is compared to other approaches using this evaluation framework. The contribution of this paper is to show that a MST-based approach seems to perform much better than other non graph-traversal-based approaches, and to provide an evaluation framework for evaluating distributed SPARQL processing.
Text
jist.pdf
- Version of Record
Restricted to Registered users only
Request a copy
More information
Published date: December 2011
Venue - Dates:
Joint International Semantic Technology Conference (JIST 2011), Hangzhou, China, 2011-12-04 - 2011-12-07
Keywords:
sparql, Linked Date, distributed query processing, graph theory
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 272970
URI: http://eprints.soton.ac.uk/id/eprint/272970
PURE UUID: d941c91a-0097-441d-be67-266ea82c9ee2
Catalogue record
Date deposited: 01 Nov 2011 11:56
Last modified: 15 Mar 2024 03:31
Export record
Contributors
Author:
Xin Wang
Author:
Thanassis Tiropanis
Author:
Hugh Davis
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics