Abstract
In database outsourcing, the data owner delegates the tasks of data management to a third-party service provider. As the service provider may be untrusted or susceptible to attacks, query authentication is an essential part. Merkle R-tree (MR-tree) is one of the most efficient authenticated index that combines Merkle hash tree with R*-tree. MR-tree can provide an efficient range query authentication, however, as it uses the traditional R*-tree query structure in neighbor queries, a large number of unnecessary nodes may be accessed, and that can affect the efficiency of the query. In this paper, the neighbor relationship is introduced into the construction of MR-tree, and we propose a new index structure, called VMR-tree that incorporates the Voronoi diagram into MR-tree. In order to utilize VMR-tree index structure, we propose algorithms for spatial nearest neighbor queries and experiments to verify it has a better efficiency in spatial neighbor query authentication.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Database Theory and Application
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
