Full-text and structural XML indexing on B+-tree

Toshiyuki Shimizu, Masatoshi Yoshikawa

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)


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), novel indices built on a B+-tree, for the fast processing of queries that involve structural and full-text searches of XML documents. 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. Our experimental results show the efficiency of XICS in query processing.

Original languageEnglish
Pages (from-to)451-460
Number of pages10
JournalLecture Notes in Computer Science
Publication statusPublished - 2005
Externally publishedYes
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: Aug 22 2005Aug 26 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Full-text and structural XML indexing on B+-tree'. Together they form a unique fingerprint.

Cite this