Efficient core computation in data exchange

DOI10.1145/1346330.1346334zbMATH Open1326.68124DBLPjournals/jacm/GottlobN08OpenAlexW2012791990WikidataQ59259622 ScholiaQ59259622MaRDI QIDQ3546361

Alan Nash, Georg Gottlob

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1346330.1346334

zbMATH Keywords

data integrationcomplexityconstraintscoreconjunctive queriestractabilitydependenciesquery evaluationdata exchangeuniversal solutionsChase

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15)

Cited In (11)

• On the data complexity of consistent query answering
• Characterisations of multivalued dependency implication over undetermined universes
• Towards practical feasibility of core computation in data exchange
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
• Towards more expressive ontology languages: the query answering problem
• Querying incomplete data over extended ER schemata
• Data exchange: getting to the core
• A Fuzzy Extension of Data Exchange
• Solutions and query rewriting in data exchange
• Fuzzy data exchange
• Towards Practical Feasibility of Core Computation in Data Exchange

This page was built for publication: Efficient core computation in data exchange

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