Group-based collective keyword querying in road networks
详细信息 查看全文
- 作者：Sen Sua ; susen@bupt.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Sen Zhaoa ; zhaosen@bupt.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Xiang Chenga ; chengxiang@bupt.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Rong Bia ; birong@bupt.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Xin Caob ; x.cao@qub.ac.uk" class="auth_mail" title="E-mail the corresponding author ; Jie Wangc ; wang@cs.uml.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Design of algorithms ; Collective keyword query ; Road networks ; Approximate algorithms
- 刊名：Information Processing Letters
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：118
- 期：Complete
- 页码：83-90
- 全文大小：530 K
文摘
- •
We define the group-based collective keyword (GBCK) query problem.
- •
We show the problem of answering GBCK query is NP-hard.
- •
An exact algorithm for answering the GBCK queries is presented.
- •
An approximation algorithm with a 15/7-factor approximation is proposed.
- •
A number of experiments on real datasets are done.