Relational Index Support for XPath Axes

In this paper, we designed efficient indexing structure for XML documents so that each basic XPath axis step is supported. The indexing structure is built on top of the B+ -tree which is available in practically all commercial relational database systems. For most of the basic axis steps, we are able to derive theoretical worst case execution time bounds. We also perform experimental evaluation to substantiate those bounds.

• Type: Conference
• Year: 2005
• Where: XSYM
• Authors: Leo Yuen, Chung Keung Poon
• Keywords: Axis Steps, Database, Indexing Structure, XPath Axis Step, XSYM 2005