Dependency Inference.

Heikki Mannila, Kari-Jouko Räihä: Dependency Inference. VLDB 1987: 155-158
  author    = {Heikki Mannila and
               Kari-Jouko R{\"a}ih{\"a}},
  editor    = {Peter M. Stocker and
               William Kent and
               Peter Hammersley},
  title     = {Dependency Inference},
  booktitle = {VLDB'87, Proceedings of 13th International Conference on Very
               Large Data Bases, September 1-4, 1987, Brighton, England},
  publisher = {Morgan Kaufmann},
  year      = {1987},
  isbn      = {0-934613-46-X},
  pages     = {155-158},
  ee        = {db/conf/vldb/MannilaR87.html},
  crossref  = {DBLP:conf/vldb/87},
  bibsource = {DBLP,}


The problem of generating a cover for the set of functional dependencies that hold in a given relation is studied. The problem is an instance of the general problem of concept learning. It has applications e.g. in relational database design and in query optimization. A straightforward solution algorithm is shown to require exponential time for all inputs. We show that for some relations this time requirement is unavoidable, i.e., there are small relations where an exponential number of nontrivial dependencies hold. However, such relations are rare in practice. An algorithm is then developed that works efficiently with respect to the size of its input and its output.

Copyright © 1987 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Peter M. Stocker, William Kent, Peter Hammersley (Eds.): VLDB'87, Proceedings of 13th International Conference on Very Large Data Bases, September 1-4, 1987, Brighton, England. Morgan Kaufmann 1987, ISBN 0-934613-46-X
Contents BibTeX


William Ward Armstrong: Dependency Structures of Data Base Relationships. IFIP Congress 1974: 580-583 BibTeX
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
Alexander Borgida, Keith E. Williamson: Accommodating Exceptions in Databases, and Refining the Schema by Learning from them. VLDB 1985: 72-81 BibTeX
Mokrane Bouzeghoub, Georges Gardarin, Elisabeth Métais: Database Design Tools: An Expert System Approach. VLDB 1985: 82-95 BibTeX
Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou: Inclusion Dependencies and Their Interaction with Functional Dependencies. J. Comput. Syst. Sci. 28(1): 29-59(1984) BibTeX
Rina Dechter: Decomposing an N-ary Relation into a Tree of Binary Relations. PODS 1987: 185-189 BibTeX
James P. Delgrande: Formal Limits on the Automatic Generation and Maintenance of Integrity Constraints. PODS 1987: 190-196 BibTeX
Heikki Mannila, Kari-Jouko Räihä: Design by Example: An Application of Armstrong Relations. J. Comput. Syst. Sci. 33(2): 126-141(1986) BibTeX
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

Referenced by

  1. Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401
  2. Jiawei Han, Yongjian Fu: Discovery of Multiple-Level Association Rules from Large Databases. VLDB 1995: 420-431
  3. Jiawei Han: Mining Knowledge at Multiple Concept Levels. CIKM 1995: 19-24
  4. Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499
  5. Christopher J. Matheus, Philip K. Chan, Gregory Piatetsky-Shapiro: Systems for Knowledge Discovery in Databases. IEEE Trans. Knowl. Data Eng. 5(6): 903-913(1993)
  6. Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216
  7. Ke Wang, Marc H. Graham: Constant-Time Maintainability: A Generalization of Independence. ACM Trans. Database Syst. 17(2): 201-246(1992)
  8. Jyrki Kivinen, Heikki Mannila: Approximate Dependency Inference from Relations. ICDT 1992: 86-98
  9. Paul De Bra, Jan Paredaens: Removing Redundancy and Updating Databases. ICDT 1990: 245-256
  10. Dina Bitton, Jeffrey Millman, Solveig Torgersen: A Feasibility and Performance Study of Dependency Inference. ICDE 1989: 635-641
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings: Copyright © by VLDB Endowment,
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:45:34 2009