Subscribe Now Subscribe Today
Science Alert
FOLLOW US:     Facebook     Twitter
Curve Top
Journal of Applied Sciences
  Year: 2007 | Volume: 7 | Issue: 19 | Page No.: 2736-2743
DOI: 10.3923/jas.2007.2736.2743
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
Path Query Processing in Large-Scale XML Databases
Su-Cheng Haw and G.S.V. Radha Krishna Rao

With the ever-increasing popularity of XML (Extensible Markup Language) as data representation and exchange on the Internet, querying XML data has become an important issue to be address. In Native XML Database (NXD), XML documents are usually modeled as trees and XML queries are typically specified in path expression. In path expression, the primitive structural relationships are Parent-Child (P-C) and Ancestor-Descendant (A-D). Thus, finding all occurrences of these relationships is crucial for XML query processing. Current methods for query processing on NXD usually employ either sequential traversing of tree-structured model or a decomposition-matching-merging processes. We adopt the later approach and propose a novel hybrid query optimization technique, INLAB comprising both indexing and labeling technologies. Furthermore, we also propose several algorithms to create INLAB encoding and analyze the path query. We implemented our technique and present performance results over several benchmarking datasets, which prove the viability of our approach.
PDF References Citation Report Citation
  •    A Memory Path Index for DOM Tree Queries
How to cite this article:

Su-Cheng Haw and G.S.V. Radha Krishna Rao, 2007. Path Query Processing in Large-Scale XML Databases. Journal of Applied Sciences, 7: 2736-2743.

DOI: 10.3923/jas.2007.2736.2743








Curve Bottom