Efficient Processing of XPath Queries Using Indexes

  • Authors:
  • Yan Chen;Sanjay Kumar Madria;Kalpdrum Passi;Sourav S. Bhowmick

  • Affiliations:
  • -;-;-;-

  • Venue:
  • DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A number of query languages have been proposed in recent times for processing queries on XML and semistructured data. All these query languages make use of regular path expressions to query XML data. To optimize the processing of query paths a number of indexing schemes have also been proposed recently. XPath provides the basis for processing queries on XML data in the form of regular path expressions. In this paper, we propose two algorithms called Entry-point algorithm and Rest-tree algorithm that exploit different types of indexes, which we have defined to efficiently process XPath queries. We also discuss and compare two variations in implementing these algorithms; Root-first and Bottom-first.