Foundations of traversal based query execution over linked data

Abstract

Query execution over the Web of Linked Data has attracted much attention recently. A particularly interesting approach is link traversal based query execution which proposes to integrate the traversal of data links into the creation of query results. Hence -in contrast to traditional query execution paradigms-this does not assume a fixed set of relevant data sources beforehand; instead, the traversal process discovers data and data sources on the fly and, thus, enables applications to tap the full potential of the Web.While several authors have studied possibilities to implement the idea of link traversal based query execution and to optimize query execution in this context, no work exists that discusses theoretical foundations of the approach in general. Our paper fills this gap.We introduce a well-defined semantics for queries that may be executed using a link traversal based approach. Based on this semantics we formally analyze properties of such queries. In particular, we study the computability of queries as well as the implications of querying a potentially infinite Web of Linked Data. Our results show that query computation in general is not guaranteed to terminate and that for any given query it is undecidable whether the execution terminates. Furthermore, we define an abstract execution model that captures the integration of link traversal into the query execution process. Based on this model we prove the soundness and completeness of link traversal based query execution and analyze an existing implementation approach.

Learning to Assess Linked Data Relationships Using Genetic Programming

“…Link traversal relies on the fact that if data are connected (through owl:sameAs, skos:exactMatch, rdfs:seeAlso or simply by vocabulary reuse), then one can naturally span datasources and gather new knowledge serendipitously. Various studies have shown that Linked Data can be traversed agnostically in contexts such as SPARQL query extensions [7] or (cor-)relation explanation [18,22]. So far, however, uninformed graph searches have been only used for Linked Data crawling or indexing [9,20].…”

Efficient Proposed Framework for Semantic Search Engine using New Semantic Ranking Algorithm

“…For a semantic web query the finishing time also depends on factors such as delays caused by looking up URL (Uniform Resource Locators) [9], indexing large-scale of data [5], and dealing with query termination and broken links problems [10]. Some smart semantic search systems cannot illustrate their important performance in developing precision and lowering recall.…”

Linked Data query processing

“…That is, to execute a given Linked Data query, live-explorationbased systems perform a recursive URI lookup process during which they incrementally discover further URIs that can be scheduled for lookup [25], [26], [27], [28], [29], [30]. Thus, such a system explores the WWW by traversing data links at query execution time.…”