The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
STHoles: a multidimensional workload-aware histogram
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Selectivity estimators for multidimensional range queries over real attributes
The VLDB Journal — The International Journal on Very Large Data Bases
Verifying completeness of relational query results in data publishing
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Query execution assurance for outsourced databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
LUGrid: Update-tolerant Grid-based Indexing for Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Minimum-cost network hardening using attack graphs
Computer Communications
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
CADS: continuous authentication on data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proof-infused streams: enabling authentication of sliding window queries on streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Authenticating the query results of text search engines
Proceedings of the VLDB Endowment
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Partially materialized digest scheme: an efficient verification method for outsourced databases
The VLDB Journal — The International Journal on Very Large Data Bases
Authenticated indexing for outsourced spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Authenticated join processing in outsourced databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Small synopses for group-by query verification on outsourced data streams
ACM Transactions on Database Systems (TODS)
Continuous Spatial Authentication
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Scalable verification for outsourced dynamic databases
Proceedings of the VLDB Endowment
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
Verifying spatial queries using Voronoi neighbors
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Authentication of moving kNN queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Continuous Monitoring of Distance-Based Range Queries
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
A moving range query continuously reports the query result (e.g., restaurants) that are within radius $r$ from a moving query point (e.g., moving tourist). To minimize the communication cost with the mobile clients, a service provider that evaluates moving range queries also returns a safe region that bounds the validity of query results. However, an untrustworthy service provider may report incorrect safe regions to mobile clients. In this paper, we present efficient techniques for authenticating the safe regions of moving range queries. We theoretically proved that our methods for authenticating moving range queries can minimize the data sent between the service provider and the mobile clients. Extensive experiments are carried out using both real and synthetic datasets and results show that our methods incur small communication costs and overhead.