ON THE TREE INCLUSION AND QUERY EVALUATION IN DOCUMENT DATABASES

Yangjun Chen, Yibin Chen

Abstract

In this paper, a method to evaluate queries in document databases is proposed. The main idea of this method is a new top-down algorithm for tree-inclusion. In fact, a path-oriented query can be considered as a pattern tree while an XML document can be considered as a target tree. To evaluate a query S against a document T, we will check whether S is included in T. For a query S, our algorithm needs O(|T|xheight(S)) time and no extra space to check the containment of S in document T, where |T| stands for the number of nodes in T and height(S) for the height of S. Especially, the signature technique can be integrated into a top-down tree inclusion to cut off useless subtree checkings as early as possible.

References

  1. W. Chen. More efficient algorithm for ordered tree inclusion. Journal of Algorithms, 26:370-385, 1998.
  2. R. Cole, R. Hariharan, P. Indyk. Tree pattern matching and subset matching in deterministic O(n log3 m) time. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, 245-254.
  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. C. Faloutsos, “Signature Files,” in: Information Retrieval: Data Structures & Algorithms, edited by W.B. Frakes and R. Baeza-Yates, Prentice Hall, New Jersey, 1992, pp. 44-65.
  5. GMD. Gmd-ipsi xql.engine. http://xml.dramstadt.gmd.de/xql/ index.html, August 1999.
  6. 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.
  7. Pekka Kilpelainen and Heikki Mannila. Ordered and unordered tree inclusion. SIAM Journal of Computing, 24:340-356, 1995.
  8. H. Mannila and K.-J. Raiha, On Query Languages for the p-string data model, in “Information Modelling and Knowledge Bases” (H. Kangassalo, S. Ohsuga, and H. Jaakola, Eds.), pp. 469-482, IOS Press, Amsterdam, 1990.
  9. Thorsten Richter. A new algorithm for the ordered tree inclusion problem. In Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM), in Lecture Notes of Computer Science (LNCS), volume 1264, pages 150-166. Springer, 1997.
  10. J. Robie, J. Lapp, and D. Schach, XML Query Language (XQL), 1998. http://www.w3.org/TandS/QL/QL98/pp/ xql.html.
  11. J. Shanmugasundaram, K. Tufte, G. He, C. Zhang, D. DeWitt, J. Naughton, “Relational Databases for Querying XML Documents: Limitations and oppotunities,” Proc. VLDB, Edinburgh, Scotland, 1999.
  12. World Wide Web Consortium, Extensible Markup Language (XML) 1.0. http//www.w3.org/TR/1998/REC-xml/19980210, Febuary 1998.
  13. World Wide Web Consortium, Extensible Style Language (XML) Working Draft, Dec. 1998. http//www.w3.org/TR/ 1998/WD-xsl-19981216.
Download


Paper Citation


in Harvard Style

Chen Y. and Chen Y. (2005). ON THE TREE INCLUSION AND QUERY EVALUATION IN DOCUMENT DATABASES . In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-19-8, pages 182-190. DOI: 10.5220/0002517201820190


in Bibtex Style

@conference{iceis05,
author={Yangjun Chen and Yibin Chen},
title={ON THE TREE INCLUSION AND QUERY EVALUATION IN DOCUMENT DATABASES},
booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2005},
pages={182-190},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002517201820190},
isbn={972-8865-19-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - ON THE TREE INCLUSION AND QUERY EVALUATION IN DOCUMENT DATABASES
SN - 972-8865-19-8
AU - Chen Y.
AU - Chen Y.
PY - 2005
SP - 182
EP - 190
DO - 10.5220/0002517201820190