Data exchange: semantics and query answering

DOI10.1016/J.TCS.2004.10.033zbMATH Open1080.68019OpenAlexW2102729564WikidataQ60431740 ScholiaQ60431740MaRDI QIDQ555772FDOQ555772

Authors: Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa 

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.033

Recommendations

• scientific article; zbMATH DE number 1953133
• Solutions and query rewriting in data exchange
• Data exchange: getting to the core
• XML data exchange
• Data exchange beyond complete data

zbMATH Keywords

Certain answersChaseComputational complexityData exchangeData integrationDependenciesFirst-order inexpressibilityQuery answeringUniversal solution

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cites Work

• Title not available (Why is that?)
• The complexity of satisfiability problems
• Inclusion dependencies and their interaction with functional dependencies
• Horn clauses and database dependencies
• Title not available (Why is that?)
• The complexity of querying indefinite data about linearly ordered domains
• The core of a graph
• On monadic NP vs monadic co-NP
• A Proof Procedure for Data Dependencies
• Answering queries using views: A survey
• Recursive query plans for data integration
• Title not available (Why is that?)
• On the foundations of the universal relation model
• Why Horn formulas matter in computer science: initial structures and generic examples
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONVERT

Cited In (only showing first 100 items - show all)

• A Single Approach to Decide Chase Termination on Linear Existential Rules
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards knowledge exchange: state-of-the-art and open problems
• On the data complexity of consistent query answering
• Magic Sets and their application to data integration
• Mimicking behaviors in separated domains
• Characterisations of multivalued dependency implication over undetermined universes
• Towards practical feasibility of core computation in data exchange
• A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
• Querying incomplete information in RDF with SPARQL
• Disjunctive logic programs with existential quantification in rule heads
• Information-based distance measures and the canonical reflection of view updates
• Information-Optimal Reflections of View Updates on Relational Database Schemata
• A fuzzy extension of data exchange
• Tractable XML data exchange via relations
• First-order query rewriting for inconsistent databases
• Inseparability and conservative extensions of description logic ontologies: a survey
• Query optimization in information integration
• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• Data exchange beyond complete data
• Knowledge base exchange: the case of OWL 2 QL
• Combining decidability paradigms for existential rules
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Data exchange and schema mappings in open and closed worlds
• SOME MODEL THEORY OF GUARDED NEGATION
• On rules with existential variables: walking the decidability line
• Semi-oblivious chase termination: the sticky case
• Limits of schema mappings
• Reasoning about integrity constraints for tree-structured data
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
• Schema mapping coverage
• Querying regular graph patterns
• Logical foundations of information disclosure in ontology-based data integration
• Universal solutions for temporal data exchange
• Query languages for data exchange: beyond unions of conjunctive queries
• A more general theory of static approximations for conjunctive queries
• Logic and data exchange: which solutions are ``good solutions?
• Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
• Relaxed notions of schema mapping equivalence revisited
• Towards more expressive ontology languages: the query answering problem
• XML data exchange
• Terminating evaluation of logic programs with finite three-valued models
• Combining Consistency and Confidentiality Requirements in First-Order Databases
• On the data complexity of consistent query answering over graph databases
• Efficient core computation in data exchange
• Data exchange: getting to the core
• Data Privacy for $\mathcal{ALC}$ Knowledge Bases
• Reasoning about functional and full hierarchical dependencies over partial relations
• Semantic acyclicity for conjunctive queries: approximations and constraints
• Query answering over inconsistent knowledge bases: a probabilistic approach
• Preference-based inconsistency-tolerant query answering under existential rules
• Probabilistic data exchange
• Inconsistency-tolerant query answering for existential rules
• Solutions and query rewriting in data exchange
• On simplification of schema mappings
• Solutions in XML data exchange
• Semantic query optimization in the presence of types
• The language of plain SO-tgds: composition, inversion and structural properties
• Fuzzy data exchange
• Reasoning on property graphs with graph generating dependencies
• Preserving constraints with the stable chase
• Feferman-vaught decompositions for prefix classes of first order logic
• Datalog: Bag Semantics via Set Semantics
• Foundations of ontology-based data access under bag semantics
• A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
• Title not available (Why is that?)
• Controlled query evaluation in description logics through consistent query answering
• On the k-Boundedness for Existential Rules
• Restricted Chase Termination: A Hierarchical Approach and Experimentation
• Update translation in instance mapped heterogeneous peer databases
• Reasoning with ontologies
• Exact learning of lightweight description logic ontologies
• Early detection of temporal constraint violations
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• Game-based notions of locality over finite models
• Temporal Minimal-World Query Answering over Sparse ABoxes
• Restricted chase termination for existential rules: a hierarchical approach and experimentation
• Characterizing boundedness in chase variants
• Answer Counting under Guarded TGDs
• Algebraic data integration
• Schema mappings: a case of logical dynamics in database theory
• The Semantics of Consistency and Trust in Peer Data Exchange Systems
• The notion of abstraction in ontology-based data management
• Craig interpolation with clausal first-order tableaux
• Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
• Answering non-monotonic queries in relational data exchange
• MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
• The impact of active domain predicates on guarded existential rules
• Title not available (Why is that?)
• XML schema mappings, data exchange and metadata management
• A logic framework for P2P deductive databases
• Reasoning on anonymity in Datalog
• Uniform Restricted Chase Termination
• Bounds in ontology-based data access via circuit complexity
• Querying incomplete data over extended ER schemata
• Polynomial combined first-order rewritings for linear and guarded existential rules
• Datalog and Its Extensions for Semantic Web Databases
• On the interaction of existential rules and equality constraints in ontology querying

This page was built for publication: Data exchange: semantics and query answering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555772)