182 research outputs found
Peer-to-peer semantic integration of linked data
We propose a framework for peer-based integration of linked data sets, where the semantic relationships between data at different peers are expressed through mappings. We provide the theoretical foundations for such a setting and we devise an algorithm for processing graph pattern queries, discussing its complexity and scalability
Flexible query processing for SPARQL
Flexible querying techniques can enhance users' access to complex, heterogeneous datasets in settings such as Linked Data, where the user may not always know how a query should be formulated in order to retrieve the desired answers. This paper presents query processing algorithms for a fragment of SPARQL 1.1 incorporating regular path queries (property path queries), extended with query approximation and relaxation operators. Our flexible query processing approach is based on query rewriting and returns answers incrementally according to their ``distance'' from the exact form of the query. We formally show the soundness, completeness and termination properties of our query rewriting algorithm. We also present empirical results that show promising query processing performance for the extended language
Ontology-Based Data Access and Integration
An ontology-based data integration (OBDI) system is an information management system consisting of three components: an ontology, a set of data sources, and the mapping between the two. The ontology is a conceptual, formal description of the domain of interest to a given organization (or a community of users), expressed in terms of relevant concepts, attributes of concepts, relationships between concepts, and logical assertions characterizing the domain knowledge. The data sources are the repositories accessible by the organization where data concerning the domain are stored. In the general case, such repositories are numerous, heterogeneous, each one managed and maintained independently from the others. The mapping is a precise specification of the correspondence between the data contained in the data sources and the elements of the ontology. The main purpose of an OBDI system is to allow information consumers to query the data using the elements in the ontology as predicates.
In the special case where the organization manages a single data source, the term ontology-based data access (ODBA) system is used
On the k-Boundedness for Existential Rules
The chase is a fundamental tool for existential rules. Several chase variants
are known, which differ on how they handle redundancies possibly caused by the
introduction of nulls. Given a chase variant, the halting problem takes as
input a set of existential rules and asks if this set of rules ensures the
termination of the chase for any factbase. It is well-known that this problem
is undecidable for all known chase variants. The related problem of boundedness
asks if a given set of existential rules is bounded, i.e., whether there is a
predefined upper bound on the number of (breadth-first) steps of the chase,
independently from any factbase. This problem is already undecidable in the
specific case of datalog rules. However, knowing that a set of rules is bounded
for some chase variant does not help much in practice if the bound is unknown.
Hence, in this paper, we investigate the decidability of the k-boundedness
problem, which asks whether a given set of rules is bounded by an integer k. We
prove that k-boundedness is decidable for three chase variants, namely the
oblivious, semi-oblivious and restricted chase.Comment: 20 pages, revised version of the paper published at RuleML+RR 201
Ontology-based data access with databases: a short course
Ontology-based data access (OBDA) is regarded as a key ingredient of the new generation of information systems. In the OBDA paradigm, an ontology defines a high-level global schema of (already existing) data sources and provides a vocabulary for user queries. An OBDA system rewrites such queries and ontologies into the vocabulary of the data sources and then delegates the actual query evaluation to a suitable query answering system such as a relational database management system or a datalog engine. In this chapter, we mainly focus on OBDA with the ontology language OWL 2QL, one of the three profiles of the W3C standard Web Ontology Language OWL 2, and relational databases, although other possible languages will also be discussed. We consider different types of conjunctive query rewriting and their succinctness, different architectures of OBDA systems, and give an overview of the OBDA system Ontop
Semantic search in RealFoodTrade
We present RealFoodTrade (RFT), a system that allows farmers
and fisher-
men to sell their products directly to the end-buyer. RFT mak
es use of Linked
Data sets, together with a domain ontology designed by expert
s, to perform
semantic search over products on sale. RFT employs geo-locat
ion technology
on mobile devices to match demand and supply according to the l
ocation.
We sketch the semantic search techniques in RFT and illustrat
e a prototype
tailored to the fishing industry
Impact of dynamical charm quarks
We compute and compare the continuum limits of several quantities in QCD with and without a dynamical charm quark. We consider both low energy quantities, like the hadronic scales r0 and t 0 , and high energy quantities, like the charmonium masses
A description logic based approach for matching user profiles
Several applications require the matching of user profiles, e.g., job recruitment
or dating systems. In this paper we present a logical framework for specifying
user profiles that allows profile description to be incomplete in the parts that are
unavailable or are considered irrelevant by the user. We present an algorithm
for matching demands and supplies of profiles, taking into account incompleteness of profiles and incompatibility between demand and supply. We specialize
our framework to dating services; however, the same techniques can be directly
applied to several other contexts
An introduction to description logics and query rewriting
This chapter gives an overview of the description logics underlying the OWL 2 Web Ontology Language and its three tractable profiles, OWL 2 RL, OWL 2 EL and OWL 2 QL. We consider the syntax and semantics of these description logics as well as main reasoning tasks and their computational complexity. We also discuss the semantical foundations for fist-order and datalog rewritings of conjunctive queries over knowledge bases given in the OWL2 profiles, and outline the architecture of the ontology-based data access system Ontop
Querying Factorized Probabilistic Triple Databases
Abstract. An increasing amount of data is becoming available in the form of large triple stores, with the Semantic Web’s linked open data cloud (LOD) as one of the most prominent examples. Data quality and completeness are key issues in many community-generated data stores, like LOD, which motivates probabilistic and statistical approaches to data representation, reasoning and querying. In this paper we address the issue from the perspective of probabilistic databases, which account for uncertainty in the data via a probability distribution over all database instances. We obtain a highly compressed representation using the re-cently developed RESCAL approach and demonstrate experimentally that efficient querying can be obtained by exploiting inherent features of RESCAL via sub-query approximations of deterministic views
- …