199
Views
33
CrossRef citations to date
0
Altmetric
Section B

Closure via functional dependence simplification

, , , &
Pages 510-526 | Received 28 Sep 2010, Accepted 18 Nov 2011, Published online: 06 Jan 2012

References

  • Adler , I. Tree-width and functional dependencies in databases . Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems . Vancouver , Canada. pp. 311 – 320 . New York , , NY, USA PODS ’08, ACM
  • Aguilera , G. , Cordero , P. , Enciso , M. , Mora , A. and Pérez de Guzmán , I. 2004 . “ A Non-Explosive Treatment of Functional Dependencies Using Rewriting Logic ” . In Lecture Notes in Artificial Intelligence , Vol. 3171 , 31 – 40 . Berlin, Heidelberg : Springer-Verlag .
  • Arenas , M. and Libkin , L. 2005 . An information-theoretic approach to normal forms for relational and XML data . J. ACM , 52 ( 2 ) : 246 – 283 .
  • W.W. Armstrong, Dependency structures of data base relationships, Proceedings of IFIP Congress, North-Holland, Amsterdam, 1974, pp. 580–583.
  • Atzeni , P. and Antonellis , V. D. 1993 . Relational Database Theory , Menlo Park , , CA : Benjamin/Cummings .
  • Beeri , C. and Bernstein , P. A. 1979 . Computational problems related to the design of normal form relational schemas . ACM Trans. Database Syst , 4 ( 1 ) : 30 – 59 .
  • Bellatrece , L. , Ait-Ameur , Y. and Chakroun , C. 2010 . A design methodology of ontology based database applications . Log. J. IGPL , 19 ( 5 ) : 648 – 665 .
  • Belohlávek , R. and Vychodil , V. 2006 . “ Formal Concept Analysis With Constraints by Closure Operators ” . In Lecture Notes in Computer Science , Vol. 4068 , 131 – 143 . Berlin, Heidelberg : Springer-Verlag .
  • Belohlávek , R. and Vychodil , V. 2008 . Basic algorithm for attribute implications and functional dependencies in graded setting . Internat. J. Found. Comput. Sci , 19 ( 2 ) : 297 – 317 .
  • Buneman , P. , Fan , W. , Siméé , J. and Weinstein , S. 2001 . Constraints for semistructured data and XML . SIGMOD Rec. (ACM Special Interest Group on Management of Data) , 30 ( 1 ) : 47 – 54 .
  • Cabrera , I. P. , Cordero , P. , Gutiérrez , G. , Martínez , J. and Ojeda-Aciego , M. 2009 . Fuzzy congruence relations on nd-groupoids . Int. J. Comput. Math , 86 : 1684 – 1695 .
  • Cadoli , M. and Mancini , T. 2004 . “ Exploiting Functional Dependencies in Declarative Problem Specifications ” . In Lecture Notes in Computer Science , Vol. 3229 , 628 – 640 . Berlin, Heidelberg : Springer-Verlag .
  • Caspard , N. and Monjardet , B. 2003 . The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey . Discrete Appl. Math , 127 ( 2 ) : 241 – 269 .
  • Choobineh , J. and Venkatraman , S. S. 1992 . A methodology and tool for derivation of functional dependencies from business forms . Inf. Syst , 17 ( 3 ) : 269 – 282 .
  • Clavel , M. , Durán , F. , Eker , S. , Lincoln , P. , Martí-Oliet , N. , Meseguer , J. and Talcott , C. L. 2007 . All About Maude – A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , Berlin : Springer .
  • Codd , E. F. 1990 . The Relational Model for Database Management: Version 2 , Reading , MA : Addison-Wesley .
  • Colomb , R. M. 1999 . Representation of propositional expert systems as partial functions . Artif. Intell , 109 : 187 – 209 .
  • Cordero , P. , Enciso , M. , Pérez de Guzmán , I. and Mora , A. 2002 . SLFD Logic: Elimination of Data Redundancy in Knowledge Representation , Vol. 2527 , 141 – 150 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Artificial Intelligence
  • Cordero , P. , Mora , A. , Pérez de Guzmán , I. and Enciso , M. 2008 . Non-deterministic ideal operators: An adequate tool for formalization in data bases . Discrete Appl. Math , 156 ( 6 ) : 911 – 923 .
  • Cordero , P. , Enciso , M. , Mora , A. and Pérez de Guzmán , I. A Complete Logic for Fuzzy Functional Dependencies Over Domains With Similarity Relations . IWANN ’09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence . pp. 261 – 269 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science, Vol. 5517, J. Cabestany, F. Sandoval, A. Prieto, and J.M. Corchado, eds.
  • Demetrovics , J. and Vu , D. T. 1996 . Some results about normal forms for functional dependency in the relational datamodel . Discrete Appl. Math , 69 : 61 – 74 .
  • Demetrovics , J. , Molnár , A. and Thalheim , B. 2009 . Reasoning methods for designing and surveying relationships described by sets of functional constraints . Serdica J. Comput , 3 ( 2 ) : 179 – 204 .
  • Diederich , J. and Milton , J. 1988 . New methods and fast algorithms for database normalization . ACM Trans. Database Syst , 13 ( 3 ) : 339 – 365 .
  • Duck , G. J. , Peyton-Jones , S. , Stuckey , P. J. and Sulzmann , M. 2004 . Sound and Decidable Type Inference for Functional Dependencies , Vol. 2986 , 49 – 63 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Fagin , R. 1977 . Functional dependencies in a relational database and propositional logic . IBM J. Res. Dev , 21 ( 6 ) : 534 – 544 .
  • Fan , W. and Libkin , L. 2002 . On XML integrity constraints in the presence of DTDs . J. ACM , 49 ( 3 ) : 368 – 406 .
  • Fan , W. , Ma , S. , Hu , Y. , Liu , J. and Wu , Y. 2008 . Propagating functional dependencies with conditions . Proc. VLDB , 1 ( 1 ) : 391 – 407 .
  • Goguen , J. A. 2005 . Data, schema, ontology and logic integration . Log. J. IGPL , 13 ( 6 ) : 685 – 715 .
  • Greiner , R. 1996 . Finding optimal derivation strategies in redundant knowledge bases . Artif. Intell , 84 : 177 – 204 .
  • Guan , J. W. and Bell , D. A. 1998 . Rough computational methods for information systems . Artif. Intell , 105 ( 1–2 ) : 77 – 103 .
  • Hartmann , S. , Link , S. and Trinh , T. 2007 . Efficient Reasoning About XFDs with Pre-image Semantics Vol. 4443 , 1070 – 1074 . Lecture Notes in Computer Science
  • Hartmann , S. , Link , S. and Trinh , T. 2010 . Solving the Implication Problem for XML Functional Dependencies with Properties , Vol. 6188 , 161 – 175 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Hermann , M. and Sertkaya , B. 2008 . On the Complexity of Computing Generators of Closed Sets , Vol. 4933 , 158 – 168 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Ibaraki , T. , Kogan , A. and Makino , K. 1999 . Functional dependencies in Horn theories . Artif. Intell , 108 ( 1–2 ) : 1 – 30 .
  • Ibaraki , T. , Kogan , A. and Makino , K. 2003 . Inferring minimal functional dependencies in Horn and q-Horn theories . Ann. Math. Artif. Intell , 38 : 233 – 255 .
  • Jenkings , L. , Khincha , H. P. , Shivakumart , S. and Dash , P. K. 1992 . An application of functional dependencies to the topological analysis of protection schemes . Trans. Power Deliv , 7 ( 1 ) : 77 – 83 .
  • Jones , M. P. 2000 . Type Classes with Functional Dependencies , Vol. 1782 , 230 – 244 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Krídlo , O. and Ojeda-Aciego , M. 2011 . On L-fuzzy Chu correspondences . Int. J. Comput. Math , 88 : 1808 – 1818 .
  • Lee , M. L. , Ling , T. W. and Low , W. L. 2002 . Designing Functional Dependencies for XML , Vol. 2287 , 124 – 141 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Lopes , S. , Petit , J. M. and Lakhal , L. 2000 . Efficient discovery of functional dependencies and Armstrong relations . Lect. Notes Comput. Sci , 1777 : 350 – 364 .
  • Lv , T. and Yan , P. Mapping relational schemas to XML DTDs with constraints, . Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences . pp. 528 – 533 . Washington , , DC, USA Hanzhou, Zhejiang, IMSCCS’06, Vol. 2, IEEE Computer Society
  • Maier , D. 1983 . The Theory of Relational Databases , Rockville , MD : Computer Science Press .
  • Mannila , H. and Raiha , K. J. 1992 . Design of Relational Databases , Reading , MA : Addison-Wesley .
  • Mannila , H. and Raiha , K. J. 1994 . Algorithms for inferring functional dependencies from relations . Data Knowl. Eng , 12 ( 1 ) : 83 – 99 .
  • Mendelzon , A. O. Functional dependencies in logic programs . Proceedings of 11th International Conference on Very Large Data Bases . pp. 324 – 330 .
  • Mora , A. , Enciso , M. , Cordero , P. and Pérez de Guzmán , I. 2004 . The Functional Dependence Implication Problem: Optimality and Minimality. An Efficient Preprocessing Transformation Based on the Substitution Paradigm , Vol. 3040 , 136 – 146 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Artificial Intelligence
  • Mora , A. , Enciso , M. , Cordero , P. and Pérez de Guzmán , I. SLfd logic in Prolog to remove redundancy in database . Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2005, Alicante, Spain . pp. 390 – 394 . Vol. 1, J. Vigo Aguiar and B.A. Wade, eds.
  • Mora , A. , Enciso , M. , Cordero , P. and Pérez de Guzmán , I. Logic-based functional dependencies programming . Proceedings of the International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010, Almeria, Spain . pp. 468 – 479 . Vol. 1, J. Vigo Aguiar and B.A. Wade, eds.
  • Mora , A. , Pérez de Guzmán , I. , Cordero , P. and Enciso , M. 2011 . Ideal non-deterministic operators as a formal framework to reduce the key finding problem . Int. J. Comput. Math , 88 ( 9 ) : 1860 – 1868 .
  • Mora , A. , Aguilera , G. , Enciso , M. , Cordero , P. and Pérez de Guzmán , I. 2006 . A new closure algorithm based in logic: SLFD-closure versus classical closures . Iberoam. J. Artif. Intell , 31 ( 10 ) : 31 – 40 .
  • Paredaens , J. , Bra , P. D. , Gyssens , M. and Van Gucht , D. 1989 . “ The Structure of the Relational Database Model ” . In EATCS Monographs on Theoretical Computer Science , Berlin, Heidelberg : Springer-Verlag .
  • Press , W. H. , Flannery , B. P. , Teukolsky , S. A. and Vetterling , W. T. 1999 . “ Numerical Recipes in C, The Art of Scientific Computing ” . Cambridge : Cambridge University Press .
  • Savnik , I. and Flach , P. A. Bottom-up induction of functional dependencies from relations . Washington , DC , USA. Proceedings of AAAI-93 Workshop: Knowledge Discovery in Databases , pp. 174 – 185 . AAAI Press .
  • Stankovic , Z. and Milovanovic , B. 2005 . Microwave loaded cylindrical cavity modeling using knowledge-based neural networks . Microw. opt. technol. lett , 46 ( 6 ) : 580 – 585 .
  • Thalheim , B. An overview on semantical constraints for database models . 6th International Conference, Intellectual Systems and Computer Science . Moscow , Russia.
  • Torgersen , S. 1989 . Automatic design of relational databases , Ithaca , NY : Cornell University . Ph.D. thesis, TR 89-1038
  • Tran , D. T. and Choi , E. 2006 . Grid Resource Management Based on Functional Dependency , Vol. 4096 , 365 – 374 . Berlin, Heidelberg : Springer-Verlag . Embedded and Ubiquitous Computing, Lecture Notes in Computer Science
  • Ullman , J. D. 1982 . Principles of Database Systems , Rockville , MD : Computer Science Press .
  • Ullman , J. D. 1988 . Database and Knowledge-Base Systems , Rockville , MD : Computer Science Press .
  • Vincent , M. W. , Liu , J. and Mohania , M. 2007 . On the equivalence between FDs in XML and FDs in relations . Acta Inform , 44 : 207 – 247 .
  • Wild , M. 1995 . Computations With Finite Closure Systems and Implications , Vol. 959 , 111 – 120 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Yazici , A. and Karakaya , Z. 2007 . JMathNorm: A Database Normalization Tool Using Mathematica , Vol. 4488 , 186 – 193 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science
  • Zaniolo , C. 1982 . A new normal form for the design of relational database schemata . ACM Trans. Database Syst , 7 ( 3 ) : 489 – 499 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.