2013 IEEE 29th International Conference on Data Engineering (ICDE) (2013)
Brisbane, Australia Australia
Apr. 8, 2013 to Apr. 12, 2013
Jing Li , Dept. of Comput. Sci., Univ. of Hong Kong, Hong Kong, China
Man Lung Yiu , Dept. of Comput., Hong Kong Polytech. Univ., Hong Kong, China
N. Mamoulis , Dept. of Comput. Sci., Univ. of Hong Kong, Hong Kong, China
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.
Servers, Shape, Games, Social network services, Optimization, Roads, Computer architecture
Jing Li, Man Lung Yiu and N. Mamoulis, "Efficient notification of meeting points for moving groups via independent safe regions," 2013 29th IEEE International Conference on Data Engineering (ICDE 2013)(ICDE), Brisbane, QLD, 2013, pp. 422-433.