BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:hidders

The blue social bookmark and publication sharing system.

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Querying the Web of Data: A Formal Approach

by: Paolo Bouquet, Chiara Ghidini, and Luciano Serafini

In: The Semantic Web (2009) , p. 291--305.

Resources (URL, PDF, PS...)

URL:	http://dx.doi.org/10.1007/978-3-642-10871-6_20

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.

BibTeX record

@article{cite-key,
  abstract = {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. },
  added-at = {2010-02-03T12:49:15.000+0100},
  author = {Bouquet, Paolo and Ghidini, Chiara and Serafini, Luciano},
  bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-10871-6_20},
  biburl = {http://www.bibsonomy.org/bibtex/2af2bf9ffc6db96960fb3bb720aa6e02f/hidders},
  date-added = {2010-02-03 12:47:57 +0100},
  date-modified = {2010-02-03 12:47:57 +0100},
  interhash = {5cade2bb8427b057a1221ab9609a05cf},
  intrahash = {af2bf9ffc6db96960fb3bb720aa6e02f},
  journal = {The Semantic Web},
  keywords = {federated-query-processing linked-data rdf-indexing sparql},
  m3 = {10.1007/978-3-642-10871-6{\_}20},
  pages = {291--305},
  timestamp = {2010-02-03T12:49:15.000+0100},
  title = {Querying the Web of Data: A Formal Approach},
  ty = {CHAPTER},
  url = {http://dx.doi.org/10.1007/978-3-642-10871-6_20},
  year = 2009
}

Endnote record

%0 Journal Article
%1 cite-key
%A Bouquet, Paolo
%A Ghidini, Chiara
%A Serafini, Luciano
%D 2009
%J The Semantic Web
%K 
%P 291--305
%T Querying the Web of Data: A Formal Approach
%U http://dx.doi.org/10.1007/978-3-642-10871-6_20
%X 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.

BibSonomy :: publication ::

Querying the Web of Data: A Formal Approach

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record