FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies.

@inproceedings{DBLP:conf/icdt/NovelliC01,
  author    = {Noel Novelli and
               Rosine Cicchetti},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {FUN: An Efficient Algorithm for Mining Functional and Embedded
               Dependencies},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {189-203},
  ee        = {db/conf/icdt/NovelliC01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730189.htm},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, A. Inkeri Verkamo: Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining 1996: 307-328 BibTeX

[2]

Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499 BibTeX

[3]

William Ward Armstrong: Dependency Structures of Data Base Relationships. IFIP Congress 1974: 580-583 BibTeX

[4]

William Ward Armstrong, Claude Delobel: Decomposition and Functional Dependencies in Relations. ACM Trans. Database Syst. 5(4): 404-430(1980) BibTeX

[5]

Catriel Beeri, Philip A. Bernstein: Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Trans. Database Syst. 4(1): 30-59(1979) BibTeX

[6]

Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman: On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46(1984) BibTeX

[7]

...

[8]

Dina Bitton, Jeffrey Millman, Solveig Torgersen: A Feasibility and Performance Study of Dependency Inference. ICDE 1989: 635-641 BibTeX

[9]

Surajit Chaudhuri: Data Mining and Database Systems: Where is the Intersection? IEEE Data Eng. Bull. 21(1): 4-8(1998) BibTeX

[10]

Roger H. L. Chiang, Terence M. Barron, Veda C. Storey: Reverse Engineering of Relational Databases: Extraction of an EER Model from a Relational Database. Data Knowl. Eng. 12(2): 107-142(1994) BibTeX

[11]

E. F. Codd: Further Normalization of the Data Base Relational Model. IBM Research Report, San Jose, California RJ909: (1971) BibTeX

[12]

Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233(1986) BibTeX

[13]

...

[14]

...

[15]

Georg Gottlob: Computing Covers for Embedded Functional Dependencies. PODS 1987: 58-69 BibTeX

[16]

...

[17]

Jarek Gryz: Query Folding with Inclusion Dependencies. ICDE 1998: 126-133 BibTeX

[18]

Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401 BibTeX

[19]

Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J. 42(2): 100-111(1999) BibTeX

[20]

...

[21]

Jyrki Kivinen, Heikki Mannila: Approximate Inference of Functional Dependencies from Relations. Theor. Comput. Sci. 149(1): 129-149(1995) BibTeX

[22]

Mark Levene: A Lattice View of Functional Dependencies in Incomplete Relations. Acta Cybern. 12(2): 181-208(1995) BibTeX

[23]

Mark Levene, George Loizou: Axiomatisation of Functional Dependencies in Incomplete Relations. Theor. Comput. Sci. 206(1-2): 283-300(1998) BibTeX

[24]

Mark Levene, George Loizou: Database Design for Incomplete Relations. ACM Trans. Database Syst. 24(1): 80-125(1999) BibTeX

[25]

...

[26]

Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal: Efficient Discovery of Functional Dependencies and Armstrong Relations. EDBT 2000: 350-364 BibTeX

[27]

Heikki Mannila, Kari-Jouko Räihä: Design by Example: An Application of Armstrong Relations. J. Comput. Syst. Sci. 33(2): 126-141(1986) BibTeX

[28]

...

[29]

Heikki Mannila, Kari-Jouko Räihä: Algorithms for Inferring Functional Dependencies from Relations. Data Knowl. Eng. 12(1): 83-99(1994) BibTeX

[30]

Heikki Mannila, Kari-Jouko Räihä: Design of Relational Databases. Addison-Wesley 1992, ISBN 0-201-56523-4
BibTeX

[31]

Heikki Mannila, Hannu Toivonen: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Min. Knowl. Discov. 1(3): 241-258(1997) BibTeX

[32]

Victor M. Markowitz, Johann A. Makowsky: Identifying Extended Entity-Relationship Object Structures in Relational Schemas. IEEE Trans. Software Eng. 16(8): 777-790(1990) BibTeX

[33]

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416 BibTeX

[34]

Jean-Marc Petit, Farouk Toumani, Jean-François Boulicaut, Jacques Kouloumdjian: Towards the Reverse Engineering of Denormalized Relational Databases. ICDE 1996: 218-227 BibTeX

[35]

Xiaolei Qian: Query Folding. ICDE 1996: 48-55 BibTeX

[36]

...

[37]

Antonio M. Silva, Michel A. Melkanoff: A Method for Helping Discover the Dependencies of a Relation. Advances in Data Base Theory 1979: 115-133 BibTeX

[38]

Nicolas Spyratos: The Partition Model: A Deductive Database Model. ACM Trans. Database Syst. 12(1): 1-37(1987) BibTeX

[39]

Zahir Tari, John Stokes, Stefano Spaccapietra: Object Normal Forms and Dependency Constraints for Object-Oriented Schemata. ACM Trans. Database Syst. 22(4): 513-569(1997) BibTeX