Abstract
Recently families of sets of dependencies treated as the Datalog extensions were discovered for which the interpretation of queries becomes tractable. Such families are intended for inference of new, unknown values in the process of query answering. This paper considers such decidable classes of dependencies as the assets for creation of new data models (called in the paper the value inventive data models) analogously to axiomatic extension of the canonical model kernel used so far for unification of structured and object data models aimed at heterogeneous database integration. The paper examines the decidable classes of dependencies reflecting the semantics of value inventive data models considering such classes to be the extensions of the canonical data model kernel. The issue of identifying of decidable subsets of the canonical model extension is considered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abrial, J.-R.: The B-Book. Cambridge University Press (1996)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
Baget, J.-F., Leclere, M., Mugnier, M.-L.: Walking the Decidability Line for Rules with Existential Variables. In: Proceedings of the 12th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2010 (2010)
Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. JACM 31(4), 718–741 (1984)
Cali, A., Martinenghi, D.: Querying Incomplete Data over Extended ER Schemata. Theory and Practice of Logic Programming (Logic Programming in Databases: from Datalog to Semantic-Web Rules), vol. 10(3), pp. 291–329. Cambridge University Press (2010)
Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logic. In: Proc. of KR 2006, pp. 260–270 (2006)
Calì, A., Gottlob, G., Lukasiewicz, T.: A General Datalog-Based Framework for Tractable Query Answering over Ontologies. In: PODS 2009, June 29-July 2 (2009)
Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog±: A Family of Logical Knowledge Representation and Query Languages for New Applications. In: 25th Annual IEEE Symposium on Logic in Computer Science, pp. 228–242 (2010)
Calì, A., Gottlob, G., Pieris, A.: Query Answering under Non-guarded Rules in Datalog + / −. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1–17. Springer, Heidelberg (2010)
Calì, A., Gottlob, G., Pieris, A.: Tractable Query Answering over Conceptual Schemata. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds.) ER 2009. LNCS, vol. 5829, pp. 175–190. Springer, Heidelberg (2009)
Calì, A., Gottlob, G., Pieris, A.: New Expressive Languages for Ontological Query Answering. In: Proc. of the Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)
Calì, A., Gottlob, G., Pieris, A.: Ontological query answering under expressive Entity Relationship schemata. Information Systems 37, 320–335 (2012)
ten Cate, B., Kolaitis, P.G.: Structural Characterizations of Schema-Mapping Languages. In: CACM, vol. 53(1) (2010)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science 336, 89–124 (2005)
Gottlob, G., Orsi, G., Pieris, A.: Ontological Query Answering via Rewriting. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 1–18. Springer, Heidelberg (2011)
Gottlob, G., Orsi, G., Pieris, A.: Ontological Queries Rewriting and Optimization. In: ICDE 2011 (2011)
Hull, R., Yoshikawa, M.: ILOG: Declarative Creation and Manipulation of Object Identifiers. In: VLDB, pp. 455–468 (1990)
Kalinichenko, L.A., Briukhov, D.O., Martynov, D.O., Skvortsov, N.A., Stupnikov, S.: Mediation framework for enterprise information system infrastructures. In: 9th International Conference on Enterprise Information Systems (ICEIS) (2007)
Kalinichenko, L.A.: Methods and Tools for Integration of Heterogeneous Databases, 423 p. Science Publ., Moscow (1983) (in Russian)
Kalinichenko, L.A.: Methods and Tools for Equivalent Data Model Mapping Construction. In: Bancilhon, F., Tsichritzis, D., Thanos, C. (eds.) EDBT 1990. LNCS, vol. 416, pp. 92–119. Springer, Heidelberg (1990)
Kalinichenko, L.A.: SYNTHESIS: the language for description, design and programming of the heterogeneous interoperable information resource environment. Institute of Informatics Problems. Russian Academy of Sciences, Moscow (1993)
Kalinichenko, L.A.: Method for Data Models Integration in the Common Paradigm. In: Proceedings of the First East-European Conference, ADBIS 1997, St. Petersburg (1997)
Kalinichenko, L.A., Stupnikov, S.A.: OWL as Yet Another Data Model to be Integrated. In: Proc. ADBIS 2011, pp. 178–189. Austrian Computer Society, Vienna (2011)
Kalinichenko, L.A., Stupnikov, S.A., Zemtsov, N.: Extensible Canonical Process Model Synthesis Applying Formal Interpretation. In: Eder, J., Haav, H.-M., Kalja, A., Penjam, J. (eds.) ADBIS 2005. LNCS, vol. 3631, pp. 183–198. Springer, Heidelberg (2005)
Lenzerini, M.: Data Integration: a Theoretical Perspective. In: PODS, pp. 233–246 (2002)
Mugnier, M.-L.: Ontological Query Answering with Existential Rules. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 2–23. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalinichenko, L., Stupnikov, S. (2012). Synthesis of the Canonical Models for Database Integration Preserving Semantics of the Value Inventive Data Models. In: Morzy, T., Härder, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2012. Lecture Notes in Computer Science, vol 7503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33074-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-33074-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33073-5
Online ISBN: 978-3-642-33074-2
eBook Packages: Computer ScienceComputer Science (R0)