Please use this identifier to cite or link to this item:
Title: Efficient notification of meeting points for moving groups via independent safe regions
Authors: Li, J
Yiu, ML 
Mamoulis, N
Keywords: Computer games
Data compression
Mobile computing
Query processing
Social networking (online)
Issue Date: 2013
Publisher: IEEE
Source: 2013 IEEE 29th International Conference on Data Engineering (ICDE), 8-12 April 2013, Brisbane, QLD, p. 422-433 How to cite?
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.
ISBN: 978-1-4673-4909-3
978-1-4673-4908-6 (E-ISBN)
ISSN: 1063-6382
DOI: 10.1109/ICDE.2013.6544844
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 14, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 17, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.