메뉴 건너뛰기




Volumn , Issue , 2007, Pages 246-255

Put a tree pattern in your Algebra

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; MATHEMATICAL OPERATORS; XML;

EID: 34548717592     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367870     Document Type: Conference Paper
Times cited : (28)

References (28)
  • 3
    • 28444470448 scopus 로고    scopus 로고
    • Full-fledged algebraic xpath processing in natix
    • M. Brantner, S. Helmer, C.-C. Kanne, and G. Moerkotte. Full-fledged algebraic xpath processing in natix. In ICDE, pages 705-716, 2005.
    • (2005) ICDE , pp. 705-716
    • Brantner, M.1    Helmer, S.2    Kanne, C.-C.3    Moerkotte, G.4
  • 4
    • 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, pages 310-321, 2002.
    • (2002) SIGMOD , pp. 310-321
    • Bruno, N.1    Koudas, N.2    Srivastava, D.3
  • 5
    • 34548803064 scopus 로고    scopus 로고
    • Prefix path streaming: A new clustering method for optimal holistic XML twig pattern matching
    • T. Chen, T. W. Ling, and C. Y. Chan. Prefix path streaming: A new clustering method for optimal holistic XML twig pattern matching. In DEXA, pages 801-810, 2004.
    • (2004) DEXA , pp. 801-810
    • Chen, T.1    Ling, T.W.2    Chan, C.Y.3
  • 6
    • 85012113073 scopus 로고    scopus 로고
    • From, tree patterns to generalized tree patterns: On efficient evaluation of XQuery
    • Z. Chen, H. V. Jagadish, L. V. S. Lakshmanan, and S. Paparizos. From, tree patterns to generalized tree patterns: On efficient evaluation of XQuery. In VLDB, pages 237-248, 2003.
    • (2003) VLDB , pp. 237-248
    • Chen, Z.1    Jagadish, H.V.2    Lakshmanan, L.V.S.3    Paparizos, S.4
  • 7
  • 8
    • 18744382587 scopus 로고    scopus 로고
    • On the optimality of holistic algorithms for twig queries
    • B. Choi, M. Mahoui, and. D. Wood. On the optimality of holistic algorithms for twig queries. In DEXA, pages 28-37, 2003.
    • (2003) DEXA , pp. 28-37
    • Choi, B.1    Mahoui, M.2    Wood, D.3
  • 9
    • 0036366148 scopus 로고    scopus 로고
    • Apex: An adaptive path index for xml data
    • C.-W. Chung, J.-K. Min, and. K. Shim. Apex: an adaptive path index for xml data. In SIGMOD, pages 121-132, 2002.
    • (2002) SIGMOD , pp. 121-132
    • Chung, C.-W.1    Min, J.-K.2    Shim, K.3
  • 10
    • 9744246962 scopus 로고    scopus 로고
    • Types for path correctness of xml queries
    • D. Colazzo, G. Ghelli, P. Manghi, and C Sartiani. Types for path correctness of xml queries. In ICFP, pages 126-137, 2004.
    • (2004) ICFP , pp. 126-137
    • Colazzo, D.1    Ghelli, G.2    Manghi, P.3    Sartiani, C.4
  • 11
    • 84858691734 scopus 로고    scopus 로고
    • The NEXT logical, framework for XQuery
    • A. Deutsch, Y. Papakonstantinou, and Y. Xu. The NEXT logical, framework for XQuery. In VLDB, pages 168-179, 2004.
    • (2004) VLDB , pp. 168-179
    • Deutsch, A.1    Papakonstantinou, Y.2    Xu, Y.3
  • 15
    • 33745782346 scopus 로고    scopus 로고
    • Optimizing cursor movement in holistic twig joins
    • M. Fontoura, V. Josifovski, E. Shekita, and B. Yang. Optimizing cursor movement in holistic twig joins. In CIKM, pages 784-791, 2005.
    • (2005) CIKM , pp. 784-791
    • Fontoura, M.1    Josifovski, V.2    Shekita, E.3    Yang, B.4
  • 16
    • 26844477057 scopus 로고    scopus 로고
    • Efficient algorithms for processing XPath queries
    • G. Gottlob, C Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, pages 95-106, 2002.
    • (2002) VLDB , pp. 95-106
    • Gottlob, G.1    Koch, C.2    Pichler, R.3
  • 17
    • 3042694344 scopus 로고    scopus 로고
    • Tree awareness for relational DBMS kernels: Staircase join
    • T. Grust and M. V Keulen. Tree awareness for relational DBMS kernels: Staircase join. In Intelligent Search on XML Data, pages 231-245, 2003.
    • (2003) Intelligent Search on XML Data , pp. 231-245
    • Grust, T.1    Keulen, M.V.2
  • 18
  • 19
    • 34548772965 scopus 로고    scopus 로고
    • How to recognize different kinds of tree patterns from, quite a long way away
    • 13-2006, Univ. of Antwerp and IBM Research
    • J. Hidders, P. Michiels, J. Simeon, and. R. Vercammen. How to recognize different kinds of tree patterns from, quite a long way away. Technical Report TR UA 13-2006, Univ. of Antwerp and IBM Research, 2006. http ://www.adrem.ua.ac.be.
    • (2006) Technical Report TR UA
    • Hidders, J.1    Michiels, P.2    Simeon, J.3    Vercammen, R.4
  • 20
    • 3142720559 scopus 로고    scopus 로고
    • Efficient processing of twig queries with or-predicates
    • H. Jiang, H. Lu, and W. Wang. Efficient processing of twig queries with or-predicates. In SIGMOD, pages 59-70, 2004.
    • (2004) SIGMOD , pp. 59-70
    • Jiang, H.1    Lu, H.2    Wang, W.3
  • 21
    • 85129037317 scopus 로고    scopus 로고
    • Holistic twig joins on indexed. XML documents
    • H. Jiang, W Wang, H. Lu, and J. X. Yu. Holistic twig joins on indexed. XML documents. In VLDB, pages 273284, 2003.
    • (2003) VLDB , pp. 273284
    • Jiang, H.1    Wang, W.2    Lu, H.3    Yu, J.X.4
  • 22
    • 0037531629 scopus 로고    scopus 로고
    • Indexing and querying xml data for regular path expressions
    • Q. Li and B. Moon. Indexing and querying xml data for regular path expressions. In VLDB, pages 361-370, 2001.
    • (2001) VLDB , pp. 361-370
    • Li, Q.1    Moon, B.2
  • 23
    • 33645017291 scopus 로고    scopus 로고
    • From, region encoding to extended Dewey: On efficient processing of XML twig pattern matching
    • J. Lu, T. W. Ling, C Y. Chan, and T. Chen. From, region encoding to extended Dewey: On efficient processing of XML twig pattern matching. In VLDB, pages 193-204, 2005.
    • (2005) VLDB , pp. 193-204
    • Lu, J.1    Ling, T.W.2    Chan, C.Y.3    Chen, T.4
  • 24
    • 26844439601 scopus 로고    scopus 로고
    • Efficient processing of ordered XML twig pattern
    • J. Lu, T. W. Ling, T. Yu, C. Li, and W Ni. Efficient processing of ordered XML twig pattern. In DEXA, pages 300-309, 2005.
    • (2005) DEXA , pp. 300-309
    • Lu, J.1    Ling, T.W.2    Yu, T.3    Li, C.4    Ni, W.5
  • 25
    • 2442450349 scopus 로고    scopus 로고
    • Nested queries and quantifiers in an ordered context
    • N. May, S. Helmer, and. G. Moerkotte. Nested queries and quantifiers in an ordered context. In ICDE, pages 239-250, 2004.
    • (2004) ICDE , pp. 239-250
    • May, N.1    Helmer, S.2    Moerkotte, G.3
  • 26
    • 33750087376 scopus 로고    scopus 로고
    • Put a tree pattern in your tuple algebra
    • 092006, Univ. of Antwerp and IBM Research, Belgium
    • P. Michiels, G. A. Mihǎilǎe;, and J. Siméon. Put a tree pattern in your tuple algebra. Technical Report TR UA 092006, Univ. of Antwerp and IBM Research, Belgium, 2006. http ://www.adrem.ua.ac.be.
    • (2006) Technical Report TR UA
    • Michiels, P.1    Mihǎilǎe, G.A.2    Siméon, J.3
  • 27
    • 3142783656 scopus 로고    scopus 로고
    • Tree logical classes for efficient evaluation of XQuery
    • S. Paparizos, Y. Wu, L. V. S. Lakshmanan, and H. V. Jagadish. Tree logical classes for efficient evaluation of XQuery. In SIGMOD, pages 71-82, 2004.
    • (2004) SIGMOD , pp. 71-82
    • Paparizos, S.1    Wu, Y.2    Lakshmanan, L.V.S.3    Jagadish, H.V.4
  • 28
    • 33749615279 scopus 로고    scopus 로고
    • A complete and efficient algebraic compiler for xquery
    • C. Re, J. Simeon, and. M. F. Fernández. A complete and efficient algebraic compiler for xquery. In ICDE, page 14, 2006.
    • (2006) ICDE , pp. 14
    • Re, C.1    Simeon, J.2    Fernández, M.F.3


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