How Interlinks Influence Federated over SPARQL Endpoints


As the Web of Data grows, the number of available SPARQL endpoints increases. SPARQL endpoints conceptually represent RPC-style, coarse-grained data access mechanisms. Nevertheless, through the potential interlinking of the contained entities, SPARQL endpoints should be able to over distinct advantages over plain Web APIs. To our knowledge, to date, there has been no study conducted that gauges the impact of the link on SPARQL query execution, especially in a federated set-up. In this paper, we investigate how the existence and types of typed links influences the execution characteristics of different SPARQL federation frameworks. In order to measure the query performance, we propose a combined cost model based on a statistic analysis of the query performance metrics that involves parameters such as type of link, the data catalogues and cache, number of links, and number of distinct subjects. As result, we show that number of distinct subject and number of links have significant impact on Federation over SPARQL Endpoints performance whereas type of link does not have significantly influence in federation query performance.

Share and Cite:

N. Rakhmawati, "How Interlinks Influence Federated over SPARQL Endpoints," International Journal of Internet and Distributed Systems, Vol. 1 No. 1, 2013, pp. 1-8. doi: 10.4236/ijids.2013.11001.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] R. C. Christian Bizer and A. Jentzsch, “State of the Lod Cloud,” Vol. 9, 2011.
[2] M. Schmidt, O. Grlitz, P. Haase, G. Ladwig, A. Schwarte, and T. Tran, “Fedbench: A Benchmark Suite for Federated Semantic Data Query Processing,” In: L. Aroyo, C. Welty, H. Alani, J. Taylor, A. Bernstein, L. Kagal, N. F. Noy and E. Blomqvist, Eds., International Semantic Web Conference (1), Lecture Notes in Computer Science, Vol. 7031, Springer, Heidelberg, 2011, pp. 585-600.
[3] J. Umbrich, M. Karnstedt, A. Hogan and J. Parreira, “Hybird Sparql Queries: Fresh vs. Fast Results,” In: P. Cudr-Mauroux, J. Heflin, E. Sirin, T. Tudorache, J. Euzenat, M. Hauswirth, J. Parreira, J. Hendler, G. Schreiber, A. Bernstein and E. Blomqvst, Eds., The Semantic Web ISWC 2012, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2012, pp. 608-624. doi:10.1007/978-3-642-35176-1_38
[4] O. Hartig, “Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution,” Proceedings of the 8th Extended Semantic Web Conference on the Semantic Web: Research and Application, ESWC 2011, Berlin, Heidelberg, Springer-Verlag, 2011, pp. 154-169.
[5] A. Schwarte, P. Haase, K. Hoose, R. Schenkel and M. Schmidt, “Fedx: A Federation Layer for Distributed Query Processing on Linked Open Data,” ESWC, 2011.
[6] O. G?rlitz and S. Staab, “SPLENDID: SPARQL Endpoint Federation Exploiting VOID Descriptions,” Proceedings of the 2nd Internation Workshop on Consuming Linked Data, Bonn, 23 October 2011.
[7] B. Quilitz and U. Leser, “Querying Distributed RDF Data Sources with Sparql,” Proceedings of the 5th European Semantic Web Conference on the Semantic Web: Research and Applications, ESWC’08, Berlin, Springer-Verlag, Heidelberg, 2008. pp. 524-538.
[8] A. Jentzsch, R. Isele and C. Bizer, “Silk-Generating RDF Links While Publishing or Consuming Linked Data,” International Semantic Web Conference (ISWC-2010), Shanghai, 2010.
[9] A.-C. Ngonga Ngomo and S. Auer, “Limes-A Time-Efficient Approcah for Large Scale Link Discovery on the Web of Data,” Proceeedings of IJCAI, Vol. 15, 2011, pp. 2312-2317.
[10] Y. Guo, Z. Pan and J. Heflin, “Lubm: A Benchmark for Owl Knowledge Base Systems,” Web Semantic: Science, Services and Agents on the World Wide Web. International Semantic Web Conference, Vol. 3, No. 2-3, 2005, pp. 158-182.
[11] C. Bizer, T. Heath, K. Idehen and T. Berners-Lee, “Linked Data: Evolving the Web into a Global Data Space,” Morgan & Calypool Publishers, San Rafael, 2008.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.