p145-wang - Efficient Processing of XML Path Queries Using...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Efficient Processing of XML Path Queries Using the Disk-based F&B Index * Wei Wang 1 Hongzhi Wang 1 , 3 Hongjun Lu 2 Haifeng Jiang 4 Xuemin Lin 1 Jianzhong Li 3 1 University of New South Wales, Australia, { weiw,lxue } @cse.unsw.edu.au 2 Hong Kong University of Science and Technology, China, [email protected] 3 Harbin Institute of Technology, China, { wangzh,lijzh } @hit.edu.cn 4 IBM Almaden Research Center, USA, [email protected] Abstract With the proliferation of XML data and appli- cations on the Internet, efficient XML query processing techniques are in great demand. Answering queries using XML indexes is a natural approach. A number of XML in- dexes have been proposed in the literature; among them, F&B Index is one powerful in- dex as it is the smallest index that answers all twig queries. However, an F&B Index suffers from the following two problems: (1) it was originally proposed as a memory-based index while its size is usually large in practice and (2) answering queries using an F&B Index is not fully optimized. These problems limit the benefits and even applications of F&B Indexes in practice. In this paper, we propose a highly optimized disk organization method for an F&B In- dex; the result is a disk-based F&B Index with good clustering properties. In addition, novel query processing algorithms exploiting the physical organization of the disk-based F&B Indexes are proposed. Experimental re- sults verify that our disk-based F&B Index can scale up for large data size with good query performance compared with state-of- the-art XML query processing algorithms. * This work was partially supported by UNSW FPG Grant (PS06863), UNSW Goldstar Grant (PS07248), and ARC Dis- covery Grant (DP0346004). Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment. Proceedings of the 31st VLDB Conference, Trondheim, Norway, 2005 1 Introduction XML has become the de facto standard for informa- tion representation and exchange over the Internet. An XML document contains hierarchically nested el- ements. Therefore, it can be naturally modeled as a tree, where elements are modeled as nodes in the tree and direct nesting relationships between elements are modeled as edges between nodes [22]. Standard XML query languages, e.g., XPath and XQuery, can retrieve a subset of the XML data nodes satisfying cer- tain path constraints. For example, the XPath query //book [ appendix ] //figure will retrieve all figure nodes that appear under books that have appendix sections....
View Full Document

{[ snackBarMessage ]}

Page1 / 12

p145-wang - Efficient Processing of XML Path Queries Using...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online