The Community for Technology Leaders
2007 IEEE 23rd International Conference on Data Engineering (2007)
Istanbul, Turkey
Apr. 15, 2007 to Apr. 20, 2007
ISBN: 1-4244-0802-4
pp: 1448-1450
Jana Bauckmann , Department for Computer Science, Humboldt-Universit?t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany, bauckmann@informatik.hu-berlin.de
Ulf Leser , Department for Computer Science, Humboldt-Universit?t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany, leser@informatik.hu-berlin.de
Felix Naumann , Hasso-Plattner-Institut, University of Potsdam, Prof.-Dr.-Helmert-Str. 2-3, 14482 Potsdam, Germany, naumann@hpi.uni-potsdam.de
Veronique Tietz , Department for Computer Science, Humboldt-Universit?t zu Berlin, Unter den Linden 6, 10099 Berlin, Germany, vtietz@informatik.hu-berlin.de
ABSTRACT
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and for database integration. We present our algorithm Spider (Single Pass Inclusion DEpendency Recognition) for detecting inclusion dependencies, as these are the automatically testable part of a foreign key constraint. For IND detection all pairs of attributes must be tested. Spider solves this task very efficiently by testing all attribute pairs in parallel. It analyzes a 2 GB database in 20 min and a 21 GB database in 4 h.
INDEX TERMS
null
CITATION

U. Leser, F. Naumann, V. Tietz and J. Bauckmann, "Efficiently Detecting Inclusion Dependencies," 2007 IEEE 23rd International Conference on Data Engineering(ICDE), Istanbul, Turkey, 2007, pp. 1448-1450.
doi:10.1109/ICDE.2007.369032
92 ms
(Ver 3.3 (11022016))