Foundations of traversal based query execution over linked data

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