Página 1 dos resultados de 299 itens digitais encontrados em 0.003 segundos

## Approximate Query Answering Using Data Warehouse Striping

Tipo: Artigo de Revista Científica
ENG
Relevância na Pesquisa
46.56%
This paper presents and evaluates a simple but very effective method to implement large data warehouses on an arbitrary number of computers, achieving very high query execution performance and scalability. The data is distributed and processed in a potentially large number of autonomous computers using our technique called data warehouse striping (DWS). The major problem of DWS technique is that it would require a very expensive cluster of computers with fault tolerant capabilities to prevent a fault in a single computer to stop the whole system. In this paper, we propose a radically different approach to deal with the problem of the unavailability of one or more computers in the cluster, allowing the use of DWS with a very large number of inexpensive computers. The proposed approach is based on approximate query answering techniques that make it possible to deliver an approximate answer to the user even when one or more computers in the cluster are not available. The evaluation presented in the paper shows both analytically and experimentally that the approximate results obtained this way have a very small error that can be negligible in most of the cases.; http://dx.doi.org/10.1023/A:1016551309288

## Formalização do processo de tradução de consultas em ambientes de integração de dados XML; Formalization of a query translation process in XML data integration

Alves, Willian Bruno Gomes
Tipo: Dissertação Formato: application/pdf
POR
Relevância na Pesquisa
56.73%

## Smart Query Answering for Marine Sensor Data

Shahriar, Md. Sumon; de Souza, Paulo; Timms, Greg
Fonte: Molecular Diversity Preservation International (MDPI) Publicador: Molecular Diversity Preservation International (MDPI)
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.92%
We review existing query answering systems for sensor data. We then propose an extended query answering approach termed smart query, specifically for marine sensor data. The smart query answering system integrates pattern queries and continuous queries. The proposed smart query system considers both streaming data and historical data from marine sensor networks. The smart query also uses query relaxation technique and semantics from domain knowledge as a recommender system. The proposed smart query benefits in building data and information systems for marine sensor networks.

## Dealing with Inconsistencies and Updates in Description Logic Knowledge Bases

Savo, Domenico Fabio
EN_US
Relevância na Pesquisa
46.84%
The main purpose of an "Ontology-based Information System" (OIS) is to provide an explicit description of the domain of interest, called ontology, and let all the functions of the system be based on such representation, thus freeing the users from the knowledge about the physical repositories where the real data reside. The functionalities that an OIS should provide to the user include both query answering, whose goal is to extract information from the system, and update, whose goal is to modify the information content of the system in order to reflect changes in the domain of interest. The "ontology" is a formal, high quality intentional representation of the domain, designed in such a way to avoid inconsistencies in the modeling of concepts and relationships. On the contrary, the extensional level of the system, constituted by a set of autonomous, heterogeneous data sources, is built independently from the conceptualization represented by the ontology, and therefore may contain information that is incoherent with the ontology itself. This dissertation presents a detailed study on the problem of dealing with inconsistencies in OISs, both in query answering, and in performing updates. We concentrate on the case where the knowledge base in the OISs is expressed in Description Logics...

## Sound and Complete Query Answering in Intensional P2P Data Integration

Majkic, Zoran
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.77%
Contemporary use of the term 'intension' derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intensional FOL (First-order-logic) for P2P systems by fusing the Bealer's intensional algebraic FOL with the S5 possible-world semantics of the Montague, we define the intensional equivalence relation for this logic and the weak deductive inference for it. The notion of ontology has become widespread in semantic Web. The meaning of concepts and views defined over some database ontology can be considered as intensional objects which have particular extension in some possible world: for instance in the actual world. Thus, non invasive mapping between completely independent peer databases in a P2P systems can be naturally specified by the set of couples of intensionally equivalent views, which have the same meaning (intension), over two different peers. Such a kind of mapping has very different semantics from the standard view-based mappings based on the material implication commonly used for Data Integration. We show how a P2P database system may be embedded into this intensional modal FOL, and how we are able to obtain a weak non-omniscient inference, which can be effectively implemented. For a query answering we consider non omniscient query agents and we define object-oriented class for them which implements as method the query rewriting algorithm. Finally...

