Abstract
AbstractRetrieving of relevant information from a large corpus is a challenging task nowadays. Wavelet tree is an accomplished data structure to store and retrieve text, image, audio, and video data in efficient space and time. It has turn to be a leading tool in modernized full-text indexing or in its proficiency in compression. This study presents the contribution of wavelet trees to design indexing to retrieve information in the field of web, healthcare, agriculture, bioinformatics, and earthquake detection. In this paper, we proposed a technique of LZW compression on wavelet tree. It performs compression on the wavelet tree. This paper consists of several concepts of wavelets which show about the indexing procedure, empirical measures, wavelet packets, wavelet entropy, wavelet matrix, and complexity of wavelets. Further, the literature discusses the open issues where wavelet trees can be used to design indexing of other databases.KeywordsIndexingWavelet packetsComplexityLZW compressionTree structures
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.
