Efficient processing of XPath queries using indexes

  • Authors:

  • Sanjay Madria;Yan Chen;Kalpdrum Passi;Sourav Bhowmick

  • Affiliations:

  • Department of Computer Science, University of Missouri-Rolla, Rolla, MO 65409, USA;Department of Computer Science, University of Missouri-Rolla, Rolla, MO 65409, USA;Department of Math & CS, Laurentian University, Sudbury, Ont., Canada;School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore

  • Venue:
  • Information Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semi-structured data models. Most of the semi-structured models use tree-like structures and query languages (XPath, XQuery, etc.) which make use of regular path expressions to optimize the query processing. In this paper, we propose two algorithms called Entry-point algorithm (EPA) and Two-point Entry algorithms that exploit different types of indices to efficiently process XPath queries. We discuss and compare two approaches namely, Root-first and Bottom-first in implementing the EPA. We present the experimental results of the algorithms using XML benchmark queries and data and compare the results with that of traditional methods of query processing with and without the use of indexes, and ToXin indexing approach. Our algorithms show improved performance results than the traditional methods and Toxin indexing approach.