Name
Abstract | ||
|---|---|---|
Schema mappings enable declarative and executable specification of transformations between different schematic representations of application concepts. Most work on mapping generation has assumed that the source and target schemas are well defined, e.g., with declared keys and foreign keys, and that the mapping generation processes exist to support the data engineer in the labour-intensive process of producing a high-quality integration. However, organizations increasingly have access to numerous independently produced data sets, e.g., in a data lake, with a requirement to produce rapid, best-effort integrations, without extensive manual effort. This paper introduces Dynamap, a mapping generation algorithm for such settings, where metadata about sources and the relationships between them is derived from automated data profiling, and where there may be many alternative ways of combining source tables. Our contributions include a dynamic programming algorithm for exploring the space of potential mappings, and techniques for propagating profiling data through mappings, so that the fitness of candidate mappings can be estimated. Experimental results show the effectiveness and scalability of the approach in a variety of synthetic and real-world scenarios.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3335783.3335785 | Proceedings of the 31st International Conference on Scientific and Statistical Database Management |
Field | DocType | ISSN |
Data mining,Information retrieval,Computer science,Schema mapping | Conference | 978-1-4503-6216-0 |
ISBN | Citations | PageRank |
978-1-4503-6216-0 | 2 | 0.38 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lacramioara Mazilu | 1 | 4 | 2.78 |
| N. W. Paton | 2 | 152 | 41.45 |
| Alvaro A. A. Fernandes | 3 | 904 | 77.71 |
| Martin Koehler | 4 | 56 | 8.05 |