Abstract: Spatial queries, such as nearest neighbour retrieval and range search, include only conditions on geometric properties. A spatial database handles multidimensional objects and offers fast access to those objects based on different selection criteria. Many applications demand a novel form of queries to discover the objects that considering both a spatial predicate, and a predicate on their associated texts on now-a-days. For example, considering all the hotels, a user would request for the hotel that is the nearest among those whose menus contain the specified keywords all at the same time. Here deals with the new method called efficient inverted list that extends the conventional inverted index to handle with multidimensional data, and arises with algorithms that can response nearest neighbor queries with keywords in real time.
Keywords: Spatial inverted list, spatial queries, IR2-tree, multidimensional data.