计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 58-60.doi: 10.3969/j.issn.1000-3428.2010.06.019

• 软件技术与数据库 • 上一篇    下一篇

结构化P2P上的高效多属性区间查询

海 沫

  

  1. (中央财经大学信息学院,北京 100081)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Efficient Multi-attribute Range Query on Structured P2P

HAI Mo   

  1. (School of Information, Central University of Finance and Economics, Beijing 100081)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

摘要: 在结构化P2P上的多属性区间查询中,查询算法所需的跳数和消息数依赖于节点个数和被查询的区间大小,属性值改变时会产生大量的消息。针对这些问题,提出结构化P2P上基于节点动态分组(PDG)的多属性区间查询机制。仿真结果表明,PDG中解析每个查询所需的跳数和消息数与被查询的区间大小和节点个数无关,更新属性值所产生的消息数减少,并且节点分组的维护开销较低。

关键词: 多属性区间查询, 结构化P2P, 节点动态分组

Abstract: In multi-attribute range query on structured P2P, the number of hops and number of messages required depend on both the number of peers and the size of range to be queried, and vast messages are incurred when attribute value changes. In order to solve these problems, this paper proposes a Peer Dynamic Grouping(PDG) based multi-attribute range query mechanism. Simulation results show that in PDG, the number of hops and number of messages needed are independent of the range size and the peers number. The number of messages needed for attribute update is reduced. The cost of maintaining peer groups is low.

Key words: multi-attribute range query, structured P2P, Peer Dynamic Grouping(PDG)

中图分类号: