On Completeness Classes for Query Evaluation on Linked Data

The advent of the Web of Data kindled interest in link-traversal (or lookup-based) query processing methods, with which queries are answered via dereferencing a potentially large number of small, interlinked sources. While several algorithms for query evaluation have been proposed, there exists no notion of completeness for results of so-evaluated queries. In this paper, we motivate the need for clearly-defined completeness classes and present several notions of completeness for queries over Linked Data, based on the idea of authoritativeness of sources, and show the relation between the different completeness classes.

[1]  Jürgen Umbrich,et al.  Data summaries for on-demand queries over linked data , 2010, WWW '10.

[2]  Marcelo Arenas,et al.  Semantics and Complexity of SPARQL , 2006, International Semantic Web Conference.

[3]  David Maier,et al.  From databases to dataspaces: a new abstraction for information management , 2005, SGMD.

[4]  Peter Haase,et al.  An evaluation of approaches to federated query processing over linked data , 2010, I-SEMANTICS '10.

[5]  Serge Abiteboul,et al.  Queries and computation on the web , 1997, Theor. Comput. Sci..

[6]  Tim Berners-Lee,et al.  Linked data , 2020, Semantic Web for the Working Ontologist.

[7]  Olaf Hartig,et al.  SPARQL for a Web of Linked Data: Semantics and Computability (Extended Version) , 2012, ESWC.

[8]  Günter Ladwig,et al.  Linked Data Query Processing Strategies , 2010, SEMWEB.

[9]  Andreas Harth,et al.  Scalable Authoritative OWL Reasoning for the Web , 2011, Semantic Services, Interoperability and Web Applications.

[10]  Claudio Gutiérrez,et al.  Semantic navigation on the web of data: specification of routes, web fragments and actions , 2011, WWW.

[11]  Fausto Giunchiglia,et al.  Local Relational Model: A Logical Formalization of Database Coordination , 2003, CONTEXT.

[12]  Jürgen Umbrich,et al.  Improving the recall of decentralised linked data querying through implicit knowledge , 2011, ArXiv.

[13]  Alberto O. Mendelzon,et al.  Formal models of Web queries , 1997, Inf. Syst..

[14]  Andreas Harth,et al.  Rules with Contextually Scoped Negation , 2006, ESWC.

[15]  Christian Bizer,et al.  Executing SPARQL Queries over the Web of Linked Data , 2009, SEMWEB.

[16]  Frank van Harmelen,et al.  C-OWL: Contextualizing Ontologies , 2003, SEMWEB.