메뉴 건너뛰기




Volumn 32, Issue 1, 2009, Pages 53-73

Unary and n-ary inclusion dependency discovery in relational databases

Author keywords

Inclusion dependency discovery; Relational databases

Indexed keywords

INFERENCE ENGINES;

EID: 58549093024     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-007-0048-x     Document Type: Article
Times cited : (56)

References (36)
  • 4
    • 35148901629 scopus 로고
    • An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing
    • L. Libkin & B. Thalheim (Eds.), Semantics in databases Springer
    • Albrecht, M., Buchholz, E., Düsterhöft, A., & Thalheim, B. (1995). An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. In L. Libkin & B. Thalheim (Eds.), Semantics in databases (Vol. 1358, pp. 1-28). Lecture Notes in Computer Science, Springer.
    • (1995) Lecture Notes in Computer Science , vol.1358 , pp. 1-28
    • Albrecht, M.1    Buchholz, E.2    Düsterhöft, A.3    Thalheim, B.4
  • 6
    • 0003704318 scopus 로고    scopus 로고
    • Irvine,CA:UniversityofCalifornia, DepartmentofInformationandComputerScience
    • Bay, S. D. (1999). The UCI KDD archive [ http://kdd.ics.uci.edu ]. Technical report, Irvine, CA: University of California, Department of Information and Computer Science.
    • (1999) The UCI KDD Archive
    • Bay, S.D.1
  • 7
    • 84948957674 scopus 로고
    • Discovery of constraints and data dependencies in databases (extended abstract)
    • N. Lavrac & S. Wrobel (Eds.) European conference on machine learning (ECML'95) Crete, Greece Springer
    • Bell, S., & Brockhausen, P. (1995). Discovery of constraints and data dependencies in databases (extended abstract). In N. Lavrac & S. Wrobel (Eds.), European conference on machine learning (ECML'95) (Vol. 912, pp. 267-270). Crete, Greece: Lecture Notes in Computer Science, Springer.
    • (1995) Lecture Notes in Computer Science , vol.912 , pp. 267-270
    • Bell, S.1    Brockhausen, P.2
  • 12
    • 0036366837 scopus 로고    scopus 로고
    • Mining database structure; Or, how to build a data quality browser
    • Madison, WI, USA
    • Dasu, T., Johnson, T., Muthukrishnan, S., & Shkapenyuk, V. (2002). Mining database structure; or, how to build a data quality browser. In ACM SIGMOD conference 2002 (pp. 240-251). Madison, WI, USA.
    • (2002) ACM SIGMOD Conference 2002 , pp. 240-251
    • Dasu, T.1    Johnson, T.2    Muthukrishnan, S.3    Shkapenyuk, V.4
  • 13
    • 84883798941 scopus 로고    scopus 로고
    • Efficient algorithms for mining inclusion dependencies
    • C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, et al. (Eds.) International conference on extending database technology (EDBT'02) Prague, Czech Republic Springer
    • De Marchi, F., Lopes, S., & Petit, J.-M. (2002). Efficient algorithms for mining inclusion dependencies. In C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, et al. (Eds.), International conference on extending database technology (EDBT'02) (Vol. 2287, pp. 464-476). Prague, Czech Republic: Lecture Notes in Computer Science, Springer.
    • (2002) Lecture Notes in Computer Science , vol.2287 , pp. 464-476
    • De Marchi, F.1    Lopes, S.2    Petit, J.-M.3
  • 14
    • 2442427019 scopus 로고    scopus 로고
    • Analysis of existing databases at the logical level: The DBA companion project
    • 1
    • F. De Marchi S. Lopes J.-M. Petit F. Toumani 2003 Analysis of existing databases at the logical level: The DBA companion project ACM Sigmod Record 32 1 47 52
    • (2003) ACM Sigmod Record , vol.32 , pp. 47-52
    • De Marchi, F.1    Lopes, S.2    Petit, J.-M.3    Toumani, F.4
  • 15
    • 34548579999 scopus 로고    scopus 로고
    • Zigzag: A new algorithm for discovering large inclusion dependencies in relational databases
    • IEEE Computer Society Melbourne, FL, USA
    • De Marchi, F., & Petit, J.-M. (2003). Zigzag: A new algorithm for discovering large inclusion dependencies in relational databases. In International conference on data mining (ICDM'03) (pp. 27-34). Melbourne, FL, USA: IEEE Computer Society.
    • (2003) International Conference on Data Mining (ICDM'03) , pp. 27-34
    • De Marchi, F.1    Petit, J.-M.2
  • 18
    • 0031705065 scopus 로고    scopus 로고
    • Query folding with inclusion dependencies
    • Orlando, FL, USA IEEE Computer Society
    • Gryz, J. (1998). Query folding with inclusion dependencies. In International conference on data engineering (ICDE'98) (pp. 126-133). Orlando, FL, USA: IEEE Computer Society.
    • (1998) International Conference on Data Engineering (ICDE'98) , pp. 126-133
    • Gryz, J.1
  • 20
    • 0345201769 scopus 로고    scopus 로고
    • TANE: An efficient algorithm for discovering functional and approximate dependencies
    • 2
    • Y. Huhtala J. Karkkainen P. Porkka H. Toivonen 1999 TANE: An efficient algorithm for discovering functional and approximate dependencies The Computer Journal 42 2 100 111
    • (1999) The Computer Journal , vol.42 , pp. 100-111
    • Huhtala, Y.1    Karkkainen, J.2    Porkka, P.3    Toivonen, H.4
  • 22
    • 0029373303 scopus 로고
    • Approximate inference of functional dependencies from relations
    • 1
    • J. Kivinen H. Mannila 1995 Approximate inference of functional dependencies from relations Theoretical Computer Science 149 1 129 149
    • (1995) Theoretical Computer Science , vol.149 , pp. 129-149
    • Kivinen, J.1    Mannila, H.2
  • 27
    • 0036556037 scopus 로고    scopus 로고
    • Functional and approximate dependencies mining: Databases and FCA point of view
    • 2/3
    • S. Lopes J.-M. Petit L. Lakhal 2002 Functional and approximate dependencies mining: Databases and FCA point of view Special issue of JETAI 14 2/3 93 114
    • (2002) Special Issue of JETAI , vol.14 , pp. 93-114
    • Lopes, S.1    Petit, J.-M.2    Lakhal, L.3
  • 28
    • 0036498516 scopus 로고    scopus 로고
    • Discovering interesting inclusion dependencies: Application to logical database tuning
    • 1
    • S. Lopes J.-M. Petit F. Toumani 2002 Discovering interesting inclusion dependencies: Application to logical database tuning Information System 17 1 1 19
    • (2002) Information System , vol.17 , pp. 1-19
    • Lopes, S.1    Petit, J.-M.2    Toumani, F.3
  • 31
    • 21944442464 scopus 로고    scopus 로고
    • Levelwise search and borders of theories in knowledge discovery
    • 1
    • H. Mannila H. Toivonen 1997 Levelwise search and borders of theories in knowledge discovery Data Mining and Knowledge Discovery 1 1 241 258
    • (1997) Data Mining and Knowledge Discovery , vol.1 , pp. 241-258
    • Mannila, H.1    Toivonen, H.2
  • 33
    • 0020716825 scopus 로고
    • The implication problem for functional and inclusion dependencies
    • 3
    • J. C. Mitchell 1983 The implication problem for functional and inclusion dependencies Information and Control 56 3 154 173
    • (1983) Information and Control , vol.56 , pp. 154-173
    • Mitchell, J.C.1
  • 34
    • 0035501368 scopus 로고    scopus 로고
    • Functional and embedded dependency inference: A data mining point of view
    • 7
    • N. Novelli R. Cicchetti 2001 Functional and embedded dependency inference: A data mining point of view Information System 26 7 477 506
    • (2001) Information System , vol.26 , pp. 477-506
    • Novelli, N.1    Cicchetti, R.2
  • 35
    • 23044518930 scopus 로고    scopus 로고
    • Integrating association rule mining with relational database systems: Alternatives and implications
    • 2/3
    • S. Sarawagi S. Thomas R. Agrawal 2000 Integrating association rule mining with relational database systems: Alternatives and implications Data Mining and Knowledge Discovery 4 2/3 89 125
    • (2000) Data Mining and Knowledge Discovery , vol.4 , pp. 89-125
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3
  • 36
    • 84958780501 scopus 로고    scopus 로고
    • FastFDs: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances
    • Y. Kambayashi, W. Winiwarter, & M. Arikawa (Eds.) Data warehousing and knowledge discovery (DaWaK'01) Munich, Germany
    • Wyss, C., Giannella, C., & Robertson, E. (2001). FastFDs: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances. In Y. Kambayashi, W. Winiwarter, & M. Arikawa (Eds.), Data warehousing and knowledge discovery (DaWaK'01) (Vol. 2114, pp. 101-110). Munich, Germany: Lecture Notes in Computer Science.
    • (2001) Lecture Notes in Computer Science , vol.2114 , pp. 101-110
    • Wyss, C.1    Giannella, C.2    Robertson, E.3


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