Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
