The wavelet Tree has many applications in different domains such as geographical search. Researchers presented a dual indexing technique based on a wavelet tree for Geographical Information Retrieval (GIR). The large amount of geographical information on the internet has made the indexing challenging during the information retrieval which is defined as an activity to retrieve a set of information based on our need from a set of resources. An efficient indexing technique is an essential requirement in processing of the plenty of data that are present in today’s information retrieval systems. This has been the motivation towards the design and development of several different indexing structures with a primary focus towards secondary memory as compared to the main memory which used to consist of a smaller size as well as a higher cost in the beginning, however with a dramatic reduction in the main memory prices, indexes in the main memory has also been introduced which led to the development of primary memory-based indexing structures. Dual indexing technique uses wavelet tree data structure for both textual and spatial indexing and allows for the use of MBR in dynamic insertion during index construction. It has the advantage of supporting parallel computing when there is an extensive data set involved. It can be used extensively and concurrently on different machines such that textual data can be searched on one machine and spatial data on another machine which in turn results in the reduction of the search time and the storage space, hence making this method way more efficient as compared to the previous proposed methods. Experimental results support this by showing that when pure spatial indexing is used, search time complexity is reduced and takes even less than one third time of that of spatial indexing performed using previously introduced methods namely R-tree or R*-tree. In addition, the search time is decreased by half in the case of dual indexing (textual and spatial) using wavelet tree, as compared to the other techniques like B/R, B/R* when the search query length is larger than 2 keywords. References External links Trees (data structures) Succinct data structure String data structures