ON THE EVALUATION OF TREE PATTERN QUERIES

Yangjun Chen

Abstract

The evaluation of Xpath expressions can be handled as a tree embedding problem. In this paper, we propose two strategies on this issue. One is ordered-tree embedding based and the other is unordered-tree embedding based. For the ordered-tree embedding, our algorithm needs only O(|T| x |P|) time and (|T| x |P|) space, where |T| and |P| stands for the numbers of the nodes in the target tree T and the pattern tree P, respectively. For the unordered-tree embedding, we give an algorithm that needs (|T| x |P|)x 22k) time, where k is the largest out-degree of any node in P.

References

  1. C. Berge, Hypergraphs, Elsevier Science Publisher, Amsterdam, 1989.
  2. D.D. Chamberlin, J. Robie and D. Florescu, Quilt: An XML Query Language for Heterogeneous Data Sources, WebDB 2000.
  3. A. Deutsch, M. Fernadez, D. Florescu, A Levy, and D. Suciu, XML-QL: A Query Language for XML, Technical report, World Wide Web Consortium, 1989, http://www.w3.org/TR/Note-xml-ql.
  4. D. Florescu and D. Kossman, Storing and Querying XML Data using an RDBMS. IEEE Data Engineering Bulletin, 22(3), 1999.
  5. http://www.w3.org/TR/xpath.
  6. D.E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1969.
  7. P. Ramanan, Efficient Algorithms for Minimizing Tree Pattern Queries, ACM SIGMOD 2002, June 2002, Madison, Wisconsin, USA.
  8. J. Robie, J. Lapp, and D. Schach, XML Query Language (XQL), 1998. http://www.w3.org/TandS/ QL/QL98/pp/ xql.html.
  9. World Wide Web Consortium, Extensible Markup Language (XML) 1.0. http//www.w3.org/TR/1998/ REC-xml/ 19980210, Febuary 1998.
  10. World Wide Web Consortium, Extensible Style Language (XML) Working Draft, Dec. 1998. http//www.w3.org/TR/ 1998/WD-xsl-19981216.
  11. G. Gottlob, C. Koch, and R. Pichler, Efficient Algorithms for Processing XPath Queries, ACM Transaction on Database Systems, Vol. 30, No. 2, June 2005, pp. 444- 491.
  12. G. Gottlob, C. Koch, and K.U. Schulz, Conjunctive Queries over Trees, in Proc. PODS 2004, June 2004, Paris, France, pp. 189-200.
  13. H. Wang, S. Park, W. Fan, and P.S. Yu, ViST: A Dynamic Index Method for Querying XML Data by Tree Structures, SIGMOD Int. Conf. on Management of Data, San Diego, CA., June 2003.
  14. H. Wang and X. Meng, On the Sequencing of Tree Structures for XML Indexing, in Proc. Conf. Data Engineering, Tokyo, Japan, April, 2005, pp. 372-385.
  15. C. Zhang, J. Naughton, D. DeWitt, Q. Luo and G. Lohman, “On Supporting Containment Queries in Relational Database Management Systems, in Proc. of ACM SIGMOD Intl. Conf. on Management of Data, California, USA, 2001.
Download


Paper Citation


in Harvard Style

Chen Y. (2006). ON THE EVALUATION OF TREE PATTERN QUERIES . In Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-972-8865-69-6, pages 79-85. DOI: 10.5220/0001308700790085


in Bibtex Style

@conference{icsoft06,
author={Yangjun Chen},
title={ON THE EVALUATION OF TREE PATTERN QUERIES},
booktitle={Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2006},
pages={79-85},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001308700790085},
isbn={978-972-8865-69-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - ON THE EVALUATION OF TREE PATTERN QUERIES
SN - 978-972-8865-69-6
AU - Chen Y.
PY - 2006
SP - 79
EP - 85
DO - 10.5220/0001308700790085