메뉴 건너뛰기




Volumn 36, Issue 3, 2011, Pages

Differential dependencies: Reasoning and discovery

Author keywords

Data dependencies; Differential dependencies

Indexed keywords

DATA DEPENDENCIES; DATA PARTITION; DATA SETS; DIFFERENTIAL DEPENDENCIES; DIFFERENTIAL FUNCTIONS; EXPERIMENTAL EVALUATION; FORMAL DEFINITION; FUNCTIONAL DEPENDENCY; INFERENCE SYSTEMS; INTRINSIC HARDNESS; NUMERICAL VALUES; ORDER RELATION; PRACTICAL PROBLEMS; PRICE DIFFERENCE; PRUNING METHODS; QUERY OPTIMIZATION; REAL APPLICATIONS; REAL DATA SETS; RECORD LINKAGE;

EID: 80052365341     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2000824.2000826     Document Type: Article
Times cited : (116)

References (56)
  • 3
    • 0001454571 scopus 로고
    • Dependency structures of data base relationships
    • ARMSTRONG, W. W. 1974. Dependency structures of data base relationships. In Proceedings of the IFIP Congress. 580-583.
    • (1974) Proceedings of the IFIP Congress , pp. 580-583
    • Armstrong, W.W.1
  • 4
    • 0001548856 scopus 로고
    • A linear-time algorithm for testing the truth of certain quantified boolean formulas
    • ASPVALL, B., PLASS, M. F., AND TARJAN, R. E. 1979. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8, 3, 121-123.
    • (1979) Inf. Process. Lett. , vol.8 , Issue.3 , pp. 121-123
    • Aspvall, B.1    Plass, M.F.2    Tarjan, R.E.3
  • 11
    • 0023010037 scopus 로고
    • Fractional cascading: I. A data structuring technique
    • CHAZELLE, B. AND GUIBAS, L. J. 1986a. Fractional cascading: I. A data structuring technique. Algorithmica 1, 2, 133-162. (Pubitemid 17556682)
    • (1986) Algorithmica (New York) , vol.1 , Issue.2 , pp. 133-162
    • Chazelle Bernard1    Guibas Leonidas, J.2
  • 12
    • 52449148533 scopus 로고
    • Fractional cascading: Ii. Applications
    • CHAZELLE, B. AND GUIBAS, L. J. 1986b. Fractional cascading: Ii. Applications. Algorithmica 1, 2, 163-191.
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 163-191
    • Chazelle, B.1    Guibas, L.J.2
  • 13
    • 74549188261 scopus 로고    scopus 로고
    • Discovering data quality rules
    • CHIANG, F. AND MILLER, R. J. 2008. Discovering data quality rules. Proc. VLDB 1, 1, 1166-1177.
    • (2008) Proc. VLDB , vol.1 , Issue.1 , pp. 1166-1177
    • Chiang, F.1    Miller, R.J.2
  • 14
    • 36849055542 scopus 로고    scopus 로고
    • On the computational complexity of minimal-change integrity maintenance in relational databases
    • CHOMICKI, J. AND MARCINKOWSKI, J. 2005. On the computational complexity of minimal-change integrity maintenance in relational databases. In Inconsistency Tolerance. 119-150.
    • (2005) Inconsistency Tolerance , pp. 119-150
    • Chomicki, J.1    Marcinkowski, J.2
  • 20
    • 46649106686 scopus 로고    scopus 로고
    • Conditional functional dependencies for capturing data inconsistencies
    • FAN, W., GEERTS, F., JIA, X., AND KEMENTSIETSIDIS, A. 2008a. Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Datab. Syst. 33, 2.
    • (2008) ACM Trans. Datab. Syst. , vol.33 , pp. 2
    • Fan, W.1    Geerts, F.2    Jia, X.3    Kementsietsidis, A.4
  • 23
    • 79953184736 scopus 로고    scopus 로고
    • Propagating functional dependencies with conditions
    • FAN, W., MA, S., HU, Y., LIU, J., AND WU, Y. 2008b. Propagating functional dependencies with conditions. Proc. VLDB 1, 1, 391-407.
    • (2008) Proc. VLDB , vol.1 , Issue.1 , pp. 391-407
    • Fan, W.1    Ma, S.2    Hu, Y.3    Liu, J.4    Y, W.U.5
  • 24
    • 0033350089 scopus 로고    scopus 로고
    • Database dependency discovery: A machine learning approach
    • FLACH, P. A. AND SAVNIK, I. 1999. Database dependency discovery: A machine learning approach. Artif. Intell. Comm. 12, 3, 139-160. (Pubitemid 30506806)
    • (1999) AI Communications , vol.12 , Issue.3 , pp. 139-160
    • Flach, P.A.1    Savnik, I.2
  • 25
    • 31444453796 scopus 로고    scopus 로고
    • From databases to dataspaces: A new abstraction for information management
    • DOI 10.1145/1107499.1107502
    • FRANKLIN, M. J., HALEVY, A. Y., AND MAIER, D. 2005. From databases to dataspaces: A new abstraction for information management. SIGMOD Rec. 34, 4, 27-33. (Pubitemid 43152545)
    • (2005) SIGMOD Record , vol.34 , Issue.4 , pp. 27-33
    • Franklin, M.1    Halevy, A.2    Maier, D.3
  • 27
    • 0000108087 scopus 로고
    • Order dependency in the relational model
    • GINSBURG, S. AND HULL, R. 1983a. Order dependency in the relational model. Theor. Comput. Sci. 26, 149-195.
    • (1983) Theor. Comput. Sci. , vol.26 , pp. 149-195
    • Ginsburg, S.1    Hull, R.2
  • 29
    • 0022752631 scopus 로고
    • Sort sets in the relational model
    • GINSBURG, S. AND HULL, R. 1986. Sort sets in the relational model. J. ACM 33, 3, 465-488.
    • (1986) J. ACM , vol.33 , Issue.3 , pp. 465-488
    • Ginsburg, S.1    Hull, R.2
  • 31
    • 70349846180 scopus 로고    scopus 로고
    • On generating near-optimal tableaux for conditional functional dependencies
    • GOLAB, L., KARLOFF, H. J., KORN, F., SRIVASTAVA, D., AND YU, B. 2008. On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB 1, 1, 376-390.
    • (2008) Proc. VLDB , vol.1 , Issue.1 , pp. 376-390
    • Golab, L.1    Karloff, H.J.2    Korn, F.3    Srivastava, D.4    B, Y.U.5
  • 35
    • 0345201769 scopus 로고    scopus 로고
    • Tane: An efficient algorithm for discovering functional and approximate dependencies
    • HUHTALA, Y., KARKKAINEN, J., PORKKA, P., AND TOIVONEN, H. 1999. Tane: An efficient algorithm for discovering functional and approximate dependencies. Comput. J. 42, 2, 100-111.
    • (1999) Comput. J. , vol.42 , Issue.2 , pp. 100-111
    • Huhtala, Y.1    Karkkainen, J.2    Porkka, P.3    Toivonen, H.4
  • 37
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. E. Miller and J. W. Thatcher Eds., Plenum Press
    • KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher Eds., Plenum Press, 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 38
    • 80052381410 scopus 로고    scopus 로고
    • Correlation maps: A compressed access method for exploiting soft functional dependencies
    • KIMURA, H., HUO, G., RASIN, A., MADDEN, S., AND ZDONIK, S. B. 2009. Correlation maps: A compressed access method for exploiting soft functional dependencies. Proc. VLDB 2, 1, 1222-1233.
    • (2009) Proc. VLDB , vol.2 , Issue.1 , pp. 1222-1233
    • Kimura, H.1    Huo, G.2    Rasin, A.3    Madden, S.4    Zdonik, S.B.5
  • 39
    • 0029373303 scopus 로고
    • Approximate inference of functional dependencies from relations
    • KIVINEN, J. AND MANNILA, H. 1995. Approximate inference of functional dependencies from relations. Theor. Comput. Sci. 149, 1, 129-149.
    • (1995) Theor. Comput. Sci. , vol.149 , Issue.1 , pp. 129-149
    • Kivinen, J.1    Mannila, H.2
  • 48
    • 0028377853 scopus 로고
    • Algorithms for inferring functional dependencies from relations
    • MANNILA, H. AND RAI HA, K.-J. 1994. Algorithms for inferring functional dependencies from relations. Data Knowl. Engin. 12, 1, 83-99.
    • (1994) Data Knowl. Engin. , vol.12 , Issue.1 , pp. 83-99
    • Mannila, H.1    Rai Ha, K.-J.2
  • 49
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • NAVARRO, G. 2001. A guided tour to approximate string matching. ACM Comput. Surv. 33, 1, 31-88. (Pubitemid 33768480)
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 50
    • 0033220753 scopus 로고    scopus 로고
    • Ordered functional dependencies in relational databases
    • NG, W. 1999. Ordered functional dependencies in relational databases. Inf. Syst. 24, 7, 535-554.
    • (1999) Inf. Syst. , vol.24 , Issue.7 , pp. 535-554
    • W, N.G.1
  • 51
    • 0347710442 scopus 로고    scopus 로고
    • An extension of the relational data model to incorporate ordered domains
    • NG, W. 2001. An extension of the relational data model to incorporate ordered domains. ACM Trans. Datab. Syst. 26, 3, 344-383.
    • (2001) ACM Trans. Datab. Syst. , vol.26 , Issue.3 , pp. 344-383
    • W, N.G.1
  • 53
  • 54
    • 0032208149 scopus 로고    scopus 로고
    • Reasoning about qualitative trends in databases
    • PII S0306437998000234
    • WIJSEN, J. 1998. Reasoning about qualitative trends in databases. Inf. Syst. 23, 7, 463-487. (Pubitemid 128679829)
    • (1998) Information Systems , vol.23 , Issue.7 , pp. 463-487
    • Wijsen, J.1
  • 55
    • 0035329685 scopus 로고    scopus 로고
    • Trends in databases: Reasoning and mining
    • DOI 10.1109/69.929900, Special Section on Semantic Issues of Multimedia Systems
    • WIJSEN, J. 2001. Trends in databases: Reasoning and mining. IEEE Trans. Knowl. Data Engin. 13, 3, 426-438. (Pubitemid 32611043)
    • (2001) IEEE Transactions on Knowledge and Data Engineering , vol.13 , Issue.3 , pp. 426-438
    • Wijsen, J.1
  • 56
    • 84958780501 scopus 로고    scopus 로고
    • Fastfds: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract
    • Data Warehousing and Knowledge Discovery
    • WYSS, C. M., GIANNELLA, C., AND ROBERTSON, E. L. 2001. Fastfds: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract. In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DaWaK'01). 101-110. (Pubitemid 33332758)
    • (2001) Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DaWaK'01) , Issue.2114 , pp. 101-110
    • Wyss, C.1    Giannella, C.2    Robertson, E.3


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