首页> 外文会议>International Conference on Electrical and Control Engineering >A grid structure support multi-dimensional range query for P2P networks
【24h】

A grid structure support multi-dimensional range query for P2P networks

机译:网格结构支持P2P网络的多维范围查询

获取原文

摘要

There are two problems for supporting multidimensional range query in p2p overlay networks, the first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data ranges with an exponentially expanding and extending rate, the first problem has been well addressed by using recursive decomposition schemes, such as Quad-tree, k-d tree, Z-order, and Hilbert curve, for the second problem, in this paper, we propose a grid structure p2p which can easily maintain data locality, and can efficiently support range query.
机译:在P2P覆盖网络中支持多维范围查询有两个问题,首先是在数据空间分区过程中保留数据局部,第二个是在数据范围内维持数据范围,具有指数展开和扩展的速率首先通过使用递归分解方案进行了很好的解决方案,例如四平树,kd树,z阶和hilbert曲线,对于第二个问题,在本文中,我们提出了一种电网结构P2P,可以轻松维护数据局部,可以有效地支持范围查询。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号