Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Authentication and integrity in outsourced databases
ACM Transactions on Storage (TOS)
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Query assurance verification for outsourced multi-dimensional databases
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Authenticated indexing for outsourced spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
Query Integrity Assurance of Location-Based Services Accessing Outsourced Spatial Databases
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
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
Spatial Query Integrity with Voronoi Neighbors
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Outsourcing spatial databases, including both road networks and points of interest, to a third party Cloud service provider has attracted much attention from individual and business data owners. With popularity of mobile devices, providing instant and reliable location-based services to smartphones and tablets has been a major means of delivering spatial data to real-world users. Therefore, ensuring spatial query integrity in database outsourcing paradigms is critical. In this paper, we propose a novel road network k-nearest-neighbor query verification technique which utilizes the network Voronoi diagrams and neighbors to prove the integrity of the query result. Unlike previous work that verifies k-nearest-neighbor results in the Euclidean space, our approach verifies both the distances and the shortest paths from the query point to its kNN result on the road network.