This document describes a proposed system for authenticating k nearest neighbor queries on road networks. The proposed system utilizes network Voronoi diagrams and neighbors to verify the integrity of query results and distances to the k nearest neighbors on the road network. The system was evaluated on real-world road networks using both real and synthetic points of interest datasets. Experiments using the system on Google Android devices communicating wirelessly with a service provider showed that the approach leads to compact verification objects and efficient verification, especially for low selectivity queries.

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Authentication of k Nearest Neighbor Query on Road
Networks
Abstract
Outsourcing spatial databases to the cloud provides an economical and flexible way for
data owners to deliver spatial data to users of location-based services. However, in the
database outsourcing paradigm, the third-party service provider is not always trustworthy,
therefore, ensuring spatial query integrity is critical. In this paper, we propose an efficient
road network k-nearest-neighbor query verification technique which utilizes the network
Voronoi diagram and neighbors to prove the integrity of query results. Unlike previous work
that verifies k-nearest-neighbor results in the Euclidean space, our approach needs to verify
both the distances and the shortest paths from the query point to its kNN results on the road
network. We evaluate our approach on real-world road networks together with both real and
synthetic points of interest datasets. Our experiments run on Google Android mobile
devices which communicate with the service provider through wireless connections. The
experiment results show that our approach leads to compact verification objects (VO) and
the verification algorithm on mobile devices is efficient, especially for queries with low
selectivity.
Existing system
Outsourcing spatial databases to the cloud provides an economical and flexible way for
data owners to deliver spatial data to users of location-based services. However, in the
database outsourcing paradigm, the third-party service provider is not always trustworthy,
therefore, ensuring spatial query integrity is critical.

2. Proposed system
In this paper, we propose an efficient road network k-nearest-neighbor query verification
technique which utilizes the network Voronoi diagram and neighbors to prove the integrity of
query results. Unlike previous work that verifies k-nearest-neighbor results in the Euclidean
space, our approach needs to verify both the distances and the shortest paths from the
query point to its kNN results on the road network. We evaluate our approach on real-world
road networks together with both real and synthetic points of interest datasets. Our
experiments run on Google Android mobile devices which communicate with the service
provider through wireless connections. The experiment results show that our approach
leads to compact verification objects (VO) and the verification algorithm on mobile devices
is efficient, especially for queries with low selectivity.
System Configuration:-
Hardware Configuration:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
Software Configuration:-

3.  Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.