메뉴 건너뛰기




Volumn 30, Issue 2, 2001, Pages 497-508

Minimization of tree pattern queries

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0039561477     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375730     Document Type: Article
Times cited : (87)

References (19)
  • 3
    • 0001864155 scopus 로고    scopus 로고
    • Quilt: An XML query language for heterogeneous data sources
    • D. D. Chamberlin, J. Robie, and D. Florescu. Quilt: An XML query language for heterogeneous data sources. WebDB 2000.
    • WebDB 2000
    • Chamberlin, D.D.1    Robie, J.2    Florescu, D.3
  • 4
    • 0026962827 scopus 로고    scopus 로고
    • Containment and minimization of positive conjunctive queries in OODBs
    • E. P. F. Chan. Containment and minimization of positive conjunctive queries in OODBs. PODS 1992.
    • PODS 1992
    • Chan, E.P.F.1
  • 5
    • 84958776545 scopus 로고    scopus 로고
    • Optimal implementation of conjunctive queries in relational databases
    • A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. STOC 1977.
    • STOC 1977
    • Chandra, A.K.1    Merlin, P.M.2
  • 8
    • 0031623844 scopus 로고    scopus 로고
    • Query containment for conjunctive queries with regular expressions
    • D. Florescu, A. Y. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. PODS 1998.
    • PODS 1998
    • Florescu, D.1    Levy, A.Y.2    Suciu, D.3
  • 11
    • 0031632775 scopus 로고    scopus 로고
    • On the complexity of the containment problem for conjunctive queries with built-in predicates
    • P. G. Kolaitis, D. L. Martin, and M. N. Thakur. On the complexity of the containment problem for conjunctive queries with built-in predicates. PODS 1998.
    • PODS 1998
    • Kolaitis, P.G.1    Martin, D.L.2    Thakur, M.N.3
  • 12
    • 0031618504 scopus 로고    scopus 로고
    • Conjunctive-query containment and constraint satisfaction
    • P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. PODS 1998.
    • PODS 1998
    • Kolaitis, P.G.1    Vardi, M.Y.2
  • 13
    • 0030645665 scopus 로고    scopus 로고
    • Deciding containment for queries with complex objects
    • A. Y. Levy and D. Suciu. Deciding containment for queries with complex objects. PODS 1997.
    • PODS 1997
    • Levy, A.Y.1    Suciu, D.2
  • 17
    • 22444454724 scopus 로고    scopus 로고
    • An equational chase for path-conjunctive queries, constraints, and views
    • L. Popa and V. Tannen. An equational chase for path-conjunctive queries, constraints, and views. ICDT 1999.
    • ICDT 1999
    • Popa, L.1    Tannen, V.2
  • 18
    • 0025406342 scopus 로고    scopus 로고
    • Polynomial-time program transformations in deductive databases
    • Y. P. Saraiya. Polynomial-time program transformations in deductive databases. PODS 1990.
    • PODS 1990
    • Saraiya, Y.P.1


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