Processing Multiple-User Location-Based Keyword Queries

Yong WANG; Xiaoran DUAN; Xiaodong YANG; Yiquan ZHANG; Xiaosong ZHANG

doi:10.1587/transinf.2017EDP7375

Processing Multiple-User Location-Based Keyword Queries

Yong WANG, Xiaoran DUAN, Xiaodong YANG, Yiquan ZHANG, Xiaosong ZHANG

Full Text Views

0

Share
Cite this

Summary :

Geosocial networking allows users to interact with respect to their current locations, which enables a group of users to determine where to meet. This calls for techniques that support processing of Multiple-user Location-based Keyword (MULK) queries, which return a set of Point-of-Interests (POIs) that are 'close' to the locations of the users in a group and can provide them with potential options at the lowest expense (e.g., minimizing travel distance). In this paper, we formalize the MULK query and propose a dynamic programming-based algorithm to find the optimal result set. Further, we design two approximation algorithms to improve MULK query processing efficiency. The experimental evaluations show that our solutions are feasible and efficient under various parameter settings.

Publication: IEICE TRANSACTIONS on Information Vol.E101-D No.6 pp.1552-1561

Publication Date: 2018/06/01

Publicized: 2018/03/01

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2017EDP7375

Type of Manuscript: PAPER

Category: Data Engineering, Web Information Systems

Authors

Yong WANG
  Center for CyberSecurity
Xiaoran DUAN
  Center for CyberSecurity
Xiaodong YANG
  Center for CyberSecurity
Yiquan ZHANG
  Center for CyberSecurity
Xiaosong ZHANG
  Center for CyberSecurity

Keyword

multiple-user location-based query, location-based keyword query, query processing

Cite this

Copy

Yong WANG, Xiaoran DUAN, Xiaodong YANG, Yiquan ZHANG, Xiaosong ZHANG, "Processing Multiple-User Location-Based Keyword Queries" in IEICE TRANSACTIONS on Information, vol. E101-D, no. 6, pp. 1552-1561, June 2018, doi: 10.1587/transinf.2017EDP7375.
Abstract: Geosocial networking allows users to interact with respect to their current locations, which enables a group of users to determine where to meet. This calls for techniques that support processing of Multiple-user Location-based Keyword (MULK) queries, which return a set of Point-of-Interests (POIs) that are 'close' to the locations of the users in a group and can provide them with potential options at the lowest expense (e.g., minimizing travel distance). In this paper, we formalize the MULK query and propose a dynamic programming-based algorithm to find the optimal result set. Further, we design two approximation algorithms to improve MULK query processing efficiency. The experimental evaluations show that our solutions are feasible and efficient under various parameter settings.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2017EDP7375/_p

Copy

@ARTICLE{e101-d_6_1552,
author={Yong WANG, Xiaoran DUAN, Xiaodong YANG, Yiquan ZHANG, Xiaosong ZHANG, },
journal={IEICE TRANSACTIONS on Information},
title={Processing Multiple-User Location-Based Keyword Queries},
year={2018},
volume={E101-D},
number={6},
pages={1552-1561},
abstract={Geosocial networking allows users to interact with respect to their current locations, which enables a group of users to determine where to meet. This calls for techniques that support processing of Multiple-user Location-based Keyword (MULK) queries, which return a set of Point-of-Interests (POIs) that are 'close' to the locations of the users in a group and can provide them with potential options at the lowest expense (e.g., minimizing travel distance). In this paper, we formalize the MULK query and propose a dynamic programming-based algorithm to find the optimal result set. Further, we design two approximation algorithms to improve MULK query processing efficiency. The experimental evaluations show that our solutions are feasible and efficient under various parameter settings.},
keywords={},
doi={10.1587/transinf.2017EDP7375},
ISSN={1745-1361},
month={June},}

Copy

TY - JOUR
TI - Processing Multiple-User Location-Based Keyword Queries
T2 - IEICE TRANSACTIONS on Information
SP - 1552
EP - 1561
AU - Yong WANG
AU - Xiaoran DUAN
AU - Xiaodong YANG
AU - Yiquan ZHANG
AU - Xiaosong ZHANG
PY - 2018
DO - 10.1587/transinf.2017EDP7375
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E101-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2018
AB - Geosocial networking allows users to interact with respect to their current locations, which enables a group of users to determine where to meet. This calls for techniques that support processing of Multiple-user Location-based Keyword (MULK) queries, which return a set of Point-of-Interests (POIs) that are 'close' to the locations of the users in a group and can provide them with potential options at the lowest expense (e.g., minimizing travel distance). In this paper, we formalize the MULK query and propose a dynamic programming-based algorithm to find the optimal result set. Further, we design two approximation algorithms to improve MULK query processing efficiency. The experimental evaluations show that our solutions are feasible and efficient under various parameter settings.
ER -