## Data Cleaning and Query Answering with Matching Dependencies and Matching Functions

Bertossi, Leopoldo; Kolahi, Solmaz; Lakshmanan, Laks V. S.
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.66%
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the values of some other attributes are sufficiently similar. Assuming the existence of matching functions for making two attributes values equal, we formally introduce the process of cleaning an instance using matching dependencies, as a chase-like procedure. We show that matching functions naturally introduce a lattice structure on attribute domains, and a partial order of semantic domination between instances. Using the latter, we define the semantics of clean query answering in terms of certain/possible answers as the greatest lower bound/least upper bound of all possible answers obtained from the clean instances. We show that clean query answering is intractable in some cases. Then we study queries that behave monotonically wrt semantic domination order, and show that we can provide an under/over approximation for clean answers to monotone queries. Moreover, non-monotone positive queries can be relaxed into monotone queries.; Comment: 14 pages, double column

## Introducing Nominals to the Combined Query Answering Approaches for EL

Stefanoni, Giorgio; Motik, Boris; Horrocks, Ian
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.77%
So-called combined approaches answer a conjunctive query over a description logic ontology in three steps: first, they materialise certain consequences of the ontology and the data; second, they evaluate the query over the data; and third, they filter the result of the second phase to eliminate unsound answers. Such approaches were developed for various members of the DL-Lite and the EL families of languages, but none of them can handle ontologies containing nominals. In our work, we bridge this gap and present a combined query answering approach for ELHO---a logic that contains all features of the OWL 2 EL standard apart from transitive roles and complex role inclusions. This extension is nontrivial because nominals require equality reasoning, which introduces complexity into the first and the third step. Our empirical evaluation suggests that our technique is suitable for practical application, and so it provides a practical basis for conjunctive query answering in a large fragment of OWL 2 EL.; Comment: Extended version of a paper to appear on AAAI-13

## A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys

Koutris, Paraschos; Suciu, Dan
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.62%
We study the problem of consistent query answering under primary key violations. In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints, which we call repairs. For a boolean query Q, the problem CERTAINTY(Q) asks whether every such repair satisfies the query or not; the problem is known to be always in coNP for conjunctive queries. However, there are queries for which it can be solved in polynomial time. It has been conjectured that there exists a dichotomy on the complexity of CERTAINTY(Q) for conjunctive queries: it is either in PTIME or coNP-complete. In this paper, we prove that the conjecture is indeed true for the case of conjunctive queries without self-joins, where each atom has as a key either a single attribute (simple key) or all attributes of the atom.

## Efficient Query Answering over Conceptual Schemas of Relational Databases : Technical Report

Simkus, Mantas; Taroza, Evaldas; Lubyte, Lina; Trivellato, Daniel; Norkunaite, Zivile
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.86%
We develop a query answering system, where at the core of the work there is an idea of query answering by rewriting. For this purpose we extend the DL DL-Lite with the ability to support n-ary relations, obtaining the DL DLR-Lite, which is still polynomial in the size of the data. We devise a flexible way of mapping the conceptual level to the relational level, which provides the users an SQL-like query language over the conceptual schema. The rewriting technique adds value to conventional query answering techniques, allowing to formulate simpler queries, with the ability to infer additional information that was not stated explicitly in the user query. The formalization of the conceptual schema and the developed reasoning technique allow checking for consistency between the database and the conceptual schema, thus improving the trustiness of the information system.

## Finite Open-World Query Answering with Number Restrictions (Extended Version)

