Keyword Search For Nearest Neighbor Using IR 2 - TREE

Srikanth Reddy. G, Y. Dasaradh Ram Reddy


Conventional spatial queries, such as range search and nearest neighbour retrieval, involve only conditions on objects’ geometric properties. Today, many modern applications call for novel forms of queries that aim to find objects 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 “steak, spaghetti, brandy” all at the same time. Currently the best solution to such queries is based on the IR2-tree, which, as shown in this paper, has a few deficiencies that seriously impact its efficiency. Motivated by this, we develop a new access method called the spatial inverted index that extends the conventional inverted index to cope with multidimensional data, and comes with algorithms that can answer nearest neighbour queries with keywords in real time. As verified by experiments, the proposed techniques outperform the IR2-tree in query response time significantly, often by a factor of orders of magnitude.
Index Terms: Spatial queries; IR2 trees; predicate; spatial inverted index; multidimensional data

Full Text:


Copyright (c) 2016 Srikanth Reddy. G, Y. Dasaradh Ram Reddy

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at 

Paper submission: