Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Efficient processing of XPath queries using indexes |
| Author (s): | Madria, Sanjay Chen, Yan Passi, Kalpdrum Bhowmick, Sourav |
| Department/Lab Affiliations: | Computer Science |
| Keywords: | Query processing |
| Subject Terms: | Indexing. XML (Document markup language). |
| Issue Date: | 2007-03 |
| Publisher: | Elsevier |
| Citation: | Bhowmick, S., Chen, Y., Madria, S., and Passi, K., "Efficient Processing of XPath Queries Using Indexes." Information Systems, vol. 32, no. 1, (2007). |
| 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. |
| Type: | Article - Journal text |
| In Title: | Information Systems |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | Efficient processing of XPath queries using indexes |
| contributor.author | Madria, Sanjay |
| contributor.author | Chen, Yan |
| contributor.author | Passi, Kalpdrum |
| contributor.author | Bhowmick, Sourav |
| contributor.deptlab | Computer Science |
| subject | Query processing |
| subject.LCSH | Indexing. |
| subject.LCSH | XML (Document markup language). |
| date.issued | 2007-03 |
| publisher | Elsevier |
| identifier.citation | Bhowmick, S., Chen, Y., Madria, S., and Passi, K., "Efficient Processing of XPath Queries Using Indexes." Information Systems, vol. 32, no. 1, (2007). |
| identifier.pub.URI | |
| description.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. |
| type | Article - Journal |
| type.DCMIType | text |
| type.status | Final version |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights.URI | |
| relation.isPartOf | Information Systems |
| date.accessioned | 2007-04-11T17:00:48Z |
| date.available | 2008-04-30T18:48:17Z |
| identifier.persist.URI |