On Completeness Classes for Query Evaluation on Linked Data
Andreas Harth, Sebastian Speiser
Abstract
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.
Topics & Concepts
Completeness (order theory)Tree traversalComputer scienceInformation retrievalRelation (database)Query optimizationTheoretical computer scienceData miningProgramming languageMathematicsMathematical analysisSemantic Web and OntologiesAdvanced Database Systems and QueriesData Management and Algorithms