ABSTRACT
Most of the existing benchmark systems for federated SPARQL query systems rely on a set of predefined static queries over a particular set of data sources. Such benchmark are useful for comparing general purpose SPARQL query federation systems such as FedX, SPLENDID etc. However, special purpose federation systems such as TopFed, SAFE etc. cannot be tested with these static benchmarks since these systems only operate on a specific data sets and the corresponding queries. To facilitate the process of benchmarking for such special purpose SPARQL query federation systems, we propose QFed, a dynamic SPARQL query set generator that takes into account the characteristics of both dataset and queries along with the cost of data communication. Our experimental results show that QFed can successfully generate a large set of meaningful federated SPARQL queries to be considered for the performance evaluation of different federated SPARQL query engines.
- M. Acosta, M.-E. Vidal, T. Lampo, J. Castillo, and E. Ruckhaus. ANAPSID: an adaptive query processing engine for SPARQL endpoints. In ISWC, 2011. Google ScholarDigital Library
- M. Arias, J. D. Fernández, M. A. Martínez-Prieto, and P. de la Fuente. An empirical study of real-world sparql queries. CoRR, abs/1103.5043, 2011.Google Scholar
- O. Görlitz and S. Staab. Splendid: Sparql endpoint federation exploiting void descriptions. In COLD, 2011.Google Scholar
- O. Görlitz, M. Thimm, and S. Staab. Splodge: Systematic generation of sparql benchmark queries for linked open data. In ISWC, 2012.Google ScholarDigital Library
- G. Montoya, M.-E. Vidal, Ó. Corcho, E. Ruckhaus, and C. B. Aranda. Benchmarking federated sparql query engines: Are existing testbeds enough? In ISWC, 2012. Google ScholarDigital Library
- M. H. Nur Aini Rakhmawati, Marcel Karnstedt and S. Decker. On metrics for measuring fragmentation of federation over sparql endpoints. In WEBIST, 2014.Google Scholar
- M. Saleem, M. Kamdar, A. Iqbal, S. Sampath, H. Deus, and A.-C. Ngonga Ngomo. Big linked cancer data: Integrating linked tcga and pubmed. JWS, 2014.Google Scholar
- M. Saleem and A.-C. N. Ngomo. Hibiscus: Hypergraph-based source selection for sparql endpoint federation. In ESWC. 2014.Google Scholar
- M. Saleem, A.-C. N. Ngomo, J. X. Parreira, H. F. Deus, and M. Hauswirth. Daw: Duplicate-aware federated query processing over the web of data. In ISWC. 2013. Google ScholarDigital Library
- M. Schmidt, O. GÃűrlitz, P. Haase, A. Schwarte, and T. Tran. Fedbench: A benchmark suite for federated semantic data query processing. In ISWC, 2011. Google ScholarDigital Library
- M. Schmidt, T. Hornung, G. Lausen, and C. Pinkel. Sp2bench: a sparql performance benchmark. In ICDE,2009. Google ScholarDigital Library
- A. Schwarte, P. Haase, K. Hoose, R. Schenkel, and M. Schmidt. Fedx: A federation layer for distributed query processing on linked open data. In ESWC, 2011. Google ScholarDigital Library
- J. Umbrich, A. Hogan, A. Polleres, and S. Decker. Improving the recall of live linked data querying through reasoning. In RR, 2012. Google ScholarDigital Library
Index Terms
- QFed: Query Set For Federated SPARQL Query Benchmark
Recommendations
Query Processing in a Mediator Based Framework for Linked Data Integration
In this paper, the authors present a three-level mediator based framework for linked data integration. In the approach, the mediated schema is represented by a domain ontology, which provides a conceptual representation of the application. Each relevant ...
Supporting virtual integration of Linked Data with just-in-time query recompilation
Semantics2017: Proceedings of the 13th International Conference on Semantic SystemsVirtual data integration takes place at query execution time and relies on transformations of the original query to many target endpoints, where the data reside. In systems that integrate many data sources, this means maintaining many mappings, queries ...
Rewriting general conjunctive queries using views
The problem of rewriting queries using views has important applications in data integration, query optimization, and physical data independence maintenance. Previous researchers have proposed rewriting algorithms for queries and views that are Datalog ...
Comments