Querying the Web of Data: A Formal Approach
The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interesting) to query such a collection of graphs as an open and decentralized knowledge base. However, despite the fact that there are already implementations of query answering algorithms for the web of data, there is no formal characterization of what a satisfactory answer is expected to be. In this paper, we propose a preliminary model for such an open collection of graphs which goes beyond the standard single-graph RDF semantics, describes three different ways in which a query can be answered, and characterizes them semantically in terms of three incremental restrictions on the relation between the domain of interpretation of each single component graph.
Unable to display preview. Download preview PDF.
- 2.Bizer, C., Cyganiak, R., Heath, T.: How to publish linked data on the web, http://sites.wiwiss.fu-berlin.de/suhl/bizer/pub/LinkedDataTutorial/20070727/
- 4.Ding, L., Finin, T., Peng, Y., Pinheiro da Silva, P., McGuinness, D.L.: Tracking RDF Graph Provenance using RDF Molecules. Technical report, UMBC (April 2005)Google Scholar
- 5.Ghidini, C., Serafini, L.: Distributed First Order Logics. In: Gabbay, D., de Rijke, M. (eds.) Frontiers Of Combining Systems 2 (Papers presented at FroCoS 1998). Studies in Logic and Computation, pp. 121–140. Research Studies Press/Wiley (1998)Google Scholar