Data exchange: semantics and query answering
DOI10.1016/J.TCS.2004.10.033zbMATH Open1080.68019OpenAlexW2102729564WikidataQ60431740 ScholiaQ60431740MaRDI QIDQ555772
Renée J. Miller, Lucian Popa, Phokion G. Kolaitis, Ronald Fagin
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
Certain answersChaseComputational complexityData exchangeData integrationDependenciesFirst-order inexpressibilityQuery answeringUniversal solution
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of satisfiability problems
- Inclusion dependencies and their interaction with functional dependencies
- Horn clauses and database dependencies
- 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
- On the foundations of the universal relation model
- Why Horn formulas matter in computer science: initial structures and generic examples
- CONVERT
Cited In (95)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards knowledge exchange: state-of-the-art and open problems
- Foundations of ontology-based data access under bag semantics
- On the data complexity of consistent query answering
- Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints
- 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
- Tractable XML data exchange via relations
- First-order query rewriting for inconsistent databases
- Query optimization in information integration
- 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
- Game-based notions of locality over finite models
- 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
- Algebraic data integration
- Schema mapping coverage
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
- 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
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Relaxed notions of schema mapping equivalence revisited
- Towards more expressive ontology languages: the query answering problem
- Bounds in ontology-based data access via circuit complexity
- Combining Consistency and Confidentiality Requirements in First-Order Databases
- On the data complexity of consistent query answering over graph databases
- Data exchange: getting to the core
- Querying Regular Graph Patterns
- Data Privacy for $\mathcal{ALC}$ Knowledge Bases
- Reasoning about functional and full hierarchical dependencies over partial relations
- A Fuzzy Extension of Data Exchange
- Query answering over inconsistent knowledge bases: a probabilistic approach
- Preference-based inconsistency-tolerant query answering under existential rules
- Inconsistency-tolerant query answering for existential rules
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
- 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
- Title not available (Why is that?)
- Feferman-vaught decompositions for prefix classes of first order logic
- Characterizing Boundedness in Chase Variants
- Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
- Datalog: Bag Semantics via Set Semantics
- XML Schema Mappings
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying
- The Impact of Active Domain Predicates on Guarded Existential Rules
- Schema Mappings: A Case of Logical Dynamics in Database Theory
- 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
- Preserving Constraints with the Stable Chase
- Reasoning with ontologies
- A Logic Framework for P2P Deductive Databases
- Early detection of temporal constraint violations
- Temporal Minimal-World Query Answering over Sparse ABoxes
- Answer Counting under Guarded TGDs
- 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
- MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data
- UPDATE TRANSLATION IN INSTANCE MAPPED HETEROGENEOUS PEER DATABASES
- Title not available (Why is that?)
- Reasoning on anonymity in Datalog
- Uniform Restricted Chase Termination
- 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
- Explanation-friendly query answering under uncertainty
- Finite model reasoning over existential rules
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)