利用索引的动态分布改善JXTA网络中查询效率  

Improve search efficiency using policy of active index distributing in JXTA network

作　　者：赵宗渠[1] 庄雷[1] 李建春[1] 

机构地区：[1]郑州大学信息工程学院,河南郑州450052

出　　处：《计算机应用》2005年第2期289-290,293,共3页journal of Computer Applications

基　　金：河南省教育厅科学研究项目(2003520256)

摘　　要：JXTA2. 0参考实现中,索引发布和查询机制是基于索引固定分布的策略。现有索引查询方案中集合点的RPV(RendezvousPeerView)松散一致性会导致查询请求在集合点之间重复巡查(walker)的问题。提出使用索引的动态分布改善查找目标索引的准确度,并且就索引的冗余及振荡进行了分析改进,避免在RPV中重复巡查和减小每一次巡查的距离,从而提高查询效率。In the JXTA 2.0 reference implementation, policy of publishing and searching index is based on the policy of index fixed distribution. The current loosely-consistent RPV(rendezvous peer view) mechanism should lead to matter of query repeatedly among rendezvous peers. Index dynamic distribution was proposed to improve performance of finding objective index; the redundancy and swing of the index were analyzed and resolved also. It can avoid walking in RPV repeatedly and decrease the distance of every walk, so can achieve a better search efficiency.

关 键 词：JXTA 索引查询 有限范围巡查 动态索引分布 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]