Implements The Spatial Inverted Indexes To Perform Quick Search | Abstract

ISSN ONLINE(2320-9801) PRINT (2320-9798)

Special Issue Article Open Access

Implements The Spatial Inverted Indexes To Perform Quick Search

Abstract

Spatial queries, such as range search and nearest neighbour retrieval, involve only conditions on objects geometric properties.A spatial database manages multidimensional objects(such as points, rectangles, etc.), and provides fast accessto those objects based on different selection criteria. Now-a-days many applications call a new form of queries to find the objects that satisfying both a spatial predicate, and a predicate on their associated texts. For example, instead of considering all the restaurants, a nearest neighbour query would instead ask for the restaurant that is the closest among those whose menus contain the specified keywords all at the sametime.IR2-tree is used in the existing system for providing best solution for finding nearest neighbour. This method has few deficiencies. So we implement the new method called spatial inverted index to improve the space and query efficiency. And enhanced search is used to search the required objects based on the user priority level.Thus the proposed algorithm is scalable to find the required objects.

Sophiya.K, Sounderrajan.T

To read the full article Download Full Article