摘要
介绍了一种基于P2P网络环境下的多维数据范围查询的通用架构,构造了一个虚拟的基于空间划分的层次树,以保证相关查询区域的探索尽量发生在同层节点之间,减轻了上层节点的查询负担,从而避免了树根结点的瓶颈问题,有效地降低了更新代价.模拟试验证明了该方法的有效性.
This paper introduces a common architecture of the multi-dimensional data range queries based on the P2P network and constructs a virtual hierarchical tree based on space division which ensures that the exploration of the relevant query regions occurred between the nodes in the same layer as far as possible.Thereby the query burden of the upper node will be reduced and the bottlenecks of the root node can be avoided which will reduce the updating cost effectively.Through the simulations the method has been proved to be effective.
出处
《微电子学与计算机》
CSCD
北大核心
2011年第2期11-14,19,共5页
Microelectronics & Computer
基金
淮安科技计划项目(HAG09061)
淮阴工学院重点基金项目(HGA0907)
