On Completeness Classes for Query Evaluation on Linked Data

The advent of the Web of Data kindled interest in linktraversal (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 clearlydefined 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.

Authors

• Andreas Harth Karlsruhe Institute of Technology (KIT)
• Sebastian Speiser Karlsruhe Institute of Technology (KIT)

Keywords

No keywords are indexed for this paper.