loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
24th British National Conference on Databases (BNCOD'07)
XML Query Optimization Using the Binding Hash Method
University of Glasgow, UK
July 03-July 05
ISBN: 0-7695-2912-7
Michael J. Brant, University of Cincinnati, USA
Karen C. Davis, University of Cincinnati, USA
XML query processing involves searching an XML document and returning results that satisfy a query while choosing the best method for the particular query and document. In this paper we develop a method called Binding Hash (BH) that performs a subset of XML query operations focusing on structural join. The BH method answers Xpath expressions directly or generates witness trees that can be used as intermediate results in a query processor. It uses pointer-based traversal and index-based access simultaneously to speed-up structural joins. A performance study indicates that the BH method performs better than existing competitive techniques for queries that are deeply nested and non-bushy. The BH method can be integrated into a larger system to be selected for an execution plan when it achieves the best performance.
Citation:
Michael J. Brant, Karen C. Davis, "XML Query Optimization Using the Binding Hash Method," bncod, pp.140-150, 24th British National Conference on Databases (BNCOD'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.