DFU.Vol5.10452.97.pdf
- Filesize: 0.57 MB
- 31 pages
Document
Reasoning about Schema Mappings
Author
-
Part of:
Volume:
Data Exchange, Integration, and Streams (DFU - Vol. 5)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-10-18
Cite AsGet BibTex
Emanuel Sallinger. Reasoning about Schema Mappings. In Data Exchange, Integration, and Streams. Dagstuhl Follow-Ups, Volume 5, pp. 97-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DFU.Vol5.10452.97
https://doi.org/10.4230/DFU.Vol5.10452.97
Abstract
Schema mappings are an important tool in several areas of database research. Recently, the topic of reasoning about schema mappings was given attention, in particular revolving around the central concepts of equivalence and optimality. In this chapter, we survey these results. First, we introduce relaxed notions of logical equivalence and show their potential for finding optimized schema mappings. We then look at applications of these concepts to optimization, normalization, and schema mapping management, as well as the boundaries of computability. We conclude by giving a glimpse at reasoning about schema mappings in a broader sense by looking at how to debug schema mappings.
Keywords
- data exchange
- data integration
- schema mappings
- equivalence
- optimality
- normalization
- schema mapping management
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads