We consider the setting of a Semantic Web database, containing both explicit data encoded
in RDF triples, and implicit data, implied by the RDF semantics. Based on a query workload …

A growing amount of Linked Data—graph-structured data accessible at sources distributed
across the Web—enables advanced data integration and decision-making applications …

A promising method for efficiently querying RDF data consists of translating SPARQL
queries into efficient RDBMS-style operations. However, answering SPARQL queries …

Stream Data processing has become a popular topic in database research addressing the
challenge of efficiently answering queries over continuous data streams. Meanwhile data …

Reformulation-based query answering is a query processing technique aiming at answering
queries under constraints. It consists of reformulating the query based on the constraints, so …

Query answering in RDF knowledge bases has traditionally been performed either through
graph saturation, ie, adding all implicit triples to the graph, or through query reformulation, ie …

The huge and growing volume of linked data is increasing the interest in developing
applications on top of such data. One of the distinguishing features of linked data …

We present the WebContent platform for managing distributed repositories of XML and
semantic Web data. The platform allows integrating various data processing building blocks …

In this paper, we propose an intelligent distributed query processing method considering the
characteristics of a distributed ontology environment. We suggest more general models of …

This paper provides a decentralized data model and associated algorithms for peer data
management systems (PDMS) based on the DL-LITER description logic. Our approach …