Advancing the discovery of unique column combinations

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 1565-1570

  Abedjan, Ziawasch ^a   Naumann, Felix ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

apriori; functional dependency; key discovery; unique

Indexed keywords

APRIORI; APRIORI ALGORITHMS; BRUTE FORCE; CANDIDATE GENERATION; COLUMN COMBINATIONS; DISCOVERY ALGORITHM; FUNCTIONAL DEPENDENCY; FUNDAMENTAL RESEARCH; HYBRID SOLUTION; KEY DISCOVERY; KNOWLEDGE-DISCOVERY APPLICATION; MEMORY LOAD; PRUNING METHODS; RELATIONAL DATABASE; SMALL DATA SET; UNIQUE;

KNOWLEDGE MANAGEMENT;

ALGORITHMS;

EID: 83055161636     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063801     Document Type: Conference Paper

References (9)

1. Z. Abedjan and F. Naumann. Advancing the discovery of unique column combinations. Technical Report 51, Hasso-Plattner-Institute Potsdam, Germany, 2011.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 487-499, San Francisco, CA, 1994.
3. P. A. Flach and I. Savnik. Database dependency discovery: a machine learning approach. AI Commun., 12:139-160, August 1999. (Pubitemid 30506806)
4. C. Giannella and C. Wyss. Finding minimal keys in a relation instance. http://citeseerx.ist.psu.edu/viewdoc/ summary?doi=10.1.1.41.7086, 1999. Last accessed on 2010-09-29.
5. Y. Huhtala, J. Kaerkkaeinen, P. Porkka, and H. Toivonen. TANE: an efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
6. M. Kantola, H. Mannila, K.-J. Räihä, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 12:591U{combining double acute accent}-607, 1992.
7. V. Matos and B. Grasser. SQL-based discovery of exact and approximate functional dependencies. SIGCSE Bull., 36(4):58-63, 2004. (Pubitemid 43773363)
8. H. Saiedian and T. Spencer. An efficient algorithm to compute the candidate keys of a relational database schema. The Computer Journal, 39(2):124-132, 1996.
9. Y. Sismanis, P. Brown, P. J. Haas, and B. Reinwald. Gordian: efficient and scalable discovery of composite keys. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 691-702, 2006.