Fast nearest neighbor search with keyword using compressed inverted index

Previously, queries on spatial data involves, finding nearest neighbor from the current location and also finding locations in given range, so called range queries involves condition or predicate on geometric objects. Many applications today, call a new form of queries which comes with a condition on their spatial data, i.e. location and also conditions on their text attached to locations. Instead of asking restaurant nearest from the current location these new forms of queries will ask the restaurant nearest from current location with having some attached keywords like famous for brandy, or other menus as keywords attached with corresponding location. Existing solution are IR2 tree and Inverted Index; those have some deficiencies like verification bottleneck. To avoid this bottleneck proposed system is designed i.e “Spatial Inverted Index”. This is an extension of the Inverted Index approach. Hence, it is effectively applicable for searching related to hospital, hotel, and restaurant having keyword.

[1]  Christos Faloutsos,et al.  Signature files: an access method for documents and its analytical performance evaluation , 1984, TOIS.

[2]  Vagelis Hristidis,et al.  DISCOVER: Keyword Search in Relational Databases , 2002, VLDB.

[3]  Anthony K. H. Tung,et al.  Keyword Search in Spatial Databases: Towards Searching by Document , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[4]  Torsten Suel,et al.  Efficient query processing in geographic web search engines , 2006, SIGMOD Conference.

[5]  Yufei Tao,et al.  Fast Nearest Neighbor Search with Keywords , 2014, IEEE Transactions on Knowledge and Data Engineering.

[6]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[7]  Naphtali Rishe,et al.  Keyword Search on Spatial Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.