文章基本信息

标题：XML Tree Pattern Matching Algorithms: Survey
本地全文：下载
作者：Gajanan Patle ; Pragati Patil
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2016
卷号：4
期号：1
页码：162
DOI：10.15680/IJIRCCE.2016.0401031
出版社：S&S Publications
摘要：Due to the business collaborations and for the purpose of portability enterprises are storing data in XML format. This has become a common practice as XML is po rtable and irrespective of platforms in which applications were developed, they can share information through XML file format. Such XML files are also validated using DTD or Schema. XML parsers are available in all languages that facilitate the usage of XM L programmatically. 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, t here is a need for processing XML tree pattern queries. The existing holistic algorithms for XML tree pattern matching queries exhibit sub - optimality problem as they consider intermediate results before taking final results. This causes suboptimal performa nce. This sub - optimality is overcome by using TreeMatch algorithm. This paper implements a prototype application that makes use of dewey labelling scheme to overcome sub - optimality. The experimental results revealed that the proposed algorithm is better th an the existing algorithms
关键词：XML tree; holistic algorithm; Dewey labelling; DTD and Sub-optimality