Abstract
In this paper, we introduce and study schema mapping coverage for relational databases. Given a relational schema mapping in the presence of both source dependencies and target dependencies, the coverage problem is to decide and describe which source instances have solutions under the mapping. Our main motivation is to describe limitations of schema mappings and hence to effectively determine if the mappings can fulfill their user expectations for the given tasks. We first propose using database dependencies to model user expectations of schema mappings. Then we formally define the notion of schema mapping coverage and propose using a set of dependencies in the source schema language to represent coverage. We look into how target dependencies indirectly enforce dependencies via mapping specifications on source instances and thus determine which source instances have solutions. We prove that the problem of computing schema mapping coverage is undecidable in general. We present algorithms for computing coverage for schema mappings where both the source dependencies and the target dependencies consist of functional dependencies and acyclic inclusion dependencies. Schema mapping coverage describes the ability to map source instances to target instances for mappings, it provides a way to describe limitations of schema mappings, which can be especially useful for mapping design and evolution.
Similar content being viewed by others
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: the Logical Level. Addison-Wesley Longman Publishing Co. Inc., Upper Saddle River (1995)
Arenas, M., Barceló, P., Libkin, L., Murlak, F.: Foundations of Data Exchange. Cambridge University Press, Cambridge (2014)
Arenas, M., Pérez, J., Reutter, J. L., Riveros, C.: Foundations of schema mapping management. In: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp 227–238. ACM (2010)
Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M. Y.: Simplifying schema mappings. In: Proceedings of the 14th International Conference on Database Theory, pp 114–125. ACM (2011)
Cosmadakis, S. S., Kanellakis, P. C.: Equational theories and database constraints. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp 273–284. ACM (1985)
Doan, A., Halevy, A., Ives, Z.: Principles of Data Integration. Elsevier, Amsterdam (2012)
Fagin, R.: Inverting schema mappings. ACM Transactions on Database Systems (TODS) 32(4), 25 (2007)
Fagin, R., Kolaitis, P. G., Miller, R. J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)
Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. -C.: Composing schema mappings: second-order dependencies to the rescue. ACM Transactions on Database Systems (TODS) 30(4), 994–1055 (2005)
Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. -C.: Quasi-inverses of schema mappings. ACM Transactions on Database Systems (TODS) 33(2), 11 (2008)
Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. -C.: Reverse data exchange: coping with nulls. ACM Transactions on Database Systems (TODS) 36 (2), 11 (2011)
Homer, S., Selman, A. L.: Computability and complexity theory. Springer Science & Business Media, Berlin (2011)
Kolaitis, P. G.: Schema mappings, data exchange, and metadata management. In: Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 61–75 (2005)
Lenzerini, M.: Data integration: a theoretical perspective. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp 233–246. ACM (2002)
Miller, R. J., Ioannidis, Y. E., Ramakrishnan, R.: The use of information capacity in schema integration and translation. In: VLDB, vol. 93, pp 120–133 (1993)
Miller, R. J., Ioannidis, Y. E., Ramakrishnan, R.: Schema equivalence in heterogeneous systems: bridging theory and practice. In: International Conference on Extending Database Technology, pp 73–80. Springer (1994)
Onet, A.: The chase procedure and its applications in data exchange. In: Dagstuhl Follow-Ups, volume 5. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)
Sallinger, E.: Reasoning about schema mappings. In: Dagstuhl Follow-Ups, volume 5. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)
Acknowledgments
This research was partially supported by NSF grants IIS-1524469 and BCS-1360763.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Deng, N., Chomicki, J. Schema mapping coverage. Ann Math Artif Intell 89, 511–549 (2021). https://doi.org/10.1007/s10472-020-09720-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-020-09720-4