IEEE PROJECT TOPICS & ABSTRACTS BY

SOFTRONIICS

Spatial Query Integrity with Voronoi

Neighbors
ABSTRACT
With the popularity of location-based services and the abundant usage of smart phones
and GPS-enabled devices, the necessity of outsourcing spatial data has grown rapidly over the
past few years. Meanwhile, the fast arising trend of Cloud storage and Cloud computing services
has provided a flexible and cost-effective platform for hosting data from businesses and
individuals, further enabling many location-based applications. Nevertheless, in this database
outsourcing paradigm, the authentication of the query results at the client remains a challenging
problem. In this paper, we focus on the Outsourced Spatial Database (OSDB) model and propose
an efficient scheme, called VN-Auth, which allows a client to verify the correctness and
completeness of the result set. Our approach is based on neighborhood information derived from
the Voronoi diagram of the underlying spatial dataset and can handle fundamental spatial query
types, such as k nearest neighbor and range queries, as well as more advanced query types like
reverse k nearest neighbor, aggregate nearest neighbor, and spatial skyline. Compared to the
current state-of-the-art approaches (i.e., methods based on Merkle hash trees), our experiments
show that VN-Auth produces significantly smaller verification objects and is more
computationally

efficient,

especially

SOFTONIICS
CALICUT||PALAKKAD||COIMBATORE

for

queries

with

low

selectivity.

WWW.SOFTRONIICS.IN
9037061113||9037291113

IEEE PROJECT TOPICS & ABSTRACTS BY

SOFTRONIICS

Existing System
The current state-of-the-art solution for authenticating spatial queries is the Merkle R-tree
(MR-tree). The MR-tree is essentially an R-tree that is augmented with authentication
information, i.e., hash digests. In particular, every leaf node of the tree stores a digest that is
computed on the concatenation of the binary representation of all objects in the node. Internal
nodes are assigned a digest that summarizes the child nodes MBRs (minimum bounding
rectangles) and digests. Digests are computed in a bottom-up fashion, and the single digest at the
root is signed by the DO. Range queries on the MR-tree are handled by a depthfirst traversal of
the tree. The resulting VO contains 1) all the objects in every leaf node visited and 2) the MBRs
and digests of all the pruned nodes. Having this information, the client can reconstruct the root
digest and compare it against the one that was signed by the owner. In addition, the client also
examines the spatial relations between the query and each object/MBR included in the VO, in
order to verify the correctness of the result. We argue that the structure of the MR-tree, as well as
the verification process, suffer from several drawbacks. First, the authentication information
(hash digests) embedded in the MR-tree reduces the node fanout, leading to more I/O accesses
during query processing. Second, in the presence of updates from the DO, all digests on the path
from an affected leaf node to the root have to be recomputed. Consequently, when updates are
frequent, query performance is degraded. Finally, the overhead of the VO can be significant,
especially for queries that return only a few objects. This is due to the fact that the SP has to
return all objects lying inside the leaf nodes that are visited during query processing. As an
example, consider the range query q. Even though the result set includes only two objects (p2;
p4), the corresponding VO has to return all 12 objects in the database.
Disadvantage:

SOFTONIICS
CALICUT||PALAKKAD||COIMBATORE

WWW.SOFTRONIICS.IN
9037061113||9037291113

IEEE PROJECT TOPICS & ABSTRACTS BY

SOFTRONIICS
An extension of the MR-tree, called MR*-tree, mitigates this last drawback by ordering
the entries of each node and constructing hierarchical relationships of the digests therein.
Nevertheless, it does not eliminate the VO overhead entirely, and it increases the
verification cost at the client.

Proposed System:
we propose VN-Auth, a novel approach that authenticates arbitrary spatial queries based
on neighborhood information derived from the Voronoi diagram of the underlying spatial dataset.
In particular, before delegating its database to the SP, the owner transforms each data object by
creating a signature of the object itself along with information about its Voronoi neighbors. A key
aspect of our method is that it separates the authentication information from the spatial index. As
a result, the efficiency of the spatial index is not compromised, and updates affect only the
neighbourhoods of the updated objects. Furthermore, for kNN and range queries the VO is
extremely compact, since it only includes the transformed objects that belong to the result set.
We implemented our verification algorithms on Android mobile devices and run experiments
using real-world datasets. Our experiments and results show that, compared to the MR-tree
variants, VN-Auth produces significantly smaller verification objects and is more
computationally efficient, especially for queries with low selectivity.

Advantages:
VN-Auth produces significantly smaller verification objects and is more
computationally

efficient,

especially

for

queries

with

low

selectivity.

Problem Statement

SOFTONIICS
CALICUT||PALAKKAD||COIMBATORE

WWW.SOFTRONIICS.IN
9037061113||9037291113

IEEE PROJECT TOPICS & ABSTRACTS BY

SOFTRONIICS
With the popularity of location-based services and the abundant usage of smart phones
and GPS-enabled devices, the necessity of outsourcing spatial data has grown rapidly over the
past few years. Meanwhile, the fast arising trend of Cloud storage and Cloud computing services
has provided a flexible and cost-effective platform for hosting data from businesses and
individuals, further enabling many location-based applications. Nevertheless, in this database
outsourcing paradigm, the authentication of the query results at the client remains a challenging
problem.

SOFTONIICS
CALICUT||PALAKKAD||COIMBATORE

WWW.SOFTRONIICS.IN
9037061113||9037291113