메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 121-132

Rewriting XPath queries using materialized views

Author keywords

[No Author keywords available]

Indexed keywords

MINIMAL REWRITINGS; POLYNOMIAL TIME; QUERY OPTIMIZATION; WILDCARDS;

EID: 33745633621     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (95)

References (32)
  • 3
    • 85136081200 scopus 로고    scopus 로고
    • A framework for using materialized XPath views in XML query processing
    • A. Balmin, F. Ozean, K. Beyer, R. Cochrane and H. Pirahesh. A Framework for Using Materialized XPath Views in XML Query Processing, In VLDB 2004: 60-71.
    • VLDB 2004 , pp. 60-71
    • Balmin, A.1    Ozean, F.2    Beyer, K.3    Cochrane, R.4    Pirahesh, H.5
  • 4
    • 35248868248 scopus 로고    scopus 로고
    • Structural properties of XPath fragments
    • M. Benedikt, W. Fan, and G. M. Kuper. Structural Properties of XPath Fragments, In ICDT 2003: 79-95.
    • ICDT 2003 , pp. 79-95
    • Benedikt, M.1    Fan, W.2    Kuper, G.M.3
  • 6
    • 0036367943 scopus 로고    scopus 로고
    • Holistic twig joins: Optimal XML pattern matching
    • N. Bruno, N. Koudas, and D. Srivastava. Holistic Twig Joins: Optimal XML Pattern Matching, In SIGMOD 2002: 310-321.
    • SIGMOD 2002 , pp. 310-321
    • Bruno, N.1    Koudas, N.2    Srivastava, D.3
  • 8
    • 84958776545 scopus 로고    scopus 로고
    • Optimal implementations of conjunctive queries in relational data bases
    • A. K. Chandra and P. M. Merlin. Optimal Implementations of Conjunctive Queries in Relational Data Bases, In STOC 1977.
    • STOC 1977
    • Chandra, A.K.1    Merlin, P.M.2
  • 9
    • 1542328585 scopus 로고    scopus 로고
    • ACE-XQ: A cache-aware XQuery answering System
    • Li Chen and Elke A. Rundensteiner. ACE-XQ: A Cache-aware XQuery Answering System, In WebDB 2002: 31-36.
    • WebDB 2002 , pp. 31-36
    • Chen, L.1    Rundensteiner, E.A.2
  • 10
    • 3142683855 scopus 로고    scopus 로고
    • BLAS: An efficient XPath processing system
    • Y. Chen, Y. Zheng and Susan B. Davidson. BLAS: An Efficient XPath Processing System, In SIGMOD 2004: 47-58.
    • SIGMOD 2004 , pp. 47-58
    • Chen, Y.1    Zheng, Y.2    Davidson, S.B.3
  • 13
    • 0003267564 scopus 로고    scopus 로고
    • Containment and integrity constraints for XPath
    • A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath, In KRDB 2001.
    • KRDB 2001
    • Deutsch, A.1    Tannen, V.2
  • 14
    • 35248867325 scopus 로고    scopus 로고
    • Reformulation of XML queries and constraints
    • A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints, In ICDT 2003: 225-241.
    • ICDT 2003 , pp. 225-241
    • Deutsch, A.1    Tannen, V.2
  • 16
    • 1142275475 scopus 로고    scopus 로고
    • The complexity of XPath query evaluation
    • G. Gottlob, C. Koch and R. Pichelar. The Complexity of XPath Query Evaluation, In PODS 2003: 179-190.
    • PODS 2003 , pp. 179-190
    • Gottlob, G.1    Koch, C.2    Pichelar, R.3
  • 17
    • 0344065577 scopus 로고    scopus 로고
    • XPath query evaluation: Improving time and space efficiency
    • G. Gottlob, C. Koch and R. Pichelar. XPath Query Evaluation: Improving Time and Space Efficiency, In ICDE 2003: 379-390.
    • ICDE 2003 , pp. 379-390
    • Gottlob, G.1    Koch, C.2    Pichelar, R.3
  • 19
    • 1142275489 scopus 로고    scopus 로고
    • Query containment and rewriting using views for regular path queries under constraints
    • G. Grahne and A. Thomo. Query Containment and Rewriting Using Views for Regular Path Queries under Constraints, In PODS 2003: 111-122.
    • PODS 2003 , pp. 111-122
    • Grahne, G.1    Thomo, A.2
  • 21
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • A. Y. Halevy. Answering Queries Using Views: A Survey, In VLDB Journal 2001: Volume 10, Issue 4, Pages 270-294.
    • VLDB Journal 2001 , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.Y.1
  • 22
    • 34948903143 scopus 로고    scopus 로고
    • On testing satisfiability of tree pattern queries
    • Laks V. S. Lakshmanan, G. Ramesh, H. Wang, and Z. (Jessica) Zhao. On Testing Satisfiability of Tree Pattern Queries, In VLDB 2004: 120-131.
    • VLDB 2004 , pp. 120-131
    • Lakshmanan, L.V.S.1    Ramesh, G.2    Wang, H.3    Zhao, Z.4
  • 23
    • 0036038432 scopus 로고    scopus 로고
    • Containment and equivalence for an XPath fragment
    • G. Miklau and D. Suciu. Containment and Equivalence for an XPath Fragment, In PODS 2002: 65-76.
    • PODS 2002 , pp. 65-76
    • Miklau, G.1    Suciu, D.2
  • 24
    • 4243187063 scopus 로고    scopus 로고
    • Containment and equivalence for an XPath fragment
    • G. Miklau and D. Suciu. Containment and Equivalence for an XPath Fragment, In Journal of the ACM 2004: Vol. 51, No. 1.
    • Journal of the ACM 2004 , vol.51 , Issue.1
    • Miklau, G.1    Suciu, D.2
  • 25
    • 80052793558 scopus 로고    scopus 로고
    • Index structures for path expressions
    • T. Milo and D. Suciu. Index Structures for Path Expressions, In ICDT 1999: 277-295.
    • ICDT 1999 , pp. 277-295
    • Milo, T.1    Suciu, D.2
  • 26
    • 35248872431 scopus 로고    scopus 로고
    • XPath containment in the presence of disjunction, DTDs, and variables
    • F. Neven and T. Schwentick. XPath Containment in the Presence of Disjunction, DTDs, and Variables, In ICDT 2003: 315-329
    • ICDT 2003 , pp. 315-329
    • Neven, F.1    Schwentick, T.2
  • 27
  • 28
    • 0036367425 scopus 로고    scopus 로고
    • Efficient algorithms for minimizing tree pattern queries
    • P. Ramanan. Efficient Algorithms for Minimizing Tree Pattern Queries, In SIGMOD 2002: 299-309.
    • SIGMOD 2002 , pp. 299-309
    • Ramanan, P.1
  • 29
    • 1142267353 scopus 로고    scopus 로고
    • ViST: A dynamic index method for querying XML data by tree structures
    • H. Wang, S. Park, W. Fan, and P.S. Yu. ViST: A Dynamic Index Method for Querying XML Data by Tree Structures, In SIGMOD 2003: 110-121.
    • SIGMOD 2003 , pp. 110-121
    • Wang, H.1    Park, S.2    Fan, W.3    Yu, P.S.4
  • 30
    • 33244475752 scopus 로고    scopus 로고
    • Minimizing simple XPath expressions
    • P. T. Wood. Minimizing Simple XPath Expressions, In WebDB 2001: 13-18.
    • WebDB 2001 , pp. 13-18
    • Wood, P.T.1
  • 31
    • 35248865226 scopus 로고    scopus 로고
    • Containment for XPath fragments under DTD constraints
    • P. T. Wood. Containment for XPath Fragments under DTD Constraints, In ICDT 2003: 300-314.
    • ICDT 2003 , pp. 300-314
    • Wood, P.T.1
  • 32
    • 85012146515 scopus 로고    scopus 로고
    • Efficient mining of XML query patterns for caching
    • L. H. Yang, M. Lee and W. Hsu Efficient Mining of XML Query Patterns for Caching, In VLDB 2003: 69-80.
    • VLDB 2003 , pp. 69-80
    • Yang, L.H.1    Lee, M.2    Hsu, W.3


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