← Back to VOLUME 1, ISSUE 8, OCTOBER 2012
This work is licensed under a Creative Commons Attribution 4.0 International License.
Efficient Handling of XML Tree Pattern Matching Queries β A Holistic Approach
Sravan Kumar K, Madhu P, Raghava Rao N
M.Tech-SE, DRK Institute of Science and Technology, JNTUH, Hyderabad, India M.Tech-CS, DRK College of Engg. and Technology, JNTUH, Hyderabad, India HOD, Dept. of CSE, DRK Institute of Science and Technology, JNTUH, Hyderabad, India
Abstract: XML has become a defacto standard to store, share and exchange business data across homogenous and heterogeneous platforms. The interoperability is possible though XML. As enterprises are generating huge amount of data in XML format, there is a need for processing XML tree pattern queries. The existing holistic algorithms for XML tree pattern matching queries exhibit suboptimmality problem as they consider intermediate results before taking final results. This causes suboptimal performance. This suboptimality is overcome by using TreeMatch algorithm. This paper implements a prototype application that makes use of dewey labeling scheme to overcome suboptimality. The experimental results revealed that the proposed algorithm is better than the existing algorithms.
Keywords: XML, parser, XSL, algorithms, dewey labeling, xml tree pattern query.
Keywords: XML, parser, XSL, algorithms, dewey labeling, xml tree pattern query.
π 30 views
Downloads: Download PDF
This work is licensed under a Creative Commons Attribution 4.0 International License.How to Cite:
[1] Sravan Kumar K, Madhu P, Raghava Rao N, βEfficient Handling of XML Tree Pattern Matching Queries β A Holistic Approach,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)