XML Index Algorithm Based on Patricia Tries

As XML gradually becomes the standard of the data exchange and expression for Internet, how to accurately access the data stored in the XML documents has already been a crucial problem to be solved. At first, the paper illustrates the structure of Patricia Tries and gives the search method of Patricia Tries based on analyzing the difference between Tries tree with Patricia Tries. Afterwards, the dictionary-based query mechanism is introduced, and an improved XML index structure based on Patricia Tries tree is proposed, which uses Hash function to perform compressed encoding. At last, we make an analysis of spatial and temporal complexity for this index, and the result shows that the improved algorithm performs well in searching efficiency.