Su-Cheng Haw
Faculty of Information Technology, Multimedia University, 63100 Cyberjaya, Malaysia
G.S.V. Radha Krishna Rao
Faculty of Information Technology, Multimedia University, 63100 Cyberjaya, Malaysia
ABSTRACT
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
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
URL: https://scialert.net/abstract/?doi=jas.2007.2736.2743
DOI: 10.3923/jas.2007.2736.2743
URL: https://scialert.net/abstract/?doi=jas.2007.2736.2743
REFERENCES
- Chung, CW., J.K. Min and K. Shim, 2002. APEX: An adaptive path index for XML data. Procedings of the ACM SIGMOD International Conference on Management of Data, June 3-6, 2002, Madison, Wisconsin, pp: 121-132.
Direct Link - Green, T.J., G. Miklau, M. Onizuka and D. Suciu, 2003. Processing XML streams with deterministic automata. Lecture Notes Comput. Sci., 2572: 173-189.
Direct Link - Haw, S.C. and G.S.V.R.K. Rao, 2005. Query optimization techniques for XML databases. Int. J. Inform. Technol., 2: 97-104.
Direct Link - Kim, J., S.H. Lee and H-J. Kim, 2004. Efficient structural joins with clusters extents. Inform. Proc. Lett., 91: 69-75.
Direct Link - Kiss, A. and V.L. Anh, 2005. Combining tree structure indexes with structural indexes in query evaluation on XML data. Lecture Notes Comput. Sci., 3631: 254-267.
Direct Link - Lian, W., N. Mamoulist, David W.L. Cheung and S.M. Yiu, 2005. Indexing useful structural patterns for XML query processing. IEEE Trans. Knowledge Data Eng., 17: 997-1009.
Direct Link - Lu, J. and T.W. Ling, 2004. Labeling and querying dynamic XML trees. Lecture Notes Comput. Sci., 3007: 180-189.
Direct Link - Wu, Y., J.M. Patel and H. V.Jagadish, 2003. Structural join order selection for XML query optimization. Proceedings of the International Conference on Data Engineering, March 5-8, 2003, Michigan University, MI, USA., pp: 443-454.
Direct Link - Yan, L. and Z. Liang, 2005. Multiple schema based XML indexing. Lecture Notes Comput. Sci., 3619: 891-900.
Direct Link - Zhang, C., J. Naughton, D. DeWitty, Q. Luo and G. Lohman, 2001. On supporting containment queries in relational database management systems. Proc. ACM SIGMOD, 30: 425-436.
Direct Link