DFD: Efficient functional dependency discovery

CIKM 2014 - Proceedings of the 2014 ACM International Conference on Information and Knowledge Management

Volumn , Issue , 2014, Pages 949-958

  Abedjan, Ziawasch ^a   Schulze, Patrick ^a   Naumann, Felix ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

Algorithms; Functional dependency; Lattice traversal

Indexed keywords

ALGORITHMS; ANOMALY DETECTION; KNOWLEDGE MANAGEMENT;

DATA CLEANSING; DEPTH FIRST; FUNCTIONAL DEPENDENCY; LARGE DATASETS; LATTICE TRAVERSAL; RESULT VERIFICATIONS; THREE ORDERS OF MAGNITUDE;

LARGE DATASET;

EID: 84926357673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2661829.2661884     Document Type: Conference Paper

References (19)

1. Z. Abedjan and F. Naumann. Advancing the discovery of unique column combinations. In CIKM, pages 1565-1570, 2011.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.
3. P. Bohannon, W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for data cleaning. In ICDE, pages 746-755, 2007.
4. X. Chu, I. F. Ilyas, and P. Papotti. Discovering denial constraints. PVLDB, 6(13):1498-1509, Aug. 2013.
5. X. Chu, I. F. Ilyas, and P. Papotti. Holistic data cleaning: Putting violations into context. In ICDE, pages 458-469, 2013.
6. W. Fan, F. Geerts, J. Li, and M. Xiong. Discovering conditional functional dependencies. TKDE, 23(5):683-698, 2011.
7. W. Fan, J. Li, S. Ma, N. Tang, and W. Yu. Interaction between record matching and data repairing. In SIGMOD, pages 469-480, 2011.
8. P. A. Flach and I. Savnik. Database dependency discovery: A machine learning approach. Journal of AI Com., 12(3):139-160, 1999.
9. L. Golab, H. Karloff, F. Korn, and D. Srivastava. Data Auditor: Exploring data quality and semantics using pattern tableaux. PVLDB, 3(1-2):1641-1644, 2010.
10. A. Heise, J.-A. Quiané-Ruiz, Z. Abedjan, A. Jentzsch, and F. Naumann. Scalable discovery of unique column combinations. PVLDB, 7(4):301-312, 2013.
11. Y. Huhtala, J. Kärkkäinen, P. Porkka, and H. Toivonen. TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
12. I. F. Ilyas, V. Markl, P. J. Haas, P. Brown, and A. Aboulnaga. CORDS: Automatic discovery of correlations and soft functional dependencies. In SIGMOD, pages 647-658, 2004.
13. S. Lopes, J.-M. Petit, and L. Lakhal. Efficient discovery of functional dependencies and armstrong relations. In EDBT, volume 1777, pages 350-364, 2000.
14. H. Mannila and K.-J. Räihä. On the complexity of inferring functional dependencies. Discrete Applied Mathematics, 40(2):237-243, 1992.
15. F. Naumann. Data profiling revisited. SIGMOD Rec., 42(4):40-49, 2014.
16. N. Novelli and R. Cicchetti. FUN: An efficient algorithm for mining functional and embedded dependencies. In ICDT, volume 1973, pages 189-203, 2001.
17. Y. Sismanis, P. Brown, P. J. Haas, and B. Reinwald. GORDIAN: Efficient and scalable discovery of composite keys. In VLDB, pages 691-702, 2006.
18. C. Wyss, C. Giannella, and E. Robertson. FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. In DaWaK, 2001, pages 101-110, 2001.
19. H. Yao, H. J. Hamilton, and C. J. Butz. FD Mine: Discovering functional dependencies in a database using equivalences. In ICDM, pages 729-732, 2002.