Journal
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
Volume 20, Issue 1, Pages 39-59Publisher
SPRINGER
DOI: 10.1007/s11280-016-0399-8
Keywords
Reverse k nearest neighbor; Spatial keyword search; Ranking
Funding
- Chinese NSFC project [61170020, 61402311, 61440053, 61402312]
- US National Science Foundation [IIS-1115417]
Ask authors/readers for more resources
Recently, Reverse k Nearest Neighbors (RkNN) queries, returning every answer for which the query is one of its k nearest neighbors, have been extensively studied on the database research community. But the RkNN query cannot retrieve spatio-textual objects which are described by their spatial location and a set of keywords. Therefore, researchers proposed a RSTkNN query to find these objects, taking both spatial and textual similarity into consideration. However, the RSTkNN query cannot control the size of answer set and to be sorted according to the degree of influence on the query. In this paper, we propose a new problem Ranked Reverse Boolean Spatial Keyword Nearest Neighbors query called Ranked-RBSKNN query, which considers both spatial similarity and textual relevance, and returns t answers with most degree of influence. We propose a separate index and a hybrid index to process such queries efficiently. Experimental results on different real-world and synthetic datasets show that our approaches achieve better performance.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available