File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient notification of meeting points for moving groups via independent safe regions

TitleEfficient notification of meeting points for moving groups via independent safe regions
Authors
KeywordsApplication Servers
Communication cost
Communication frequency
Compression techniques
Irregular shape
Query results
Social networking services
Synthetic data
Issue Date2013
PublisherIEEE, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178
Citation
The 29th International Conference on Data Engineering (ICDE 2013), Brisbane, Australia, 8-11 April 2013. In International Conference on Data Engineering Proceedings, 2013, p. 422-433 How to Cite?
AbstractIn 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. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/189615
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Jen_US
dc.contributor.authorYiu, MLen_US
dc.contributor.authorMamoulis, Nen_US
dc.date.accessioned2013-09-17T14:50:21Z-
dc.date.available2013-09-17T14:50:21Z-
dc.date.issued2013en_US
dc.identifier.citationThe 29th International Conference on Data Engineering (ICDE 2013), Brisbane, Australia, 8-11 April 2013. In International Conference on Data Engineering Proceedings, 2013, p. 422-433en_US
dc.identifier.isbn978-1-4673-4910-9-
dc.identifier.issn1084-4627-
dc.identifier.urihttp://hdl.handle.net/10722/189615-
dc.description.abstractIn 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. © 2013 IEEE.-
dc.languageengen_US
dc.publisherIEEE, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178-
dc.relation.ispartofInternational Conference on Data Engineering Proceedingsen_US
dc.rightsInternational Conference on Data Engineering. Proceedings. Copyright © IEEE, Computer Society.-
dc.rights©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectApplication Servers-
dc.subjectCommunication cost-
dc.subjectCommunication frequency-
dc.subjectCompression techniques-
dc.subjectIrregular shape-
dc.subjectQuery results-
dc.subjectSocial networking services-
dc.subjectSynthetic data-
dc.titleEfficient notification of meeting points for moving groups via independent safe regionsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, J: jli@cs.hku.hken_US
dc.identifier.emailYiu, ML: csmlyiu@comp.polyu.edu.hk-
dc.identifier.emailMamoulis, N: nikos@cs.hku.hk-
dc.identifier.authorityMamoulis, N=rp00155en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICDE.2013.6544844-
dc.identifier.scopuseid_2-s2.0-84881350515-
dc.identifier.hkuros220973en_US
dc.identifier.spage422en_US
dc.identifier.epage433en_US
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 131016-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats