i-manager Publications

Efficient data search in partially structured peer-to-peer network using aggregate queries and replication of database at certain nodes in the network.

Sweta Arya*

Electronics and Communication Department, Guru Gobind Singh Indraprastha University, Delhi, India.

Periodicity:July - September'2013
DOI : https://doi.org/10.26634/jwcn.2.2.2435

Abstract

Sweta Arya presents a novel method to find out the desired file in a partially structured local peer-to-peer network to authenticate each entry of data which are accessed by the user for future. A technique is evaluated to increasing the efficiency of search scheme by replicating the database at certain selected nodes which increase the availability of data. Data is replicated at the query node and become available for future transaction between peers. The application is designed with ASP.net in frontend and SQL server as backend. Speed of transfer of data is also improved due to efficient structuring in the database of system.

Keywords

Peer-O-Peer Network, Aggregate Query, Replication, Unstructured Network, Replicated Database, Flooding, Random Walk.

How to Cite this Article?

Arya, S. (2013). Efficient Data Search In Partially Structured Peer-To-Peer Network Using Aggregate Queries And Replication Of Database At Certain Nodes In The Network, i-manager’s Journal on Wireless Communication Networks. 2(2), 28-30. https://doi.org/10.26634/jwcn.2.2.2435

References

[1]. D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, and Z. Xu. (2002). Peer-to- Peer Computing. Technical Report HPL-2002-57.s

[2]. B. Yang and H. Garcia-Molina. (2002). Improving Search in Peer-to-Peer Networks. Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 5-14.

[3]. C. Gkantsidis, M. Mihail, and A. Saberi. (2004). Random Walks in Peer-to-Peer Networks. Proc. IEEE INFOCOM '04, pp. 120-130.

[4]. C. Gkantsidis, M. Mihail, and A. Saberi. (2005). Hybrid Search Schemes for Unstructured Peer-to-Peer Networks. Proc. IEEE INFOCOM '05, pp. 1526-1537.

[5]. Gnutella website. http://www.gnutella.com

[6]. Napster website. http://www.napster.com

[7]. Morpheus website. http://www.morpheus-os.com.

[8]. S. Saroiu, P.K. Gummadi, and S.D. Gribble. (2002), A Measurement Study of Peer-to-Peer File Sharing Systems. MMCN.

[9]. D. Tsoumakos and N. Roussopoulos. (2003, september). Adaptive Probabilistic Search for Peer-to-Peer Networks. Proc. Third Int'l Conf. Peer-to- Peer Computing (P2P '03), pp. 102-109.

[10]. Vicent Cholvi, Pascal Felber and Ernst Biersack. Efficient search in Unstructured peer-to-peer networks. Eurecom university, pp 1-11.

[11]. Yingwu Zhu and Haiying Shen. (2009). High search performance, small document Index: P2P search can have both. IEEE , 978-1-4244-4921-7, pp 312-321.

[12]. Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, (2003). “Modeling Peer-Peer File Sharing Systems,” Proc. IEEE INFOCOM '03, pp. 2188-2198.

[13]. S. Saroiu, P.K. Gummadi, and S.D. Gribble. (2002),. A Measurement Study of Peer-to-Peer File Sharing Systems. MMCN.

[14].George H.L. Fletcher, Hardik A. Sheth, and Katy Borner. (2005). Unstructured peer-to-peer networks: Topological properties and search performance. Springer-Verlag Berlin Heidelberg, AP2PC 2004, LNAI 3601, pp. 14-27.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.