Determined: a system with novel techniques for XML query optimization and evaluation
Author:
Che Dunren,Hou Wen‐Chi
Abstract
PurposeEfficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. The purpose of this paper is to present Determined – a new prototype system designed for XML query processing and optimization from a system perspective. With Determined, a number of novel techniques for XML query processing are proposed and demonstrated.Design/methodology/approachThe methodology emphasizes on query pattern minimization, logic‐level optimization, and efficient query execution. Accordingly, three lines of investigation have been pursued in the context of Determined: XML tree pattern query (TPQ) minimization; logic‐level XML query optimization utilizing deterministic transformation; and specialized algorithms for fast XML query execution.FindingsDeveloped and demonstrated were: a runtime optimal and powerful algorithm for XML TPQ minimization; a unique logic‐level XML query optimization approach that solely pursues deterministic query transformation; and a group of specialized algorithms for XML query evaluation.Research limitations/implicationsThe experiments conducted so far are still preliminary. Further in‐depth, thorough experiments thus are expected, ideally carried out in the setting of a real‐world XML DBMS system.Practical implicationsThe techniques/approaches proposed can be adapted to real‐world XML database systems to enhance the performance of XML query processing.Originality/valueThe reported work integrates various novel techniques for XML query processing/optimization into a single system, and the findings are presented from a system perspective.
Subject
Computer Networks and Communications,Information Systems
Reference37 articles.
1. Al‐Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N. and Srivastava, D. (2002), “Structural joins: a primitive for efficient XML query pattern matching”, Proceedings of ICDE, p. 141. 2. Amer‐Yahia, S., Cho, S., Lakshmanan, L.V.S. and Srivastava, D. (2001), “Minimization of tree pattern queries”, Proceedings of SIGMOD Conference, pp. 497‐508. 3. Balmin, A., Eliaz, T., Hornibrook, J., Lim, L., Lohman, G.M., Simmen, D.E., Wang, M. and Zhang, C. (2006), “Cost‐based optimization in db2 XML”, IBM Systems Journal, Vol. 45 No. 2, pp. 299‐320. 4. Bruno, N., Koudas, N. and Srivastava, D. (2002), “Holistic twig joins: optimal XML pattern matching”, Technical Report, Columbia University, March. 5. Che, D. (2005), “Efficiently processing XML queries with support for negated containments”, International Journal of Computer & Information Science, Vol. 6 No. 2, pp. 119‐20.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|