Please use this identifier to cite or link to this item:
標題: 點對點網路下節點資料管理之研究
A Study on Peer Data Management Systems for P2P Networks
作者: 張耀燦
Chang, Yao-Tsan
關鍵字: Peer Data Management System
RDF Repository
Peer-to-Peer Networks
RDF 儲存庫
出版社: 資訊管理學系所
引用: [1] L.A. Adamic, R.M. Lukose, A.R. Puniyani, B.A. Huberman, “Search in power-law networks,” Physical Review E, vol. 64, 2001, pp. 046135-046143. [2] F. Banaei-Kashani, C. Shahabi, “Criticality-based analysis and design of unstructured peer-to-peer networks as complex systems,” Proceedings of the 3st International Symposium on Cluster Computing and the Grid, IEEE Computer Society, Washington, DC, USA, May 2003, pp. 351-358. [3] M. Cai and M. Frank, “RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network,” Proceedings of the 13th International Conference on World Wide Web, New York, NY, USA, 2004, pp. 650-657. [4] M. Cai, M. Frank, J. Chen and P. Szekely, “MAAN: A multi-attribute addressable network for grid information services,” Journal of Grid Computing, vol. 2, no. 1, 2004, pp. 3-14. [5] T. Gruber, “A translation approach to portable ontology specifications,” Knowledge Acquisition, vol. 5, no. 2, 1993, pp. 199-220. [6] T. Gu, H. K. Pung and D. Zhang, “A peer-to-peer overlay for context information search,” Proceeding of the 14th International Conference on Computer Communications and Networks, October 2005, pp. 395-400. [7] T. Gu, E. Tan, H. K. Pung and D. Zhang, “ContextPeers: scalable peer-to-peer search for context information,” Proceedings of International Workshop on Innovations in Web Infrastructure, Japan, May 2005. [8] P. Haase, R. Siebes and F. Harmelen, “Expertise-based peer selection in peer-to-peer networks,” Knowledge and Information Systems, vol. 15, no. 1, 2008, pp. 75-107. [9] M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker and I. Stoica, “Complex queries in DHT-based peer-to-peer networks,” Proceedings of First International Workshop on Peer to Peer Systems, Cambridge, MA, USA, March 2002, pp. 242-259. [10] J. Liu and H. Zhuge, “A semantic-based P2P resource organization model R-Chord,” Journal of Systems and Software, vol. 79, no. 11, 2006, pp. 1619-1631. [11] E. J. Lu, Y. F. Huang, and S. C. Lu, “ML-Chord: A multi-layered P2P resource sharing model,” Journal of Network and Computer Applications, vol. 32, no. 3, 2009, pp. 578-588. [12] W.Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst and A. Loser, “Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks,” Proceeding of the 12th International World Wide Web Conference, May 2003. [13] W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer and T. Risch, “Edutella: A P2P networking infrastructure based on RDF,” Proceedings of the 11th International Conference on World Wide Web, Honolulu, Hawaii, USA, 2002, pp. 604-615. [14] N. F. Noy, D. L. McGuinness, “Ontology development 101: a guide to creating your first ontology,” Technical Report KSL-01-05, Knowledge Systems Laboratory, Stanford University, Stanford, CA, 94305, USA, March 2001. [15] PeerSim, 2006. Available from: <>. [16] S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A scalable content-addressable network,” Computer Communication Review, vol. 31, no. 4, 2001, pp. 161-172. [17] RDFStore, 2006. Available from: <>. [18] Resource description framework. Available from: <>. [19] A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg Germany, November 2001, pp. 329-350. [20] C. Schmidt and M. Parashar, “Squid : Enabling search in DHT-based systems,” Journal of Parallel and Distributed Computing, vol. 68, no. 7, 2008, pp. 962-975. [21] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup protocol for internet applications,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, 2003, pp. 17-32. [22] B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, “Tapestry: A resilient global-scale overlay for service deployment,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, 2004, pp. 41-53. [23] H. Zhuge and L. Feng, “Distributed suffix tree overlay for peer-to-peer search,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 2, 2008, pp. 276-285.
摘要: 近年來,P2P技術已經漸漸地受到學術界與業界的重視,因此有越來越多的學者投入這方面的研究。目前已經有CAN、Pastry、Chord、Tapstry等許多P2P系統被提出來。然而,這類型的系統只能提供簡單的查詢。因此,有另一種類型的P2P系統被提出來,這類型的系統被稱之為PDMS (Peer Data Management System)。PDMS主要是利用metadata來對資源進行描述,不但使得對資源的描述變得更有彈性,也能支援複雜的查詢。不過大部分的PDMS依然是使用關鍵字進行查詢,只有少部分的PDMS是使用RDF進行查詢。因此,本論文提出了一個建構於ML-Chord架構下的分散式RDF儲存庫。主要作法是將節點依照本身所擁有的資源加入到適當的資源層中,查詢時只需要在適當的資源層當中進行搜尋,進一步提升了搜尋速度並降低了搜尋成本。
In recent years, peer-to-peer (P2P) computing has attracted much attention in both research and industrial communities. Many P2P systems have been proposed such as CAN, Pastry, Chord, Tapstry, etc., but they can only support exact-match lookups. There is a new arena of P2P research, called peer data management system (PDMS), they use metadata which provide great flexibility for annotating resources to describe the shared resources and can support complex queries. However, most of them use the keywords to locate the corresponding resources, and only a few of them can support RDF queries to retrieve the RDF documents that describe the requested resources. In this thesis, we propose a distributed RDF repository called RDF-Chord. In RDF-Chord, nodes are assigned into the appropriate ring sets based on the shared resources and a query is forward only to a subset nodes that stores the indexes of the requested resources by using the appropriate ring sets. Via detailed simulations, we show that our approach is highly scalable and can resolve RDF queries efficiently.
其他識別: U0005-1708200914541100
Appears in Collections:資訊管理學系



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.