메뉴 건너뛰기




Volumn , Issue , 2004, Pages 58-63

SQL-based discovery of exact and approximate functional dependencies

Author keywords

Computer and information science education; Database management; Functional dependencies; Languages; SQL

Indexed keywords

DATABASE COURSE; DATABASE MANAGEMENT; DEGREE OF APPROXIMATION; FUNCTIONAL DEPENDENCY; HARD PROBLEMS; INFORMATION SCIENCE EDUCATION; LANGUAGES; MANY-TO-ONE; NON-TRIVIAL; THEORETICAL DESIGN;

EID: 77953862531     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1044550.1041658     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 2
    • 0033350089 scopus 로고    scopus 로고
    • Database dependency discovery: A machine learning approach
    • Flach, P.A., Savnik, I. [1999]. Database dependency discovery: a machine learning approach. AI Communications. 12:3(139-160).
    • (1999) AI Communications , vol.12 , Issue.3 , pp. 139-160
    • Flach, P.A.1    Savnik, I.2
  • 3
    • 33646851506 scopus 로고    scopus 로고
    • On an information theoretic approximation measure for functional dependencies
    • Bloomington, Indiana
    • Giannella, C., Robertson, E. [2001]. On an Information Theoretic Approximation Measure for Functional Dependencies. Technical Report TR555. University of Indiana. Bloomington, Indiana.
    • (2001) Technical Report TR555. University of Indiana
    • Giannella, C.1    Robertson, E.2
  • 5
    • 0345201769 scopus 로고    scopus 로고
    • TANE: An efficient algorithm for discovering functional and approximate dependencies
    • Huhtala, Y., Käkkäinen, J., Porkka, P. Toivonen, H. [1999]. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal. 42:2(100-111).
    • (1999) The Computer Journal , vol.42 , Issue.2 , pp. 100-111
    • Huhtala, Y.1    Käkkäinen, J.2    Porkka, P.3    Toivonen, H.4
  • 6
    • 0029373303 scopus 로고
    • Approximate inference of functional dependencies and Armstrong relations
    • Kiniven, J. and Mannila, H.. Approximate inference of functional dependencies and Armstrong relations. Theoretical Computer Science, 149(1):129-149, 1995.
    • (1995) Theoretical Computer Science , vol.149 , Issue.1 , pp. 129-149
    • Kiniven, J.1    Mannila, H.2
  • 8
    • 84937428829 scopus 로고    scopus 로고
    • Efficient discovery of functional dependencies and armstrong relations
    • C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, Konstanz, Germany, volume 1777 of Lecture Notes in Computer Science, Springer
    • Lopes, S., Petit, J.-M., and Lakhal, L.. Efficient discovery of functional dependencies and armstrong relations. In C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, Proceedings of the Sixth International Conference on Extending Database Technology, Konstanz, Germany, volume 1777 of Lecture Notes in Computer Science, pages 350-364. Springer, 2000.
    • (2000) Proceedings of the Sixth International Conference on Extending Database Technology , pp. 350-364
    • Lopes, S.1    Petit, J.-M.2    Lakhal, L.3
  • 11
    • 0000300428 scopus 로고
    • On the complexity of inferring functional dependencies
    • Mannila, H., and Raiha, K. On the complexity of inferring functional dependencies, Discrete Appl. Math. 40 (1992) 237-243.
    • (1992) Discrete Appl. Math. , vol.40 , pp. 237-243
    • Mannila, H.1    Raiha, K.2


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