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
Thomsen, JR
Yiu, ML 
Mamoulis, N
Keywords: Query processing
Spatial databases
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on knowledge and data engineering, 2015, v. 27, no. 7, 6847137, p. 1767-1781 How to cite?
Journal: IEEE transactions on knowledge and data engineering 
Abstract: In applications like social networking services and online games, multiple moving users which form a group may wish to be continuously notified about the best meeting point from their locations. A promising technique for reducing the communication frequency of the application server is to employ 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 inter-dependencies, which render existing methods that compute a single safe region inapplicable to our problem. To tackle these challenges, we first examine the shapes of safe regions in our problem's context and propose feasible approximations for them. We design efficient algorithms for computing these safe regions. We also study a variant of the problem called the sum-optimal meeting point and extend our solutions to solve this variant. Experiments with both real and synthetic data demonstrate the effectiveness of our proposal in terms of computational and communication costs.
ISSN: 1041-4347
EISSN: 1558-2191
DOI: 10.1109/TKDE.2014.2334304
Appears in Collections:Journal/Magazine Article

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

Page view(s)

Last Week
Last month
Citations as of Nov 19, 2018

Google ScholarTM



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