Utilizing Spatio-temporal Data Index for Location Privacy Protection

Dang, Tran Khanh; Nguyen, Van Nghiem; Vu, Dinh Long; Küng, Josef

doi:10.1109/dexa.2013.7

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The twophase processing consumes long time due to the number of disk access required to retrieve the exact location. Recently, in the previous works of [4,12,16], the authors proposed B ob -tree and B ob+ -tree. These solutions allow the queries processed in only one phase.…”

Section: Introductionmentioning

confidence: 99%

B ^dHCO -tree

Dang

Nguyen

2014

Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication

Self Cite

View full text Add to dashboard Cite

Together with the rapid development of location-based services (LBS), the problem of privacy-preserving has gained much attention. Many techniques aiming at protecting user's privacy have been introduced such as obfuscation-based technique, kanonymity. Although existing solutions integrate location privacy protection algorithms into the indexed spatio-temporal data as B ob -tree and B ob+ -tree, they do not conform to moving objects and naturally frequent updates. On the other hand, because of using the static order Hilbert curve, these indices usually have large size, and so decreasing query and update performance. To overcome such disadvantages, in this paper, we propose a B dHCOtree that combines B dH -tree index, Hilbert Cloaking algorithm and obfuscation-based technique to enhance the performance of basic operations and increase the privacy protection. Besides, our solution is also integrated into spatio-temporal data index structure so that it can be used for commercial Database Management Systems transparently.

show abstract

Section: Introductionmentioning

confidence: 99%