Sciweavers

Share
IS
2007

Efficient processing of XPath queries using indexes

11 years 9 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured 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 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 Entry-point algorithm. 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.
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IS
Authors Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sourav S. Bhowmick
Comments (0)
books