DefinePK

Abstract

This work specifically focus on the k-nearest-neighbor (kNN) query verification on road networks and design verification schemes which support both distance verification and path verification. That is the k resulting objects have the shortest distances to the query point among all the objects in the database, and the path from the query point to each k-nearest-neighbor result is the valid shortest path on the network. In order to verify the kNN query result on a road network, a naïve solution would be to return the whole road network and the point of interest (POI) dataset to the client to show correctness and completeness of the result.