Holistic Data Profiling: Simultaneous Discovery of Various Metadata
暂无分享,去创建一个
[1] Paul Brown,et al. CORDS: automatic discovery of correlations and soft functional dependencies , 2004, SIGMOD '04.
[2] A. Asuncion,et al. UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences , 2007 .
[3] Philip A. Bernstein,et al. Computational problems related to the design of normal form relational schemas , 1979, TODS.
[4] Tim J. P. Hubbard,et al. Data growth and its impact on the SCOP database: new developments , 2007, Nucleic Acids Res..
[5] Felix Naumann,et al. Advancing the discovery of unique column combinations , 2011, CIKM '11.
[6] E. F. Codd,et al. Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.
[7] Hannu Toivonen,et al. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies , 1999, Comput. J..
[8] Hossein Saiedian,et al. An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema , 1996, Comput. J..
[9] C. M. WyssMay. Finding Minimal Keys in a Relation Instance , 1999 .
[10] Rosine Cicchetti,et al. FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies , 2001, ICDT.
[11] Felix Naumann,et al. Scalable Discovery of Unique Column Combinations , 2013, Proc. VLDB Endow..
[12] Felix Naumann,et al. Efficiently Computing Inclusion Dependencies for Schema Discovery , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).
[13] Felix Naumann,et al. Data profiling revisited , 2014, SGMD.
[14] Paul Brown,et al. GORDIAN: efficient and scalable discovery of composite keys , 2006, VLDB.
[15] Jean-Marc Petit,et al. Efficient Algorithms for Mining Inclusion Dependencies , 2002, EDBT.