Efficiently Computing Inclusion Dependencies for Schema Discovery

@article{Bauckmann2006EfficientlyCI,
  title={Efficiently Computing Inclusion Dependencies for Schema Discovery},
  author={Jana Bauckmann and Ulf Leser and Felix Naumann},
  journal={22nd International Conference on Data Engineering Workshops (ICDEW'06)},
  year={2006},
  pages={2-2}
}
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. In this paper we present efficient algorithms for finding unary… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Discovery of Data Dependencies in Relational Databases

Siegfried Bell, Peter Brockhausen Informatik
1995
View 4 Excerpts
Highly Influenced

Schema matching using duplicates

21st International Conference on Data Engineering (ICDE'05) • 2005
View 1 Excerpt

The Universal Protein Resource (UniProt)

Nucleic Acids Research • 2005
View 1 Excerpt

Performanzvergleich von Genexpressionsdatenbanken

G. Muhammad
Master’s thesis, Humboldt-Universität zu Berlin, • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…