메뉴 건너뛰기




Volumn 66, Issue 1, 2003, Pages 20-39

Query containment for data integration systems

Author keywords

Binding patterns; Data integration; Datalog; Query containment; Query rewriting; Views

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; PROBLEM SOLVING; WORLD WIDE WEB;

EID: 0038266970     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00028-4     Document Type: Article
Times cited : (25)

References (45)
  • 1
    • 0031632361 scopus 로고    scopus 로고
    • Complexity of answering queries using materialized views
    • Seattle, WA
    • S. Abiteboul, O. Duschka, Complexity of answering queries using materialized views, in: Proceedings of PODS. Seattle, WA, 1998, pp. 254-263.
    • (1998) Proceedings of PODS , pp. 254-263
    • Abiteboul, S.1    Duschka, O.2
  • 4
    • 0000808583 scopus 로고
    • Equivalence of relational expressions
    • A. Aho, Y. Sagiv, J.D. Ullman. Equivalence of relational expressions. SIAM J. Comput. 2 (8) (1979) 218-246.
    • (1979) SIAM J. Comput. , vol.2 , Issue.8 , pp. 218-246
    • Aho, A.1    Sagiv, Y.2    Ullman, J.D.3
  • 7
    • 0030713821 scopus 로고    scopus 로고
    • Rewriting queries using views in description logics
    • Tucson, AZ
    • C. Beeri, A.Y. Levy, M.-C. Rousset, Rewriting queries using views in description logics, in: Proceedings of PODS, Tucson. AZ, 1997, pp. 99-108.
    • (1997) Proceedings of PODS , pp. 99-108
    • Beeri, C.1    Levy, A.Y.2    Rousset, M.-C.3
  • 9
    • 0002087034 scopus 로고
    • Representing and using interschema knowledge in cooperative information systems
    • T. Catarci, M. Lenzerini, Representing and using interschema knowledge in cooperative information systems, J. Intell. Cooperative Inform. Systems 2 (4) (1993) 375-398.
    • (1993) J. Intell. Cooperative Inform. Systems , vol.2 , Issue.4 , pp. 375-398
    • Catarci, T.1    Lenzerini, M.2
  • 12
    • 0026999443 scopus 로고
    • On the equivalence of recursive and nonrecursive datalog programs
    • San Diego, CA
    • S. Chaudhuri, M. Vardi, On the equivalence of recursive and nonrecursive datalog programs, in: Proceedings of PODS, San Diego, CA, 1992, pp. 55-66.
    • (1992) Proceedings of PODS , pp. 55-66
    • Chaudhuri, S.1    Vardi, M.2
  • 13
    • 85026649349 scopus 로고
    • Implementation and performance evaluation of the ADMS query optimizer
    • Cambridge, UK, March
    • C. Chen, N. Roussopoulos, Implementation and performance evaluation of the ADMS query optimizer, in: Proceedings of EDBT, Cambridge, UK, March 1994, pp. 323-336.
    • (1994) Proceedings of EDBT , pp. 323-336
    • Chen, C.1    Roussopoulos, N.2
  • 14
    • 0032091575 scopus 로고    scopus 로고
    • Integration of heterogeneous databases without common domains using queries based on textual similarity
    • Seattle, WA
    • W. Cohen, Integration of heterogeneous databases without common domains using queries based on textual similarity, in: Proceedings of SIGMOD, Seattle, WA, 1998.
    • (1998) Proceedings of SIGMOD
    • Cohen, W.1
  • 16
    • 0034996991 scopus 로고    scopus 로고
    • The nimble xml data integration system
    • Heidelberg, Germany
    • D. Draper, A.Y. Halevy, D.S. Weld. The nimble xml data integration system, in: Proceedings of ICDE, Heidelberg, Germany, 2001, pp. 155-160.
    • (2001) Proceedings of ICDE , pp. 155-160
    • Draper, D.1    Halevy, A.Y.2    Weld, D.S.3
  • 18
    • 0030642616 scopus 로고    scopus 로고
    • Answering recursive queries using views
    • Tucson, AZ
    • O.M. Duschka, M.R. Genesereth, Answering recursive queries using views, in: Proceedings of PODS, Tucson, AZ, 1997, pp. 109-116.
    • (1997) Proceedings of PODS , pp. 109-116
    • Duschka, O.M.1    Genesereth, M.R.2
  • 25
    • 84947221006 scopus 로고    scopus 로고
    • Tableau techniques for querying information sources through global schemas
    • Jerusalem, Israel
    • G. Grahne, A.O. Mendelzon, Tableau techniques for querying information sources through global schemas, in: Proceedings of ICDT, Jerusalem, Israel, 1999, pp. 332-347.
    • (1999) Proceedings of ICDT , pp. 332-347
    • Grahne, G.1    Mendelzon, A.O.2
  • 26
    • 0027961219 scopus 로고
    • Constraint checking with partial information
    • Minneapolis, MN
    • A. Gupta, Y. Sagiv, J.D. Ullman, J. Widom, Constraint checking with partial information, in: Proceedings of PODS, Minneapolis, MN, 1994, 45-55.
    • (1994) Proceedings of PODS , pp. 45-55
    • Gupta, A.1    Sagiv, Y.2    Ullman, J.D.3    Widom, J.4
  • 29
    • 0002274592 scopus 로고    scopus 로고
    • A predicate-based caching scheme for client-server database architectures
    • A.M. Keller, J. Basu. A predicate-based caching scheme for client-server database architectures, VLDB J. 5 (1) (1996) 35-47.
    • (1996) VLDB J. , vol.5 , Issue.1 , pp. 35-47
    • Keller, A.M.1    Basu, J.2
  • 30
    • 0023827554 scopus 로고
    • On conjunctive queries containing inequalities
    • A. Klug, On conjunctive queries containing inequalities, J. ACM 35 (1) (1988) 146-160.
    • (1988) J. ACM , vol.35 , Issue.1 , pp. 146-160
    • Klug, A.1
  • 34
    • 0002988773 scopus 로고    scopus 로고
    • Querying heterogeneous information sources using source descriptions
    • Bombay, India
    • A.Y. Levy, A. Rajaraman, J.J. Ordille, Querying heterogeneous information sources using source descriptions, in: Proceedings of VLDB. Bombay, India. 1996, pp. 251-262.
    • (1996) Proceedings of VLDB , pp. 251-262
    • Levy, A.Y.1    Rajaraman, A.2    Ordille, J.J.3
  • 35
    • 0002724796 scopus 로고
    • Queries independent of updates
    • Dublin. Ireland
    • A.Y. Levy, Y. Sagiv, Queries independent of updates, in: Proceedings of VLDB. Dublin. Ireland. 1993, pp. 171-181.
    • (1993) Proceedings of VLDB , pp. 171-181
    • Levy, A.Y.1    Sagiv, Y.2
  • 36
    • 70449484108 scopus 로고    scopus 로고
    • On answering queries in the presence of limited access patterns
    • London, UK
    • C. Li, K. Chang, On answering queries in the presence of limited access patterns, in: Proceedings of ICDT. London, UK. 2001. pp. 219-233.
    • (2001) Proceedings of ICDT , pp. 219-233
    • Li, C.1    Chang, K.2
  • 37
    • 0033717854 scopus 로고    scopus 로고
    • Query containment for data integration systems
    • Dallas, TX
    • T. Millstein, A. Levy, M. Friedman, Query containment for data integration systems, in: Proceedings of PODS. Dallas, TX. 2000. pp. 67-75.
    • (2000) Proceedings of PODS , pp. 67-75
    • Millstein, T.1    Levy, A.2    Friedman, M.3
  • 38
    • 84877333905 scopus 로고    scopus 로고
    • A scalable algorithm for answering queries using views
    • Cairo. Egypt
    • R. Pottinger, A. Levy, A scalable algorithm for answering queries using views, in: Proceedings of VLDB. Cairo. Egypt. 2000, pp. 484-495.
    • (2000) Proceedings of VLDB , pp. 484-495
    • Pottinger, R.1    Levy, A.2
  • 39
    • 0029193408 scopus 로고
    • Answering queries using templates with binding patterns
    • San Jose, CA
    • A. Rajaraman, Y. Sagiv, J.D. Ullman, Answering queries using templates with binding patterns, in: Proceedings of PODS, San Jose, CA. 1995, pp. 105-112.
    • (1995) Proceedings of PODS , pp. 105-112
    • Rajaraman, A.1    Sagiv, Y.2    Ullman, J.D.3
  • 40
    • 84976685263 scopus 로고
    • Equivalence among relational expressions with the union and difference operators
    • Y. Sagiv, M. Yannakakis, Equivalence among relational expressions with the union and difference operators, J. ACM 27 (4) (1980) 633-655.
    • (1980) J. ACM , vol.27 , Issue.4 , pp. 633-655
    • Sagiv, Y.1    Yannakakis, M.2
  • 41
    • 0002732106 scopus 로고
    • Equivalence of datalog queries is undecidable
    • O. Shmueli, Equivalence of datalog queries is undecidable. J. Logic Programming 15 (1993) 231-241.
    • (1993) J. Logic Programming , vol.15 , pp. 231-241
    • Shmueli, O.1
  • 42
    • 44649167785 scopus 로고
    • The polynomial-time hierarchy
    • L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1976) 1-22.
    • (1976) Theoret. Comput. Sci. , vol.3 , pp. 1-22
    • Stockmeyer, L.1
  • 43
    • 0001535839 scopus 로고    scopus 로고
    • The GMAP: A versatile tool for physical data independence
    • O.G. Tsatalos, M.H. Solomon, Y.E. Ioannidis, The GMAP: a versatile tool for physical data independence. VLDB J. 5 (2) (1996) 101-118.
    • (1996) VLDB J. , vol.5 , Issue.2 , pp. 101-118
    • Tsatalos, O.G.1    Solomon, M.H.2    Ioannidis, Y.E.3
  • 44
    • 0026996324 scopus 로고
    • The complexity of querying indefinite data about linearly ordered domains
    • San Diego, CA
    • R. van der Meyden, The complexity of querying indefinite data about linearly ordered domains, in: Proceedings of PODS, San Diego, CA, 1992, pp. 331 -345.
    • (1992) Proceedings of PODS , pp. 331-345
    • Van der Meyden, R.1
  • 45
    • 0003144828 scopus 로고
    • Query transformation for PSJ-queries
    • Brighton, England
    • H.Z. Yang, P.A. Larson, Query transformation for PSJ-queries, in: Proceedings of VLDB, Brighton, England, 1987, pp. 245-254.
    • (1987) Proceedings of VLDB , pp. 245-254
    • Yang, H.Z.1    Larson, P.A.2


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