Abstract
The Heap-based Algorithm (HBA) is adopted to complete the retrieval design and improve the search space efficiency of XML hierarchy information. The main work performed are as follows: the space efficiency characteristics of the two-layer LAF coding index is expounded theoretically; the first layer HBA with maximum stack is designed to complete the pseudo algorithm codes; samples are designed by inputting query Q (Yu, Yannis). A contrast experiment that constitutes one artificial dataset and four real datasets is then conducted. Results show that DOM standard algorithms are concise and direct. In space efficiency, the two-layer LAF coding index is significantly higher than several traditional methods. In time efficiency, the traditional Scan Eager algorithm is clearly inferior to the HBA. The designed space efficiency of the HBA has obvious advantages as long as the average depth is greater than four and the keywords can be uniformly distributed. This study has obvious benefits to the further improvement of XML information search.
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.
