Full-Text and Structural Indexing of XML Documents on B+-Tree

Toshiyuki SHIMIZU
Masatoshi YOSHIKAWA

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E89-D    No.1    pp.237-247
Publication Date: 2006/01/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.1.237
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Contents Technology and Web Information Systems
Keyword: 
XML query processing,  full-text search,  B+-tree,  node labeling scheme,  

Full Text: PDF(573.4KB)>>
Buy this Article


Summary: 
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are growing demands for a full-text search for XML documents. In this paper, we propose XICS (XML Indices for Content and Structural search), which aims at high-speed processing of both full-text and structural queries in XML documents. An important design principle of our indices is the use of a B+-tree. To represent the structural information of XML trees, each node in the XML tree is labeled with an identifier. The identifier contains an integer number representing the path information from the root node. XICS consist of two types of indices, the COB-tree (COntent B+-tree) and the STB-tree (STructure B+-tree). The search keys of the COB-tree are a pair of text fragments in the XML document and the identifiers of the leaf nodes that contain the text, whereas the search keys of the STB-tree are the node identifiers. By using a node identifier in the search keys, we can retrieve only the entries that match the path information in the query. The STB-tree can filter nodes using structural conditions in queries, while the COB-tree can filter nodes using text conditions. We have implemented a COB-tree and an STB-tree using GiST and examined index size and query processing time. Our experimental results show the efficiency of XICS in query processing.

open access publishing via