Fast Nearest Neighbour Search Aims At Optimizing Different Objective Functions Using Si- Index

Abstract

Several modern applications call for novel forms of queries that aspire to find objects pleasing both a spatial predicate and a predicate on their associated texts. The significance of spatial databases is reflected by the convenience of modelling entities of reality in a geometric manner. For instance locations of restaurants, hotels, hospitals and so on are often represented as points in a map at the same time as larger extents such as parks, lakes and landscapes often as a combination of rectangles. Many functionalities of a spatial database are useful in various ways in specific contexts. For case in point in a geography information system, range search can be deployed to find all restaurants in a certain area while nearest neighbour retrieval can discover the restaurant closest to a given address. 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.