Efficient core computation in data exchange

DOI10.1145/1346330.1346334zbMath1326.68124OpenAlexW2012791990WikidataQ59259622 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

complexitycoredata integrationconstraintsquery evaluationtractabilityconjunctive queriesdependenciesdata exchangeuniversal solutionsChase

Mathematics Subject Classification ID

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

Related Items

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