SIOUX: an efficient index for processing structural XQueries

  • Authors:
  • Georges Gardarin;Laurent Yeh

  • Affiliations:
  • PRiSM Laboratory, University of Versailles, Versailles, France;PRiSM Laboratory, University of Versailles, Versailles, France

  • Venue:
  • DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML documents. In this paper we first survey some of them and suggest a classification scheme. It appears that most techniques are indexing on paths in XML documents and maintain a separated index on values. In some cases, the two indexes are merged and/or tags are encoded. We propose a new method that indexes XML documents on ordered trees, i.e., two documents are in the same equivalence class is they have the same tree structure, with identical elements in order. We develop a simple benchmark to compare our method with two well-known European products. The results show that indexing on full trees leads to smaller index size and achieves 1 to 10 times better query performance in comparison with classical industrial methods that are path-based.