Named graphs, provenance and trust
WWW '05 Proceedings of the 14th international conference on World Wide Web
Package-Based Description Logics
Modular Ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Linkator: enriching web pages by automatically adding dereferenceable semantic annotations
ICWE'10 Proceedings of the 10th international conference on Web engineering
Zero-knowledge query planning for an iterator implementation of link traversal based query execution
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Foundations of traversal based query execution over linked data
Proceedings of the 23rd ACM conference on Hypertext and social media
SPARQL for a web of linked data: semantics and computability
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Evaluating graph traversal algorithms for distributed SPARQL query optimization
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
| Hi-index | 0.00 |
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.