摘要
在结构化P2P上的多属性区间查询中,查询算法所需的跳数和消息数依赖于节点个数和被查询的区间大小,属性值改变时会产生大量的消息。针对这些问题,提出结构化P2P上基于节点动态分组(PDG)的多属性区间查询机制。仿真结果表明,PDG中解析每个查询所需的跳数和消息数与被查询的区间大小和节点个数无关,更新属性值所产生的消息数减少,并且节点分组的维护开销较低。
In multi-attribute range query on structured P2E 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.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第6期58-60,共3页
Computer Engineering
基金
国家自然科学基金资助项目(70672050
60673162)
中央财经大学"211"工程三期建设基金资助项目
关键词
多属性区间查询
结构化P2P
节点动态分组
multi-attribute range query
structured P2P
Peer Dynamic Grouping（PDG）
