Abstract
Discovering data dependencies consists in producing the whole set of a given class of data dependencies holding in a database, the task of selecting the interesting ones being usually left to an expert user. In this paper we take another look at the problems of discovering inclusion and functional dependencies in relational databases. We define rigourously the so-called logical navigation from a workload of SQL statements. This assumption leads us to devise tractable algorithms for discovering “interesting” inclusion and functional dependencies.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bell, S., Brockhausen, P.: Discovery of Data Dependencies in Relational Databases. Technical report, LS-8 Report 14, University of Dortmund, 18p (April 1995)
Chaudhuri, S., Narasayya, V.: Autoadmin ”what-if” Index Analysis Utility. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, June 1998, pp. 367–378 (1998)
Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. In: Proceedings of the 14 th IEEE International Conference on Data Engineering, Orlando, USA (1998)
Kantola, M., Mannila, H., Räihä, K.-J., Siirtola, H.: Discovering Functional and Inclusion Dependencies in Relational Databases. International Journal of Intelligent Systems 7(1), 591–607 (1992)
Kivinen, J., Mannila, H.: Approximate Inference of Functional Dependencies from Relations. Theoretical Computer Science 149(1), 129–149 (1995)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In: Proceedings of the 3rd International Conference on Information and Knowledge Management, December 1994, pp. 401–407 (1994)
Maier, D., Ullman, J.D., Vardi, M.Y.: On the Foundations of the Universal Relation Model. ACM Transaction on Database Systems 9(2), 283–308 (1984)
Mannila, H., Toivonen, H.: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)
Mannila, H., Räihä, K.-J.: The Design of Relational Databases, 2nd edn. Addison-Wesley, Reading (1994)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information System 24(1), 25–46 (1999)
Petit, J.-M., Toumani, F.: Discovery of inclusion and approximate dependencies in databases. In: To appear in BDA 1999 (french conference on DB), October 1999, p. 20 (1999)
Petit, J.-M., Toumani, F., Boulicaut, J.-F., Kouloumdjian, J.: Towards the Reverse Engineering of Denormalized Relational Databases. In: Su, S. (ed.) Proceedings of the 12th IEEE International Conference on Data Engineering, pp. 218–227. IEEE Computer Society, New Orleans (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopes, S., Petit, JM., Toumani, F. (1999). Discovery of “Interesting” Data Dependencies from a Workload of SQL Statements. In: Żytkow, J.M., Rauch, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science(), vol 1704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48247-5_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-48247-5_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66490-1
Online ISBN: 978-3-540-48247-5
eBook Packages: Springer Book Archive