DMCA
Efficient Notification of Meeting Points for Moving Groups via Independent Safe Regions
BibTeX
@MISC{Li_efficientnotification,
author = {Jing Li and Man Lung Yiu and Nikos Mamoulis},
title = {Efficient Notification of Meeting Points for Moving Groups via Independent Safe Regions},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — In applications like social networking services and online games, multiple moving users form a group and wish to be continuously notified with the best meeting point from their locations. To reduce the communication frequency of the application server, a promising technique is to apply safe regions, which capture the validity of query results with respect to the users ’ locations. Unfortunately, the safe regions in our problem exhibit characteristics such as irregular shapes and dependency among multiple safe regions. These unique characteristics render existing safe region methods that focus on a single safe region inapplicable to our problem. To tackle these challenges, we first examine the shapes of safe regions in our problem context and propose feasible approximations for them. We design efficient algorithms for computing these safe regions, as well as develop compression techniques for representing safe regions in a compact manner. Experiments with both real and synthetic data demonstrate the efficiency of our proposal in terms of computation and communication costs. I.
Keyphrases
safe region meeting point independent safe region efficient notification unique characteristic social networking service develop compression technique user location communication cost single safe region inapplicable multiple safe region compact manner online game application server efficient algorithm problem exhibit characteristic query result irregular shape synthetic data problem context promising technique feasible approximation communication frequency safe region method
