Efficient Combined Index Structure for K-Nearest Neighbours Keyword Search on Spatial Database

Spatial keyword search on spatial database hasbeen well studied for years due to its importance tocommercial search engines.Specially, a spatialkeyword query takes a user location and user-suppliedkeywords as arguments and returns object that isnearest k objects from user current location andtextually relevant to the user required keyword. Geotextualindex play an important role in spatial keywordquerying. This paper proposes the efficient combinedindex structure for K-Nearest Neighbours KeywordSearch on Spatial Database. That combine K-d treeand inverted file for nearest neighbor keyword querywhich is based on the most spatial and textualrelevance to query point and required keyword. It cansearch required k results with minimum IO costs andCPU costs. The k-results are ranked according to thedistance or keyword. The own dataset is created forYangon (Myanmar) region which contains latitude,longitude, name, description and category type of eachobject