Distributed and parallel database systems
ACM Computing Surveys (CSUR)
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Optimizing Queries Across Diverse Data Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Index structures and algorithms for querying distributed RDF repositories
Proceedings of the 13th international conference on World Wide Web
SPARQL basic graph pattern optimization using selectivity estimation
Proceedings of the 17th international conference on World Wide Web
The SPARQL Query Graph Model for Query Optimization
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
SP^2Bench: A SPARQL Performance Benchmark
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Can RDB2RDF Tools Feasibily Expose Large Science Archives for Data Integration?
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Optimization of Distributed SPARQL Queries Using Edmonds' Algorithm and Prim's Algorithm
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 01
Scalable indexing of RDF graphs for efficient join processing
Proceedings of the 18th ACM conference on Information and knowledge management
Querying the Web of Data: A Formal Approach
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
SPARQL query rewriting for implementing data integration over linked data
Proceedings of the 2010 EDBT/ICDT Workshops
Querying distributed RDF data sources with SPARQL
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
An evaluation of approaches to federated query processing over linked data
Proceedings of the 6th International Conference on Semantic Systems
Linked data query processing strategies
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
| Hi-index | 0.00 |
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.