Abstract
A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often returns mobile clients a safe region that bounds the validity of query results to minimize the communication cost between the two parties. However, when a service provider is not trustworthy, it may send inaccurate query results or incorrect safe regions to clients. In this paper, we present a framework and algorithms to authenticate results and safe regions of moving kNN queries. Extensive experiments on both real and synthetic datasets show that our methods are efficient in terms of both computation time and communication costs.
Original language | English |
---|---|
Title of host publication | 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 |
Pages | 565-576 |
Number of pages | 12 |
DOIs | |
Publication status | Published - 6 Jun 2011 |
Event | 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 - Hannover, Germany Duration: 11 Apr 2011 → 16 Apr 2011 |
Conference
Conference | 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 |
---|---|
Country/Territory | Germany |
City | Hannover |
Period | 11/04/11 → 16/04/11 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Information Systems