Computer Science – Databases
Scientific paper
2011-09-30
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 1, pp. 37-48 (2011)
Computer Science
Databases
VLDB2012
Scientific paper
With the growing use of location-based services, location privacy attracts increasing attention from users, industry, and the research community. While considerable effort has been devoted to inventing techniques that prevent service providers from knowing a user's exact location, relatively little attention has been paid to enabling so-called peer-wise privacy--the protection of a user's location from unauthorized peer users. This paper identifies an important efficiency problem in existing peer-privacy approaches that simply apply a filtering step to identify users that are located in a query range, but that do not want to disclose their location to the querying peer. To solve this problem, we propose a novel, privacy-policy enabled index called the PEB-tree that seamlessly integrates location proximity and policy compatibility. We propose efficient algorithms that use the PEB-tree for processing privacy-aware range and kNN queries. Extensive experiments suggest that the PEB-tree enables efficient query processing.
Jensen Christian S.
Lin Dan
Lu Jiaheng
Xiao Lu
Zhang Rui
No associations
LandOfFree
A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-669708