Abstract: Peer-to-peer storage architecture is booming in these years for its immense capacity, self organizing, high scalability, fault tolerance and so on. Distributed query is an indispensable part of it, composed of query on keyword and query on numeric range. There are many efficient algorithms for keyword query in peer-to-peer storage architecture, but few for numeric range query. In this paper, PB-link tree, an efficient indexing algorithm for numeric range query in peer-to-peer storage architecture is presented. PB-link tree has attributes as high availability, low networking overhead, and load balance. The experimental results show that PB-link tree’s networking overhead is 80% lower, and the query efficiency is 6 times higher than the traditional distributed indexing algorithms. It can also guarantee 85% queries’correctness when half of peers fail.