Abstract
This chapter introduces procedures to test strict satisfiability and decide logical implication for a family of database schemas called extralite schemas with role hierarchies. Using the OWL jargon, extralite schemas support named classes, datatype and object properties, minCardinalities and maxCardinalities, InverseFunctionalProperties, class subset constraints, and class disjointness constraints. Extralite schemas with role hierarchies also support subset and disjointness constraints defined for datatype and object properties. Strict satisfiability imposes the additional restriction that the constraints of a schema must not force classes, datatypes, or object properties to be always empty, and is therefore more adequate than the traditional notion of satisfiability in the context of database design. The decision procedures outlined in the chapter are based on the satisfiability algorithm for Boolean formulas in conjunctive normal form with at most two literals per clause, and explore the structure of a set of constraints, captured as a constraint graph. The chapter includes a proof that the procedures work in polynomial time and are consistent and complete for a subfamily of the schemas that impose a restriction on the role hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)
Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
Baader, F., Nutt, W.: Basic description logics. In: Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.) The Description Logic Handbook, pp. 43–95. Cambridge University Press, New York (2003)
Borgida, A., Brachman, R.J.: Conceptual modeling with description logics. In: Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.) The Description Logic Handbook, pp. 349–372. Cambridge University Press, New York (2003)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rosati, R., Ruzzi, M.: Data integration through DL-Lite-A ontologies. In: Proceedings of the Third International Workshop on Semantics in Data and Knowledge Bases (SDKB 2008), pp. 26–47 (2008)
Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39, 385–429 (2007)
Casanova, M.A., Furtado, A.L., Macedo, J.A., Vidal, V.M.: Extralite schemas with role hierarchies. Tech. rep. MCC09/10, Department of Informatics, PUC-Rio (2010)
Casanova, M.A., Lauschner, T., Leme, L.A.P.P., Breitman, K.K., Furtado, A.L., Vidal, V.M.: Revising the constraints of lightweight mediated schemas. Data Knowl. Eng. 69(12), 1274–1301 (2010). Special issue on 28th International Conference on Conceptual Modeling (ER 2009)
Hartmann, S., Link, S., Trinh, T.: Constraint acquisition for entity-relationship models. Data Knowl. Eng. 68, 1128–1155 (2009)
Lauschner, T., Casanova, M.A., Vidal, V.M.P., de Macêdo, J.A.F.: Efficient decision procedures for query containment and related problems. In: Brayner, A. (ed.) XXIV Simpósio Brasileiro de Banco de Dados, 05–09 de Outubro, Fortaleza, Ceará, Brasil, Anais, pp. 1–15 (2009)
Rosati, R.: Finite model reasoning in DL-Lite. In: Proceedings of the 5th European Semantic Web Conference on the Semantic Web: Research and Applications, ESWC’08, pp. 215–229. Springer, Berlin (2008)
Acknowledgements
This work was partly supported by CNPq, under grants 473110/2008-3 and 557128/2009-9, by FAPERJ under grant E-26/170028/2008, and by CAPES under grant NF 21/2009.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Casanova, M.A., Breitman, K.K., Furtado, A.L., Vidal, V.M.P., de Macêdo, J.A.F. (2012). On the Problem of Matching Database Schemas. In: Hinchey, M., Coyle, L. (eds) Conquering Complexity. Springer, London. https://doi.org/10.1007/978-1-4471-2297-5_17
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2297-5_17
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2296-8
Online ISBN: 978-1-4471-2297-5
eBook Packages: Computer ScienceComputer Science (R0)