research-article

QFed: Query Set For Federated SPARQL Query Benchmark

Authors:

Nur Aini Rakhmawati,

Muhammad Saleem,

Sarasi Lalithsena,

Stefan DeckerAuthors Info & Claims

iiWAS '14: Proceedings of the 16th International Conference on Information Integration and Web-based Applications & Services

Pages 207 - 211

https://doi.org/10.1145/2684200.2684321

Published: 04 December 2014 Publication History

Get Access

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.

References

[1]

M. Acosta, M.-E. Vidal, T. Lampo, J. Castillo, and E. Ruckhaus. ANAPSID: an adaptive query processing engine for SPARQL endpoints. In ISWC, 2011.

Digital Library

Google Scholar

[2]

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

[3]

O. Görlitz and S. Staab. Splendid: Sparql endpoint federation exploiting void descriptions. In COLD, 2011.

Google Scholar

[4]

O. Görlitz, M. Thimm, and S. Staab. Splodge: Systematic generation of sparql benchmark queries for linked open data. In ISWC, 2012.

Digital Library

Google Scholar

[5]

G. Montoya, M.-E. Vidal, Ó. Corcho, E. Ruckhaus, and C. B. Aranda. Benchmarking federated sparql query engines: Are existing testbeds enough? In ISWC, 2012.

Digital Library

Google Scholar

[6]

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

[7]

M. Saleem, M. Kamdar, A. Iqbal, S. Sampath, H. Deus, and A.-C. Ngonga Ngomo. Big linked cancer data: Integrating linked tcga and . JWS, 2014.

Google Scholar

[8]

M. Saleem and A.-C. N. Ngomo. Hibiscus: Hypergraph-based source selection for sparql endpoint federation. In ESWC. 2014.

Google Scholar

[9]

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.

Digital Library

Google Scholar

[10]

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.

Digital Library

Google Scholar

[11]

M. Schmidt, T. Hornung, G. Lausen, and C. Pinkel. Sp2bench: a sparql performance benchmark. In ICDE,2009.

Digital Library

Google Scholar

[12]

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.

Digital Library

Google Scholar

[13]

J. Umbrich, A. Hogan, A. Polleres, and S. Decker. Improving the recall of live linked data querying through reasoning. In RR, 2012.

Digital Library

Google Scholar

Cited By

View all

Gu ZCorcoglioniti FLanti DMosca AXiao GXiong JCalvanese D(2024)A systematic overview of data federation systemsSemantic Web10.3233/SW-22320115:1(107-165)Online publication date: 12-Jan-2024
https://doi.org/10.3233/SW-223201
Dang MAimonier-Davat JMolli PHartig OSkaf-Molli HLe Crom Y(2023)FedShop: A Benchmark for Testing the Scalability of SPARQL Federation EnginesThe Semantic Web – ISWC 202310.1007/978-3-031-47243-5_16(285-301)Online publication date: 27-Oct-2023
https://doi.org/10.1007/978-3-031-47243-5_16
Qudus USaleem MNgonga Ngomo ALee YSaleem MVerborgh RAli MHartig O(2021)An empirical evaluation of cost-based federated SPARQL query processing enginesSemantic Web10.3233/SW-20042012:6(843-868)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.3233/SW-200420
Show More Cited By

Index Terms

QFed: Query Set For Federated SPARQL Query Benchmark
1. General and reference
  1. Cross-computing tools and techniques
    1. Metrics

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 Systems

Virtual 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

Information & Contributors

Information

Published In

iiWAS '14: Proceedings of the 16th International Conference on Information Integration and Web-based Applications & Services

December 2014

587 pages

ISBN:9781450330015

DOI:10.1145/2684200

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

@WAS: International Organization of Information Integration and Web-based Applications and Services
Johannes Kepler Univ Linz: Johannes Kepler Universität Linz

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 December 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

iiWAS '14

iiWAS '14: The 16th International Conference on Information Integration and Web-based Applications & Services

December 4 - 6, 2014

Hanoi, Viet Nam

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
85
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gu ZCorcoglioniti FLanti DMosca AXiao GXiong JCalvanese D(2024)A systematic overview of data federation systemsSemantic Web10.3233/SW-22320115:1(107-165)Online publication date: 12-Jan-2024
https://doi.org/10.3233/SW-223201
Dang MAimonier-Davat JMolli PHartig OSkaf-Molli HLe Crom Y(2023)FedShop: A Benchmark for Testing the Scalability of SPARQL Federation EnginesThe Semantic Web – ISWC 202310.1007/978-3-031-47243-5_16(285-301)Online publication date: 27-Oct-2023
https://doi.org/10.1007/978-3-031-47243-5_16
Qudus USaleem MNgonga Ngomo ALee YSaleem MVerborgh RAli MHartig O(2021)An empirical evaluation of cost-based federated SPARQL query processing enginesSemantic Web10.3233/SW-20042012:6(843-868)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.3233/SW-200420
Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2018)LusailProceedings of the VLDB Endowment10.1145/3164135.316414411:4(485-498)Online publication date: 5-Oct-2018
Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2017)LusailProceedings of the VLDB Endowment10.1145/3186728.316414411:4(485-498)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1145/3186728.3164144
Acosta MVidal MSure-Vetter Y(2017)Diefficiency Metrics: Measuring the Continuous Efficiency of Query Processing ApproachesThe Semantic Web – ISWC 201710.1007/978-3-319-68204-4_1(3-19)Online publication date: 4-Oct-2017
https://doi.org/10.1007/978-3-319-68204-4_1

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Query Processing in a Mediator Based Framework for Linked Data Integration

Supporting virtual integration of Linked Data with just-in-time query recompilation

Rewriting general conjunctive queries using views

Comments

Information

Published In

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations