Paper Title:
Efficient Processing XPath Queries by Compressed XML Query Tree Based on Structural Index
  Abstract

As XPath is the core of most XML query languages, the efficiency of processing XPath expression has been a main part of the cost in XML queries. However, most existing XPath processing algorithms, which don't take index structure into account, spend lots of costs on spaces and time. This paper proposes an efficient XPath query processing mechanism based on structural index that makes full use of XML structural index to quickly retrieve XML data. Coming together with the mechanism, the Compressed XPath Query Tree based on structural index is proposed, which significantly reduces many join operations. Then query algorithms are used to deal with all the structural relationship using our mechanism. Finally, experiments will run the algorithm on real XML datasets and query workloads to report the performance of our mechanism and show the efficiency compared with other mechanisms.

  Info
Periodical
Advanced Materials Research (Volumes 211-212)
Edited by
Ran Chen
Pages
726-730
DOI
10.4028/www.scientific.net/AMR.211-212.726
Citation
H. W. Zhang, X. Y. Hu, Y. Zhang, Y. L. Wen, X. J. Yuan, "Efficient Processing XPath Queries by Compressed XML Query Tree Based on Structural Index", Advanced Materials Research, Vols. 211-212, pp. 726-730, 2011
Online since
February 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Gang Zhu Qiao, Jian Chao Zeng
Chapter 12: Computer-Aided Design, Manufacturing and Engineering
Abstract:The path loss exponent shows the effect of space environment on the RF signals in wireless communication model. In most RSSI based location...
4530
Authors: Jiun Huei Ho, Hong Chi Shih, Bin Yih Liao, Jeng Shyang Pan
Chapter 7: Sensors, Mechatronics and Robotics
Abstract:In this paper, a grade diffusion algorithm is proposed to solve the sensor node’s transmission problem and the sensor node’s loading problem...
2064