On Efficient Processing of Complicated Cloaked Region for Location Privacy Aware Nearest-Neighbor Queries - Information and Communication Technology Access content directly
Conference Papers Year : 2013

On Efficient Processing of Complicated Cloaked Region for Location Privacy Aware Nearest-Neighbor Queries

Abstract

The development of location-based services has brought not only conveniences to users’ daily life but also great concerns about users’ location privacy. Thus, privacy aware query processing that handles cloaked regions has become an important part in preserving user privacy. However, the state-of-the-art private query processors only focus on handling rectangular cloaked regions, while lacking an efficient and scalable algorithm for other complicated cloaked region shapes, such as polygon and circle. Motivated by that issue, we introduce a new location privacy aware nearest-neighbor query processor that provides efficient processing of complicated polygonal and circular cloaked regions, by proposing the Vertices Reduction Paradigm and the Group Execution Agent. In the Vertices Reduction Paradigm, we also provide a new tuning parameter to achieve trade-off between answer optimality and system scalability. Finally, experimental results show that our new query processing algorithm outperforms previous works in terms of both processing time and system scalability.
Fichier principal
Vignette du fichier
978-3-642-36818-9_11_Chapter.pdf (339.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01480224 , version 1 (01-03-2017)

Licence

Attribution

Identifiers

Cite

Chan Nam Ngo, Tran Khanh Dang. On Efficient Processing of Complicated Cloaked Region for Location Privacy Aware Nearest-Neighbor Queries. 1st International Conference on Information and Communication Technology (ICT-EurAsia), Mar 2013, Yogyakarta, Indonesia. pp.101-110, ⟨10.1007/978-3-642-36818-9_11⟩. ⟨hal-01480224⟩
91 View
64 Download

Altmetric

Share

Gmail Facebook X LinkedIn More