Discovery of “interesting” data dependencies from a workload of SQL statements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1704, Issue , 1999, Pages 430-435

  Lopes, S ^a   Petit, J M ^a   Toumani, F ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATA DEPENDENCIES; EXPERT USERS; FUNCTIONAL DEPENDENCY; RELATIONAL DATABASE; SQL STATEMENTS; TRACTABLE ALGORITHMS;

DATA MINING;

EID: 84956858187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48247-5_54     Document Type: Conference Paper

References (12)

1. S. Bell and P. Brockhausen. Discovery of Data Dependencies in Relational Databases. Technical report, LS-8 Report 14, University of Dortmund, 18p, April 1995.
2. S. Chaudhuri and V. Narasayya. Autoadmin ”what-if” Index Analysis Utility. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 367–378, Seattle, June 1998.
3. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. Efficient Discovery of Functional and Approximate Dependencies Using Partitions. In Proceedings of the 14th IEEE International Conference on Data Engineering, Orlando, USA, 1998.
4. M. Kantola, H. Mannila, K-J. Räihä, and H. Siirtola. Discovering Functional and Inclusion Dependencies in Relational Databases. International Journal of Intelligent Systems, 7(1):591–607, 1992.
5. J. Kivinen and H. Mannila. Approximate Inference of Functional Dependencies from Relations. Theoretical Computer Science, 149(1):129–149, 1995.
6. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A.I. Verkamo. Finding Interesting Rules from Large Sets of Discovered Association Rules. In Proceedings of the 3td International Conference on Information and Knowledge Management, pages 401–407, December 1994.
7. D. Maier, J.D. Ullman, and M. Y. Vardi. On the Foundations of the Universal Relation Model. ACM Transaction on Database Systems, 9(2):283–308, June 1984.
8. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(3):241–258, 1997.
9. Heikki Mannila and Kari-Jouko Räihä. The Design of Relational Databases. Addison-Wesley, second edition, 1994.
10. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information System, 24(1):25–46, 1999.
11. J-M. Petit and F. Toumani. Discovery of inclusion and approximate dependencies in databases. In To appear in BDA99 (french conference on DB), 20 pages, October 1999.
12. J-M. Petit, F. Toumani, J-F. Boulicaut, and J. Kouloumdjian. Towards the Reverse Engineering of Denormalized Relational Databases. In S. Su, editor, Proceedings of the 12th IEEE International Conference on Data Engineering, pages 218–227. IEEE Computer Society, New Orleans, February 1996.