The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) (2006)
Atlanta, Georgia
Apr. 3, 2006 to Apr. 7, 2006
ISBN: 0-7695-2571-7
pp: 2
Felix Naumann , Humboldt-Universitat zu Berlin, Germany
Jana Bauckmann , Humboldt-Universitat zu Berlin, Germany
Ulf Leser , Humboldt-Universitat zu Berlin, Germany
Large data integration projects must often cope with undocumented data sources. Schema discovery aims at automatically finding structures in such cases. An important class of relationships between attributes that can be detected automatically are inclusion dependencies (IND), which provide an excellent basis for guessing foreign key constraints. INDs can be discovered by comparing the sets of distinct values of pairs of attributes. <p>In this paper we present efficient algorithms for finding unary INDs. We first show that (and why) SQL is not suitable for this task. We then develop two algorithms that compute inclusion dependencies outside of the database. Both are much faster than the SQL-based methods; in fact, for larger schemas they are the only feasible solution. Our experiments show that we can compute all unary INDs in a schema of 1, 680 attributes with a total database size of 3.2 GB in approximately 2.5 hours.</p>
Felix Naumann, Jana Bauckmann, Ulf Leser, "Efficiently Computing Inclusion Dependencies for Schema Discovery", 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), vol. 00, no. , pp. 2, 2006, doi:10.1109/ICDEW.2006.54
100 ms
(Ver 3.3 (11022016))