Efficient Discovery of Functional Dependencies and Armstrong Relations.

@inproceedings{DBLP:conf/edbt/LopesPL00,
  author    = {St{\'e}phane Lopes and
               Jean-Marc Petit and
               Lotfi Lakhal},
  editor    = {Carlo Zaniolo and
               Peter C. Lockemann and
               Marc H. Scholl and
               Torsten Grust},
  title     = {Efficient Discovery of Functional Dependencies and Armstrong
               Relations},
  booktitle = {Advances in Database Technology - EDBT 2000, 7th International
               Conference on Extending Database Technology, Konstanz, Germany,
               March 27-31, 2000, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1777},
  year      = {2000},
  isbn      = {3-540-67227-3},
  pages     = {350-364},
  ee        = {db/conf/edbt/LopesPL00.html, http://link.springer.de/link/service/series/0558/bibs/1777/17770350.htm},
  crossref  = {DBLP:conf/edbt/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

...

[2]

...

[3]

Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX

[4]

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

[5]

Roberto J. Bayardo Jr., Rakesh Agrawal: Mining the Most Interesting Rules. KDD 1999: 145-154 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]

Catriel Beeri, Michael Kifer: An Integrated Approach to Logical Design of Relational Database Schemes. ACM Trans. Database Syst. 11(2): 134-158(1986) BibTeX

[8]

...

[9]

Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman: The Asilomar Report on Database Research. SIGMOD Record 27(4): 74-80(1998) BibTeX

[10]

Surajit Chaudhuri, Vivek R. Narasayya: AutoAdmin 'What-if' Index Analysis Utility. SIGMOD Conference 1998: 367-378 BibTeX

[11]

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

[12]

Ethan Collopy, Mark Levene: Evolving Example Relations to Satisfy Functional Dependencies. IADT 1998: 440-447 BibTeX

[13]

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

[14]

...

[15]

...

[16]

Ronald Fagin: Horn clauses and database dependencies. J. ACM 29(4): 952-985(1982) BibTeX

[17]

...

[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]

...

[20]

Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen, A. Inkeri Verkamo: Finding Interesting Rules from Large Sets of Discovered Association Rules. CIKM 1994: 401-407 BibTeX

[21]

...

[22]

...

[23]

Stéphane Lopes, Jean-Marc Petit, Farouk Toumani: Discovery of "Interesting" Data Dependencies from a Workload of SQL Statements. PKDD 1999: 430-435 BibTeX

[24]

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

[25]

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

[26]

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

[27]

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

[28]

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

[29]

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

[30]

Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal: Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307 BibTeX

[31]

...

[32]

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

Referenced by

1. Noel Novelli, Rosine Cicchetti: FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies. ICDT 2001: 189-203