A time saving index construction in geospatial searching

In general, the IR Tree is widely used for indexing in geospatial searching. The traditional internet is gaining a geospatial dimension driven by the emergence of mobile internet. The basic IR-tree with a search algorithm for top-k document facilitates spatial and textual narrowing of the dataset along with relevance computation and ranking of the documents simultaneously. Different weights are adopted by IR-tree on textual and spatial relevances of documents searched at the runtime. Many experiments has been conducted and their results has shown that IR-tree performs the state-of-the art approaches for geospatial searching but at the cost of increased storage overhead along with the hours invested in building IR tree. This paper introduces the concept of semi bulk loading in the data structure to reduce the construction time. The results has shown that with the proposed concept the construction time required for constructing IR-tree is reduced significantly and is capable of excellent performance.