FUN: An effcient algorithm for mining functional and embedded dependencies

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

Volumn 1973, Issue , 2001, Pages 189-203

  Novelli, Nöel ^a   Cicchetti, Rosine ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES;

ATTRIBUTE SETS; DATABASE DESIGN; EMBEDDED DEPENDENCIES; FORMAL FRAMEWORK; FUNCTIONAL DEPENDENCY; LEVEL-WISE ALGORITHMS; MATERIALIZED VIEW; OPERATIONAL SOLUTIONS;

DATA MINING;

EID: 84949476870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44503-x_13     Document Type: Conference Paper

References (39)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining, pages 307-328, 1996.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. VLDB'94, pages 487-499, Santiago, Chile, September 1994.
3. W.W. Armstrong. Dependency Structures of Database Relationships. In Proc. IFIP Conf., pages 580-583, Amsterdam, The Netherlands, 1974. North-Holland.
4. W.W. Armstrong and C. Delobel. Decompositions and Functional Dependencies in Relations. ACM TODS, 5(4):404-430, Dec 1980.
5. C. Beeri and P.A. Bernstein. Computational Problems Related to the Design of Normal Form Relational Schemas. ACM TODS, 4(1):30-59, 1979.
6. C. Beeri, M. Dowd, R. Fagin, and R. Statman. On the Structure of Armstrong Relations for Functional Dependencies. Journal of the ACM, 31(1):30-46, 1984.
7. G. Birkhoff. Lattices Theory. Coll. Pub. XXV, vol. 25, 3rd edition, 1967.
8. D. Bitton, J. Millman, and S. Torgersen. A Feasability and Performance Study of Dependency Inference. In Proc. ICDE'89, pages 635-641, 1989.
9. S. Chaudhuri. Data Mining and Database Systems: Where is the Intersection? Data Engineering Bulletin, 21(1):4-8, 1998.
10. R.H.L. Chiang, T.M. Barron, and V.C. Storey. Reverse Engineering of Relational Databases: Extraction of an EER Model from a Relational Database. DKE, 10(12):107-142, 1994.
11. E.F. Codd. Further Normalization of the Data Base Model. Technical Report 909, IBM, 1971.
12. S.S. Cosmadakis, P.C. Kanellakis, and N. Spyratos. Partition Semantics for Relations. Journal of Computer and System Sciences, 33(2):203-233, 1986.
13. P.C. Fisher, J.H. Hou, and D.M. Tsou. Succinctness in Dependency Systems. TCS, 24:323-329, 1983.
14. FUN. URL. http://www.lim.univ-mrs.fr/_novelli/datamining/fun, 2000.
15. G. Gottlob. Computing Covers for Embedded Functional Dependencies. In Proc. ACM-SIGACT-SIGMOD-SIGART'87, pages 58-69, San Diego, US, 1987.
16. G. Gottlob and L. Libkin. Investigations on Armstrong Relations, Dependency Inference, and Excluded Functional Dependencies. Acta Cybernetica, 9(4):385-402, 1990.
17. J. Gryz. Query Folding with Inclusion Dependencies. In Proc. ICDE'98, pages 126-133, Orlando, US, Feb 1998.
18. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. Effcient Discovery of Functional and Appproximate Dependencies. In Proc. ICDE'98, pages 392-401, Orlando, US, Feb 1998.
19. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. TANE: An Effcient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal, 42(2):100-111, 1999.
20. M. Kantola, H. Mannila, K.R. Räihä, and H. Siirtola. Discovering Functional and Inclusion Dependencies in Relational Databases. International Journal of Intelligent Systems, 7:591-607, 1992.
21. J. Kivinen and H. Mannila. Approximate Dependency Inference from Relations. TCS, 149(1):129-149, 1995.
22. M. Levene. A Lattice View of Functional Dependencies in Incomplete Relations. Acta Cyberbernetica, 12:181-207, 1995.
23. M. Levene and G. Loizou. Axiomatisation of Functional Dependencies in Incomplete Relations. TCS, 206(1-2):283-300, 1998.
24. M. Levene and G. Loizou. Database Design for Incomplete Relations. ACM TODS, 24(1):80-125, 1999.
25. M. Levene and G. Loizou. A Guided Tour of Relational Databases and Beyond. Springer-Verlag, London, 1999.
26. S. Lopes, J.M. Petit, and L. Lakhal. Effcient Discovery of Functional Dependencies and Armstrong Relations. In Proc. EDBT'00, pages 350-364, 2000.
27. H. Mannila and K.J. Räihä. Design by Example: An Application of Armstrong Relations. Journal of Computer and System Sciences, 33(2):126-141, Oct 1986.
28. H. Mannila and K.J. Räihä. On the Complexity of Inferring Functional Dependencies. Discrete Applied Mathematics, 40:237-243, 1992.
29. H. Mannila and K.J. Räihä. Algorithms for Inferring Functional Dependencies from Relations. DKE, 12(1):83-99, 1994.
30. H. Mannila and K.J. Räihä. The Design of Relational Databases. Addison Wesley, 1994.
31. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
32. V.M. Markowitz and J.A. Makowsky. Identifying Extended Entity-Relationship Object Structure in Relational Schemas. IEEE Transactions on Software Engineering, 16(8):777-790, August 1990.
33. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering Frequent Closed Itemsets for Association Rules. In Proc. ICDT'99, LNCS, Vol. 1540, Springer Verlag, pages 398-416, Jan 1999.
34. J.M. Petit, F. Toumani, J.F. Boulicaut, and J. Kouloumdjian. Towards the Reverse Engineering of Denormalized Relational Databases. In Proc. ICDE'96, pages 218-227, Feb 1996.
35. X. Qian. Query Folding. In Proc. ICDE'96, pages 48-55, Feb 1996.
36. I. Savnik and P.A. Flach. Bottom-up Induction of Functional Dependencies from Relations. In Proc. AAAI'93, pages 174-185, 1993.
37. A.M. Silva and M.A. Melkanoff. A Method for Helping Discover the Dependencies of a Relation, pages 115-133. Plenum. Advances in Data Base Theory, 1981.
38. N. Spyratos. The Partition Model: a Deductive Database Model. ACM TODS, 12(1):1-37, 1987.
39. Z. Tari, J. Stokes, and S. Spaccapietra. Object Normal Forms and Dependency Constraints for Object-Oriented Schemata. ACM TODS, 22(4):513-569, Dec 1997.