research-article

Computing universal models under guarded TGDs

Author:

André HernichAuthors Info & Claims

ICDT '12: Proceedings of the 15th International Conference on Database Theory

Pages 222 - 235

https://doi.org/10.1145/2274576.2274600

Published: 26 March 2012 Publication History

Abstract

A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and complete information. Universal models have a number of applications including answering conjunctive queries, and deciding containment of conjunctive queries, with respect to databases with integrity constraints. Furthermore, they are used in slightly modified form as solutions in data exchange. In general, it is undecidable whether a database possesses a universal model, but in the past few years researchers identified various settings where this problem is decidable, and even efficiently solvable.

This paper focuses on computing universal models under finite sets of guarded TGDs, non-conflicting keys, and negative constraints. Such constraints generalize inclusion dependencies, and were recently shown to be expressive enough to capture certain members of the DL-Lite family of description logics. The main result is an algorithm that, given a database without null values and a finite set Σ of such constraints, decides whether there is a universal model, and if so, outputs such a model. If Σ is fixed, the algorithm runs in polynomial time. The algorithm can be extended to cope with databases containing nulls; however, in this case, polynomial running time can be guaranteed only for databases with bounded block size.

References

[1]

A. V. Aho, C. Beeri, and J. D. Ullman. The theory of joins in relational databases. ACM Trans. Database Syst., 4(3):297--314, 1979.

Digital Library

[2]

H. Andréka, I. Németi, and J. van Benthem. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27:217--274, 1998.

[3]

V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 1--10, 2010.

Digital Library

[4]

C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718--741, 1984.

Digital Library

[5]

A. Calì, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data integration under integrity constraints. Information Systems, 29(2):147--163, 2004.

Digital Library

[6]

A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 70--80, 2008.

[7]

A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proceedings of the 28th ACM Symposium on Principles of Database Systems (PODS), pages 77--86, 2009.

Digital Library

[8]

A. Calì, G. Gottlob, and A. Pieris. Advanced processing for ontological queries. PVLDB, 3(1):554--565, 2010.

Digital Library

[9]

A. Calì, G. Gottlob, and A. Pieris. Query rewriting under non-guarded rules. In Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW), 2010.

[10]

A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proceedings of the 22th ACM Symposium on Principles of Database Systems (PODS), pages 260--271, 2003.

Digital Library

[11]

A. Calì, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pages 16--21, 2003.

Digital Library

[12]

D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning, 39(3):385--429, 2007.

Digital Library

[13]

A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th ACM Symposium on Theory of Computing (STOC), pages 77--90, 1977.

Digital Library

[14]

S. S. Cosmadakis and P. C. Kanellakis. Functional and inclusion dependencies: A graph theoretic approach. Advances in Computing Research, 3:163--184, 1986.

[15]

A. Deutsch, A. Nash, and J. Remmel. The chase revisited. In Proceedings of the 27th ACM Symposium on Principles of Database Systems (PODS), pages 149--158, 2008.

Digital Library

[16]

H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1999.

[17]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005.

Digital Library

[18]

R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: Getting to the core. ACM Trans. Database Syst., 30(1):174--210, 2005.

Digital Library

[19]

F. Geerts and B. Marnette. Static analysis of schema-mappings ensuring oblivious termination. In Proceedings of the 13th International Conference on Database Theory (ICDT), pages 183--195, 2010.

Digital Library

[20]

G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579--627, 2002.

Digital Library

[21]

G. Gottlob and A. Nash. Efficient core computation in data exchange. J. ACM, 55(2):Article 9, 2008.

Digital Library

[22]

S. Greco and F. Spezzano. Chase termination: A constraints rewriting approach. PVLDB, 3(1):93--104, 2010.

Digital Library

[23]

M. Grohe. Logic, graphs, and algorithms. In J. Flum, E. Grädel, and T. Wilke, editors, Logic and Automata: History and Perspectives {in Honor of Wolfgang Thomas}, volume 2 of Texts in Logic and Games, pages 357--422. Amsterdam University Press, 2008.

[24]

M. Gyssens. Database dependencies. In Encyclopedia of Database Systems, pages 704--708. Springer, 2009.

