P2P網路的研究者經常使用以興趣為基礎的捷徑來加速搜尋的過程。然而，近來提出的技術中，捷徑的數目會隨著興趣數的增加而成指數上升。
為了解決這個問題，我們採用significant characteristics的概念，不論興趣數的多寡，其值都是一個常數。我們提出的方法是以significant characteristics為基礎來建立捷徑，所以捷徑的數目可以很容易地控制住。

在本篇論文中，我們引進了數種方法來辨別significant characteristics。並且也提出不同的利用significant characteristics的搜尋方法。

我們的實驗結果顯示所提出的方法在P2P系統中可以達到很好的效率。本篇研究也指出以significant characteristics為基礎的方法是可以加速在動態環境中的query過程。

[1] The freenet project. http://freenetproject.org.
[2] Gnutella.com. http://www.gnutella.com.
[3] Peersim. http://peersim.sourceforge.net.
[4] L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law
networks. CoRR, cs.NI/0103016, 2001.
[5] A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In ICDCS, pages
23–, 2002.
[6] I. Jawhar and J. Wu. A two-level random walk search protocol for peer-to-peer networks. In
Proceedings of the 8th World Multi-Conference on Systemics, Cybernetics and Informatics.,
2004.
[7] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti. A local search mechanism for peerto-
peer networks. In Proceedings of the eleventh international conference on Information and
knowledge management, pages 300–307. ACM Press, 2002.
[8] S. J. Leon. LINEAR ALGEBRA WITH APPLICATIONS. New Jersey, 2002.
[9] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peerto-
peer networks. In SIGMETRICS, pages 258–259, 2002.
[10] C. o sleep. http://kdl.cs.umass.edu/data/canosleep/canosleep-info.html.
[11] M. K. Ramanathan, V. Kalogeraki, and J. Pruyne. Finding good peers in peer-to-peer networks.
In IPDPS, 2002.
[12] S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker. A scalable contentaddressable
network. In SIGCOMM, pages 161–172, 2001.
[13] M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. In Peer-to-Peer Computing,
pages 99–100, 2001.
[14] A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing
for large-scale peer-to-peer systems. In Middleware, pages 329–350, 2001.
[15] M. T. Schlosser, T. E. Condie, and S. D. Kamvar. Simulating a file-sharing p2p network. In
Proceedings of the First Workshop on Semantics in P2P and Grid Computing, 2002.
[16] K. Sripanidkulchai, B. M. Maggs, and H. Zhang. Efficient content location using interestbased
locality in peer-to-peer systems. In INFOCOM, 2003.
[17] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable
peer-to-peer lookup service for internet applications. In SIGCOMM, pages 149–160, 2001.
[18] J. G. Vaucher, G. Babin, P. G. Kropf, and T. Jouve. Experimenting with gnutella communities.
In Distributed Communities on the Web, 4th International Workshop, DCW 2002, Sydney,
Australia, April 3-5, 2002, Revised Papers, pages 84–99, 2002.
[19] B. Yang and H. Garcia-Molina. Efficient search in peer-to-peer networks. In ICDCS, pages
5–14, 2002.
[20] G. Zervas and S. M. Ruger. The curse of dimensionality and document clustering. IEE
Two-day Seminar. Searching for Information: Artificial Intelligence and Information Retrieval
Approaches, 1999.
[21] B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. Tapestry: a fault-tolerant wide-area application
infrastructure. Computer Communication Review, 32(1):81, 2002.