File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2396761.2396810
- Scopus: eid_2-s2.0-84871098435
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A filter-based protocol for continuous queries over imprecise location data
Title | A filter-based protocol for continuous queries over imprecise location data |
---|---|
Authors | |
Keywords | Communication cost Continuous queries Uncertain database Communication bandwidth Communication cost |
Issue Date | 2012 |
Publisher | The Association for Computing Machinery (ACM). |
Citation | The 21st ACM Conference on Information and Knowledge Management (CIKM'12), Maui, HI., 29 October-2 November 2012. In Conference Proceedings, 2012, p. 365-374 How to Cite? |
Abstract | In typical location-based services (LBS), moving objects (e.g., GPS-enabled mobile phones) report their locations through a wireless network. An LBS server can use the location information to answer various types of continuous queries. Due to hardware limitations, location data reported by the moving objects are often uncertain. In this paper, we study efficient methods for the execution of Continuous Possible Nearest Neighbor Query (CPoNNQ) that accesses imprecise location data. A CPoNNQ is a standing query (which is active during a period of time) such that, at any time point, all moving objects that have non-zero probabilities of being the nearest neighbor of a given query point are reported. To handle the continuous nature of a CPoNNQ, a simple solution is to require moving objects to continuously report their locations to the LBS server, which evaluates the query at every time step. To save communication bandwidth and mobile devices' batteries, we develop two filter-based protocols for CPoNNQ evaluation. Our protocols install 'filter bounds' on moving objects, which suppress unnecessary location reporting and communication between the server and the moving objects. Through extensive experiments, we show that our protocols can effectively reduce communication costs while maintaining a high query quality. © 2012 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/164905 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jin, Y | en_US |
dc.contributor.author | Cheng, R | en_US |
dc.contributor.author | Kao, B | en_US |
dc.contributor.author | Lam, KY | en_US |
dc.contributor.author | Zhang, Y | en_US |
dc.date.accessioned | 2012-09-20T08:12:19Z | - |
dc.date.available | 2012-09-20T08:12:19Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | The 21st ACM Conference on Information and Knowledge Management (CIKM'12), Maui, HI., 29 October-2 November 2012. In Conference Proceedings, 2012, p. 365-374 | en_US |
dc.identifier.isbn | 978-1-4503-1156-4 | - |
dc.identifier.uri | http://hdl.handle.net/10722/164905 | - |
dc.description.abstract | In typical location-based services (LBS), moving objects (e.g., GPS-enabled mobile phones) report their locations through a wireless network. An LBS server can use the location information to answer various types of continuous queries. Due to hardware limitations, location data reported by the moving objects are often uncertain. In this paper, we study efficient methods for the execution of Continuous Possible Nearest Neighbor Query (CPoNNQ) that accesses imprecise location data. A CPoNNQ is a standing query (which is active during a period of time) such that, at any time point, all moving objects that have non-zero probabilities of being the nearest neighbor of a given query point are reported. To handle the continuous nature of a CPoNNQ, a simple solution is to require moving objects to continuously report their locations to the LBS server, which evaluates the query at every time step. To save communication bandwidth and mobile devices' batteries, we develop two filter-based protocols for CPoNNQ evaluation. Our protocols install 'filter bounds' on moving objects, which suppress unnecessary location reporting and communication between the server and the moving objects. Through extensive experiments, we show that our protocols can effectively reduce communication costs while maintaining a high query quality. © 2012 ACM. | - |
dc.language | eng | en_US |
dc.publisher | The Association for Computing Machinery (ACM). | - |
dc.relation.ispartof | Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM'12 | en_US |
dc.subject | Communication cost | - |
dc.subject | Continuous queries | - |
dc.subject | Uncertain database | - |
dc.subject | Communication bandwidth | - |
dc.subject | Communication cost | - |
dc.title | A filter-based protocol for continuous queries over imprecise location data | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Jin, Y: yfjin@cs.hku.hk | en_US |
dc.identifier.email | Cheng, R: ckcheng@cs.hku.hk | en_US |
dc.identifier.email | Kao, B: kao@cs.hku.hk | - |
dc.identifier.email | Lam, KY: ‡cskylam@cityu.edu.hk | - |
dc.identifier.email | Zhang, Y: yinuozha@usc.edu | - |
dc.identifier.authority | Cheng, R=rp00074 | en_US |
dc.identifier.authority | Kao, B=rp00123 | en_US |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1145/2396761.2396810 | - |
dc.identifier.scopus | eid_2-s2.0-84871098435 | - |
dc.identifier.hkuros | 206208 | en_US |
dc.identifier.hkuros | 222842 | - |
dc.identifier.spage | 365 | - |
dc.identifier.epage | 374 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 130417 | - |