中文摘要：

提出一种面向大规模P2P系统的概率搜索小组（probabilistic search team，简称PsT）算法．各节点首先发布本节点的资源共享信息，并基于分布式丢弃Bloom Filter技术（distributed discarding bloom filter,简称DDBF）对从其他节点收到的信息进行保存和转发．PST算法把RW算法中漫步者的概念扩充为搜索小组．通过聚合各小组在搜索过程中获得的资源信息，PST算法实现了多个小组之间相互协同的并行搜索．分析模拟结果表明，PST算法在保持低定位开销的同时取得了较好的定位性能．

英文摘要：

This paper presents a search algorithm called probabilistic search team （PST）. In PST, all nodes advertise their resource sharing information, maintain and broadcast the information based on DDBF （distributed discarding bloom filter）, which discards some information when transmitted to their neighbors. During the search process, PST extends the concept of walker in RW to search team. PST realizes collaborative and parallel search of multiple search teams by aggregating the resource information obtained in search process. Experimental results show that PST achieves a good tradeoff between performance and overhead.