Introduction to Algorithms
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Supporting uncertainty in moving objects in network databases
Proceedings of the 13th annual ACM international workshop on Geographic information systems
IEEE Transactions on Knowledge and Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
The new Casper: query processing for location services without compromising privacy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
IEEE Transactions on Knowledge and Data Engineering
Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms
IEEE Transactions on Mobile Computing
Supporting anonymous location queries in mobile environments with privacygrid
Proceedings of the 17th international conference on World Wide Web
Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data
IEEE Transactions on Knowledge and Data Engineering
Non-Exposure Location Anonymity
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
MOBIHIDE: a mobilea peer-to-peer system for anonymous location-based queries
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Preserving user location privacy in mobile data management infrastructures
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
"Don't trust anyone": Privacy protection for location-based services
Pervasive and Mobile Computing
A Clustering-Based Location Privacy Protection Scheme for Pervasive Computing
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Approximate static and continuous range search in mobile navigation
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Trajectory privacy in location-based services and data publication
ACM SIGKDD Explorations Newsletter
Journal of Systems Architecture: the EUROMICRO Journal
Privacy-aware personalization for mobile advertising
Proceedings of the 2012 ACM conference on Computer and communications security
Countering overlapping rectangle privacy attack for moving kNN queries
Information Systems
Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables
International Journal of Information Retrieval Research
Hi-index | 0.00 |
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k , so that we guarantee to provide an answer set ${\cal A}$ such that each object in ${\cal A}$ is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.