메뉴 건너뛰기




Volumn 10, Issue 31, 2006, Pages 31-40

A new closure algorithm based in logic: SLFD-closure versus classical closures

Author keywords

Closure; Functional dependencies; Logic

Indexed keywords


EID: 33845578116     PISSN: 11373601     EISSN: None     Source Type: Journal    
DOI: 10.4114/ia.v10i31.935     Document Type: Article
Times cited : (12)

References (33)
  • 2
    • 1142287643 scopus 로고    scopus 로고
    • An information-theoretic approach to normal forms for relational and xml data
    • Marcelo Arenas and Leonid Libkin. An information-theoretic approach to normal forms for relational and xml data. In PODS,San Diego, CA, USA, 2003.
    • (2003) PODS,San Diego, CA, USA
    • Arenas, M.1    Libkin, L.2
  • 5
    • 0018442877 scopus 로고
    • Computational problems related to the design of normal form relational schemas
    • C. Beeri and P. A. Bernstein. Computational Problems related to the design of normal form relational schemas. ACM Transactions on Database Systems, 4 (1):30-59, 1979.
    • (1979) ACM Transactions on Database Systems , vol.4 , Issue.1 , pp. 30-59
    • Beeri, C.1    Bernstein, P.A.2
  • 9
    • 0037447220 scopus 로고    scopus 로고
    • The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
    • Nathalie Caspard and Bernard Monjardet. The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics, 127 (2):241-269, 2003.
    • (2003) Discrete Applied Mathematics , vol.127 , Issue.2 , pp. 241-269
    • Caspard, N.1    Monjardet, B.2
  • 10
    • 0014797273 scopus 로고
    • A relational model of data for large share data banks
    • Edgar F. Codd. A relational model of data for large share data banks. Comm. ACM, 13 (6):377-387, 1970.
    • (1970) Comm. ACM , vol.13 , Issue.6 , pp. 377-387
    • Codd, E.F.1
  • 12
    • 0015661079 scopus 로고
    • Decomposition of a data base and the theory of boolean switching functions
    • C. Delobel and R.G. Casey. Decomposition of a data base and the theory of boolean switching functions. IBM J. of Research and Development, 17 (5), 1973.
    • (1973) IBM J. of Research and Development , vol.17 , Issue.5
    • Delobel, C.1    Casey, R.G.2
  • 13
    • 0024087601 scopus 로고
    • New methods and fast algorithms for database normalization
    • Jim Diederich and Jack Milton. New methods and fast algorithms for database normalization. ACM Transactions on Database Systems, 13 (3):339-365, 1988.
    • (1988) ACM Transactions on Database Systems , vol.13 , Issue.3 , pp. 339-365
    • Diederich, J.1    Milton, J.2
  • 14
    • 0032180332 scopus 로고    scopus 로고
    • Rough computational methods for information systems
    • J. W. Guan and D. A. Bell. Rough computational methods for information systems. Artificial Intelligence, 105 (1):77-103, 1998.
    • (1998) Artificial Intelligence , vol.105 , Issue.1 , pp. 77-103
    • Guan, J.W.1    Bell, D.A.2
  • 15
    • 3042562398 scopus 로고    scopus 로고
    • Time structures. Formal description and algorithmic representation
    • Erika Hajnicz. Time structures. Formal description and algorithmic representation. LNAI 1047, Springer-Verlag, 1996.
    • (1996) LNAI 1047, Springer-Verlag
    • Hajnicz, E.1
  • 16
    • 13944267600 scopus 로고    scopus 로고
    • The implication problem of functional dependencies in complex-value databases
    • S. Hartmann and S. Link. The implication problem of functional dependencies in complex-value databases. Electronic Notes in Theoretical Computer Science, 123:125-137, 2005.
    • (2005) Electronic Notes in Theoretical Computer Science , vol.123 , pp. 125-137
    • Hartmann, S.1    Link, S.2
  • 17
    • 0033620270 scopus 로고    scopus 로고
    • Functional dependencies in Horn Theories
    • Toshihide Ibaraki, Alexander Kogan, and Kazuhisa Makino. Functional dependencies in Horn Theories. Artificial Intelligence, 108 1-2:1-30, 1999.
    • (1999) Artificial Intelligence , vol.108 , Issue.1-2 , pp. 1-30
    • Ibaraki, T.1    Kogan, A.2    Makino, K.3
  • 19
    • 84883789398 scopus 로고    scopus 로고
    • Designing functional dependencies for xml
    • M. L. Lee, T. W. Ling, and W. L. Low. Designing functional dependencies for xml. LNCS, Springer-Verlag, 2287:124-141, 2002.
    • (2002) LNCS, Springer-Verlag , vol.2287 , pp. 124-141
    • Lee, M.L.1    Ling, T.W.2    Low, W.L.3
  • 20
    • 1642269166 scopus 로고
    • The theory of relational databases
    • David Maier. The theory of relational databases. Computer Science Press, 1983.
    • (1983) Computer Science Press
    • Maier, D.1
  • 23
    • 0028377853 scopus 로고
    • Algorithms for inferring functional dependencies from relations
    • H. Mannila and K. Raiha. Algorithms for inferring functional dependencies from relations. Data and Knowledge Engineering, 12 (1):83-99, 1994.
    • (1994) Data and Knowledge Engineering , vol.12 , Issue.1 , pp. 83-99
    • Mannila, H.1    Raiha, K.2
  • 25
    • 7444246898 scopus 로고    scopus 로고
    • An efficient preprocessing transformation for functional dependencies sets based on the substitution paradigm
    • Angel Mora, Manuel Enciso, Pablo Cordero, and Inmaculada P. de Guzmán. An efficient preprocessing transformation for functional dependencies sets based on the substitution paradigm. LNAI, Springer- Verlag (CAEPIA 2003), 3040, 2004.
    • (2004) LNAI, Springer- Verlag (CAEPIA 2003) , vol.3040
    • Mora, A.1    Enciso, M.2    Cordero, P.3    De Guzmán, I.P.4
  • 32
    • 33747384930 scopus 로고    scopus 로고
    • Thorough investigations into: An improved algorithm based on subset closures for synthesizing a relational database cheme
    • Lin Lin Wang. Thorough investigations into : An improved algorithm based on subset closures for synthesizing a relational database cheme. IEEE Transactions On Software Engineering, 22 (4):271-274, 1996.
    • (1996) IEEE Transactions on Software Engineering , vol.22 , Issue.4 , pp. 271-274
    • Lin, L.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.