期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：5
出版社：S.S. Mishra
摘要：The eme rgenc e of XML promised sign ificant advances in B2B integration. Thi s is becau se u sers can store o r tran smit structur e data usi ng this highl y flexible open standard. An effective well -formed XML documen t stru ctu re helps convert data into useful i nformation that can be proce ssed quickly an d efficien tly. From th is point th ere i s need for efficient proce ssing of qu eries on XML data in XML databases like XML-en abled (MS-SQL Server, Oracle), Nati ve XML (Mark Logic Server, EMC xDB). Th e re search area in XML databas e is p roces sing of XML tree pattern query (TPQ) called twi g wi th efficien t an swer s .Generally we have parser s that con struc ts th e parse tre es for some representation . Si milarly, we h ave XML DOM par ser it conv erts the XML document in to XML tree. The XML qu ery l angu ages like XQL(XML Query Lan guage), XML-QL(a qu ery l angu age for XML), Qu ilt, XPath (Extensi ble path l anguage), XQuery (Extensible Qu ery langu age) repre sent queries on XML data as twigs(small tree pattern s).Th e major operation of XML qu ery p roce ssing is to find all th e occurrences of twig pattern s effi cientl y on XML database. In the past few years, many algorith ms h ave been proposed to ma tch such tree pattern s (twi gs). This pape r presents an o verview of th e state of the a rt in TPQ pro cessi ng. This overvi ew shall start by providi ng some backg roun d in holistic approaches to process TPQ an d then in trodu ce different al gorithms for twig pattern matching.
关键词：XML; XML databases; Pattern Match ing Algorithms; XML Tree Pattern (twig); Qu ery processing; XML Par sers.