[25]

P. Hell and J. Nešetřil. The core of a graph. Discrete Mathematics, 109(1-3):117--126, 1992.

Digital Library

[26]

A. Hernich. Foundations of Query Answering in Relational Data Exchange. PhD thesis, Goethe-Universität Frankfurt am Main, 2010. Published at Logos Verlag Berlin, ISBN 978-3-8325-2735-8, 2010.

[27]

A. Hernich, L. Libkin, and N. Schweikardt. Closed world data exchange. ACM Trans. Database Syst., 36(2):Article 14, 2011.

Digital Library

[28]

D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. In Proceedings of the 1st ACM Symposium on Principles of Database Systems, pages 164--169, 1982.

Digital Library

[29]

G. Lausen, M. Meier, and M. Schmidt. On chase termination beyond stratification. PVLDB, 2(1):970--981, 2009.

Digital Library

[30]

G. Lausen, M. Meier, and M. Schmidt. On chase termination beyond stratification. CoRR, abs/0906.4228, 2009.

Digital Library

[31]

M. Lenzerini. Data integration: A theoretical perspective. In Proceedings of the 21th ACM Symposium on Principles of Database Systems (PODS), pages 229--240, 2002.

Digital Library

[32]

L. Libkin. Elements of Finite Model Theory. Springer, 2004.

Digital Library

[33]

D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455--469, 1979.

Digital Library

[34]

J. A. Makowsky. Algorithmic uses of the Feferman-Vaught Theorem. Annals of Pure and Applied Logic, 126(1-3):159--213, 2004.

[35]

B. Marnette. Generalized schema mappings: From termination to tractability. In Proceedings of the 28th ACM Symposium on Principles of Database Systems (PODS), pages 13--22, 2009.

Digital Library

[36]

R. Rosati. On the decidability and finite controllability of query processing in databases with incomplete information. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), pages 356--365, 2006.

Digital Library

[37]

R. Rosati. Finite model reasoning in DL-Lite. In Proceedings of the 5th European Semantic Web Conference (ESWC), pages 215--229, 2008.

Digital Library

Cited By

Gottlob GHernich AKupke CLukasiewicz T(2021)Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and ComplexityJournal of the ACM10.1145/344750868:5(1-87)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3447508
Arenas MBotoeva ECalvanese DRyzhikov V(2016)Knowledge base exchangeArtificial Intelligence10.1016/j.artint.2016.05.002238:C(11-62)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.artint.2016.05.002
Arenas MDiéguez GPérez J(2015)Bidirectional constraints for exchanging dataProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832626(2698-2705)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832626

Index Terms

Computing universal models under guarded TGDs
1. Information systems
  1. Data management systems
2. Theory of computation
  1. Randomness, geometry and discrete structures
  2. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Data exchange: getting to the core
Special Issue: SIGMOD/PODS 2003

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. Given a source instance, there may be many solutions to the data exchange ...
Data exchange: computing cores in polynomial time
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, namely, computing the core of a universal solution to a data exchange ...
Efficient core computation in data exchange

Data exchange deals with inserting data from one database into another database having a different schema. Fagin et al. [2005] have shown that among the universal solutions of a solvable data exchange problem, there exists—up to isomorphism—a unique ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '12: Proceedings of the 15th International Conference on Database Theory

March 2012

329 pages

ISBN:9781450307918

DOI:10.1145/2274576

General Chair:
Alin Deutsch
University of California, San Diego

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICDT '12

ICDT '12: 15th International Conference on Database Theory

March 26 - 29, 2012

Berlin, Germany

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
143
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gottlob GHernich AKupke CLukasiewicz T(2021)Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and ComplexityJournal of the ACM10.1145/344750868:5(1-87)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3447508
Arenas MBotoeva ECalvanese DRyzhikov V(2016)Knowledge base exchangeArtificial Intelligence10.1016/j.artint.2016.05.002238:C(11-62)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.artint.2016.05.002
Arenas MDiéguez GPérez J(2015)Bidirectional constraints for exchanging dataProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832626(2698-2705)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832626

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents