首页 | 本学科首页   官方微博 | 高级检索  
     


Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search
Authors:Pengpeng?Zhao  author-information"  >  author-information__contact u-icon-before"  >  mailto:ppzhao@suda.edu.cn"   title="  ppzhao@suda.edu.cn"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Hailin?Fang,Victor?S.?Sheng,Zhixu?Li,Jiajie?Xu,Jian?Wu,Zhiming?Cui
Affiliation:1.School of Computer Science and Technology,Soochow University,Suzhou,People’s Republic of China;2.Computer Science Department,University of Central Arkansas,Conway,USA
Abstract: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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号