Completeness Statements about RDF Data Sources and Their Use for Query Answering
Conference paper
Abstract
With thousands of RDF data sources available on the Web covering disparate and possibly overlapping knowledge domains, the problem of providing high-level descriptions (in the form of metadata) of their content becomes crucial. In this paper we introduce a theoretical framework for describing data sources in terms of their completeness. We show how existing data sources can be described with completeness statements expressed in RDF. We then focus on the problem of the completeness of query answering over plain and RDFS data sources augmented with completeness statements. Finally, we present an extension of the completeness framework for federated data sources.
Keywords
Resource Description Framework Completeness Statement SPARQL Query Triple Pattern Query Answering
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download
to read the full conference paper text
References
- 1.Alexander, K., Cyganiak, R., Hausenblas, M., Zhao, J.: Describing linked datasets with the VoID vocabulary. Technical report, W3C (2011)Google Scholar
- 2.Arenas, M., Gutierrez, C., Pérez, J.: On the semantics of SPARQL. In: Semantic Web Information Management, pp. 281–307. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 3.Brickley, D., Guha, R.V.: RDF vocabulary description language 1.0: RDF Schema. Technical report, W3C (2004)Google Scholar
- 4.Fürber, C., Hepp, M.: Using SPARQL and SPIN for data quality management on the Semantic Web. In: Abramowicz, W., Tolksdorf, R. (eds.) BIS 2010. LNBIP, vol. 47, pp. 35–46. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 5.Harris, S., Seaborne, A.: SPARQL 1.1 query language. Technical report, W3C (2013)Google Scholar
- 6.Harth, A., Speiser, S.: On completeness classes for query evaluation on linked data. In: AAAI (2012)Google Scholar
- 7.Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL queries over the web of linked data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 8.Heath, T., Bizer, C.: Linked Data: Evolving the Web into a Global Data Space. Synthesis Lectures on the Semantic Web. Morgan & Claypool Publishers (2011)Google Scholar
- 9.Klyne, G., Carroll, J.J.: Resource Description Framework (RDF): Concepts and abstract syntax. Technical report, W3C (2004)Google Scholar
- 10.Letelier, A., Pérez, J., Pichler, R., Skritek, S.: Static analysis and optimization of semantic web queries. In: PODS, pp. 89–100 (2012)Google Scholar
- 11.Levy, A.Y.: Obtaining complete answers from incomplete databases. In: Proc. VLDB, pp. 402–412 (1996)Google Scholar
- 12.Motro, A.: Integrity = Validity + Completeness. ACM TODS 14(4), 480–502 (1989)CrossRefGoogle Scholar
- 13.Muñoz, S., Pérez, J., Gutierrez, C.: Simple and efficient minimal RDFS. J. Web Sem. 7(3), 220–234 (2009)CrossRefGoogle Scholar
- 14.Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM TODS 34(3), 16 (2009)CrossRefGoogle Scholar
- 15.Picalausa, F., Vansummeren, S.: What are real SPARQL queries like? In: SWIM (2011)Google Scholar
- 16.Polleres, A., Feier, C., Harth, A.: Rules with contextually scoped negation. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 332–347. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 17.Razniewski, S., Nutt, W.: Completeness of queries over incomplete databases. PVLDB 4(11), 749–760 (2011)Google Scholar
- 18.Seaborne, A., Polleres, A., Feigenbaum, L., Williams, G.T.: SPARQL 1.1 federated query. Technical report, W3C (2013)Google Scholar
- 19.Hamilton, H.J., Wang, X., Bither, Y.: An ontology-based approach to data cleaning. Department of Computer Science, University of Regina (2005)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2013