Querying the Web of Data: A Formal Approach

摘要: The increasing amount of interlinked RDF data has finally made available the necessary building blocks for web data. This in turns makes it possible (and interesting) to query such a collection graphs as an open and decentralized knowledge base. However, despite fact that there are already implementations answering algorithms data, is no formal characterization what satisfactory answer expected be. In this paper, we propose preliminary model which goes beyond standard single-graph semantics, describes three different ways can be answered, characterizes them semantically terms incremental restrictions on relation between domain interpretation each single component graph.