Amarilli, Antoine; Benedikt, Michael
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.8%
Open-world query answering is the problem of deciding, given a set of facts, conjunction of constraints, and query, whether the facts and constraints imply the query. This amounts to reasoning over all instances that include the facts and satisfy the constraints. We study finite open-world query answering (FQA), which assumes that the underlying world is finite and thus only considers the finite completions of the instance. The major known decidable cases of FQA derive from the following: the guarded fragment of first-order logic, which can express referential constraints (data in one place points to data in another) but cannot express number restrictions such as functional dependencies; and the guarded fragment with number restrictions but on a signature of arity only two. In this paper, we give the first decidability results for FQA that combine both referential constraints and number restrictions for arbitrary signatures: we show that, for unary inclusion dependencies and functional dependencies, the finiteness assumption of FQA can be lifted up to taking the finite implication closure of the dependencies. Our result relies on new techniques to construct finite universal models of such constraints, for any bound on the maximal query size.; Comment: 59 pages. To appear in LICS 2015. Extended version including proofs

## Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses

Rudolph, Sebastian; Thomazo, Michaël; Baget, Jean-François; Mugnier, Marie-Laure
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.66%
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We focus in this paper on the ontological query answering problem, which consists of querying data while taking ontological knowledge into account. More specifically, we establish complexities of the conjunctive query entailment problem for classes of existential rules (also called tuple-generating dependencies, Datalog+/- rules, or forall-exists-rules. Our contribution is twofold. First, we introduce the class of greedy bounded-treewidth sets (gbts) of rules, which covers guarded rules, and their most well-known generalizations. We provide a generic algorithm for query entailment under gbts, which is worst-case optimal for combined complexity with or without bounded predicate arity, as well as for data complexity and query complexity. Secondly, we classify several gbts classes, whose complexity was unknown, with respect to combined complexity (with both unbounded and bounded predicate arity) and data complexity to obtain a comprehensive picture of the complexity of existential rule fragments that are based on diverse guardedness notions. Upper bounds are provided by showing that the proposed algorithm is optimal for all of them.

## Conjunctive Query Answering for the Description Logic SHIQ

Glimm, Birte; Horrocks, Ian; Lutz, Carsten; Sattler, Ulrike
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.9%
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive query answering over DL knowledge bases is only poorly understood if transitive roles are admitted in the query. In this paper, we consider unions of conjunctive queries over knowledge bases formulated in the prominent DL SHIQ and allow transitive roles in both the query and the knowledge base. We show decidability of query answering in this setting and establish two tight complexity bounds: regarding combined complexity, we prove that there is a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query, which is optimal. Regarding data complexity, we prove containment in co-NP.

## Top-k Query Answering in Datalog+/- Ontologies under Subjective Reports (Technical Report)

Lukasiewicz, Thomas; Martinez, Maria Vanina; Molinaro, Cristian; Predoiu, Livia; Simari, Gerardo I.
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.83%
The use of preferences in query answering, both in traditional databases and in ontology-based data access, has recently received much attention, due to its many real-world applications. In this paper, we tackle the problem of top-k query answering in Datalog+/- ontologies subject to the querying user's preferences and a collection of (subjective) reports of other users. Here, each report consists of scores for a list of features, its author's preferences among the features, as well as other information. Theses pieces of information of every report are then combined, along with the querying user's preferences and his/her trust into each report, to rank the query results. We present two alternative such rankings, along with algorithms for top-k (atomic) query answering under these rankings. We also show that, under suitable assumptions, these algorithms run in polynomial time in the data complexity. We finally present more general reports, which are associated with sets of atoms rather than single atoms.; Comment: arXiv admin note: text overlap with arXiv:1106.3767 by other authors

## Query Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Decidable Finite Extension Classes (Post Print)

Joseph, Mathew; Kuper, Gabriel; Mossakowski, Till; Serafini, Luciano
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.86%

## Taming the Infinite Chase: Query Answering under Expressive Integrity Constraints

Cali, Andrea; Gottlob, Georg; Kifer, Michael
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.86%
The chase algorithm is a fundamental tool for query evaluation and query containment under constraints, where the constraints are (sub-classes of) tuple-generating dependencies (TGDs) and equality generating depencies (EGDs). So far, most of the research on this topic has focused on cases where the chase procedure terminates, with some notable exceptions. In this paper we take a general approach, and we propose large classes of TGDs under which the chase does not always terminate. Our languages, in particular, are inspired by guarded logic: we show that by enforcing syntactic properties on the form of the TGDs, we are able to ensure decidability of the problem of answering conjunctive queries despite the non-terminating chase. We provide tight complexity bounds for the problem of conjunctive query evaluation for several classes of TGDs. We then introduce EGDs, and provide a condition under which EGDs do not interact with TGDs, and therefore do not take part in query answering. We show applications of our classes of constraints to the problem of answering conjunctive queries under F-Logic Lite, a recently introduced ontology language, and under prominent tractable Description Logics languages. All the results in this paper immediately extend to the problem of conjunctive query containment.; Comment: Pre-print

## Query Answering under Matching Dependencies for Data Cleaning: Complexity and Algorithms

Gardezi, Jaffer; Bertossi, Leopoldo
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.62%
Matching dependencies (MDs) have been recently introduced as declarative rules for entity resolution (ER), i.e. for identifying and resolving duplicates in relational instance $D$. A set of MDs can be used as the basis for a possibly non-deterministic mechanism that computes a duplicate-free instance from $D$. The possible results of this process are the clean, "minimally resolved instances" (MRIs). There might be several MRIs for $D$, and the "resolved answers" to a query are those that are shared by all the MRIs. We investigate the problem of computing resolved answers. We look at various sets of MDs, developing syntactic criteria for determining (in)tractability of the resolved answer problem, including a dichotomy result. For some tractable classes of MDs and conjunctive queries, we present a query rewriting methodology that can be used to retrieve the resolved answers. We also investigate connections with "consistent query answering", deriving further tractability results for MD-based ER.; Comment: Conference submission, 2011

## Consistent Query Answering via ASP from Different Perspectives: Theory and Practice

Manna, Marco; Ricca, Francesco; Terracina, Giorgio
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.66%
A data integration system provides transparent access to different data sources by suitably combining their data, and providing the user with a unified view of them, called global schema. However, source data are generally not under the control of the data integration process, thus integrated data may violate global integrity constraints even in presence of locally-consistent data sources. In this scenario, it may be anyway interesting to retrieve as much consistent information as possible. The process of answering user queries under global constraint violations is called consistent query answering (CQA). Several notions of CQA have been proposed, e.g., depending on whether integrated information is assumed to be sound, complete, exact or a variant of them. This paper provides a contribution in this setting: it uniforms solutions coming from different perspectives under a common ASP-based core, and provides query-driven optimizations designed for isolating and eliminating inefficiencies of the general approach for computing consistent answers. Moreover, the paper introduces some new theoretical results enriching existing knowledge on decidability and complexity of the considered problems. The effectiveness of the approach is evidenced by experimental results. To appear in Theory and Practice of Logic Programming (TPLP).

## Consistent Query Answering under Spatial Semantic Constraints

Rodríguez, M. Andrea; Bertossi, Leopoldo; Caniupan, Monica
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
46.8%
Consistent query answering is an inconsistency tolerant approach to obtaining semantically correct answers from a database that may be inconsistent with respect to its integrity constraints. In this work we formalize the notion of consistent query answer for spatial databases and spatial semantic integrity constraints. In order to do this, we first characterize conflicting spatial data, and next, we define admissible instances that restore consistency while staying close to the original instance. In this way we obtain a repair semantics, which is used as an instrumental concept to define and possibly derive consistent query answers. We then concentrate on a class of spatial denial constraints and spatial queries for which there exists an efficient strategy to compute consistent query answers. This study applies inconsistency tolerance in spatial databases, rising research issues that shift the goal from the consistency of a spatial database to the consistency of query answering.; Comment: Journal submission, 2010

## Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies

Grau, Bernardo Cuenca; Horrocks, Ian; Krötzsch, Markus; Kupke, Clemens; Magka, Despoina; Motik, Boris; Wang, Zhe
Tipo: Artigo de Revista Científica