http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Research on MR-Tree Spatial Query Authenticated Index Introduced Neighbor Relationship
Xiaofu Wei,Shenglin Li,Zuofei Tan,Kaiwen Luo,San Zhang 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.10
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.