Return
Efficient processing of XPath queries using indexes
DOI:10.1016/j.is.2005.06.003.png)
Abstract
En 中文
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. (C) 2005 Elsevier B.V. All rights reserved.
Keywords:
XML
indexing
query processing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
Organization
No organization information available
Cited Papers
Cell lineage-specific genome-wide DNA methylation analysis of patients with paediatric-onset systemic lupus erythematosus
Epigenetics
IF0
Framing the Brahmaputra River hydropower development: different concerns in riparian and international media reporting
Water Policy
IF0
Analysis and Optimization of a Novel Hexagonal Waveguide Concentrator for Solar Thermal Applications
Energies
IF0

