XQUERY : Efficient searching and indexing Algorithm Based on Multi- tries

Abstract

XML is emerging as a de facto standard for information exchange over internet. XML file is plan text file and self explanatory therefore XML users are increase dramatically. There are two type of groups who has interest on XML utilization effectively, the first group is mainly interested in XML as a humanly consumable exchange format. They are looking up for tools that allow easy manipulation and transformation of small XML document. Second community is mainly interested in XML as a data storage format. Their primary focus is on design of query languages for storage effectively. This data-oriented paradigm has taken more efforts in query evaluation. XML data doesnot have fix schema, managing the document is difficult job . It is therefore major challenge for database community to design query languages and storage methods that can retrieve data effectively. There has been a growing need for developing high-performance techniques to query large XML .. The proposed technique summarized XML document into an ‘x-store’ , which store xml document distinct node :- element node, attribute node and value element node value, and path information. The unique storage address is generated for each node and it is indexed on path name.. Then we come up with the novel method of query searching which utilize multi-way tries to answer the query effectively .