The week's pick
Random Articles
Reseach Article
Article:Processing of Query in Peer to Peer Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 9 - Number 6 |
| Year of Publication: 2010 |
| Authors: R.Saravanan |
10.5120/1391-1874
|
R.Saravanan . Article:Processing of Query in Peer to Peer Networks. International Journal of Computer Applications. 9, 6 ( November 2010), 12-16. DOI=10.5120/1391-1874
Abstract
DHT based peer to peer network system is a general range of query scheme. These schemes can support the range of query without modifying the underlying DHTs and they cannot guarantee to return the query results with bounded delay. The query delay in these schemes depends on both the scale of the system and the size of the query space. This paper, proposed Armada, an efficient range of query processing scheme to support the delay-bounded single-attribute and multiple-attribute range queries called Armada. Describe the order-preserving naming algorithms for assigning adjoining ObjectIDs to objects with close attribute values. The design of forwarding tree is to efficiently match the search paths of range queries to the underlying DHT topology. Based on the tree, two query processing algorithms are proposed respectively single-attribute and multiple attribute range queries within a bounded delay. Analytical and Simulation results shows that Armada is an effective general range query scheme on constant-degree DHTs and can return the query results within 2 logN hops in a P2P system with N peers, regardless of the queried range or the size of query space.
References
- . 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 Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM ’01, pp. 149-160, 2001.
- A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int’l Conf. Distributed Systems Platforms (Middleware ’01), pp. 329-350, Nov. 2001.
- K.C. Zatloukal and N.J.A. Harvey, “Family Trees: An Ordered Dictionary with Optimal Congestion, Locality, Degree, and Search Time,” Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA ’04), pp. 301-310, 2004.
- P. Ganesan, B. Yang, and H. Garcia-Molina, “One Torus to Rule Them All: Multidimensional Queries in P2P Systems,” Proc. Seventh Int’l Workshop Web and Databases (WebDB ’04), June 2004.
- B. Liu, W.C. Lee, and D.L. Lee, “Supporting Complex Multi- Dimensional Queries in P2P Systems,” Proc. 25th Int’l Conf. Distributed Computing Systems (ICDCS), 2005.
- H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, and A. Zhou, “VBI-Tree: A Peer-to-Peer Framework for Supporting Multi- Dimensional Indexing Schemes,” Proc. 22nd IEEE Int’l Conf.Data Eng. (ICDE), 2006.
- J.A. Orenstein and T.H. Merrett, “A Class of Data Structures for Associative Searching,” Proc. Third ACM SIGACT-SIGMOD Symp. Principles of Database Systems (PODS), 1984.
- G.S. Manku, “Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables,” Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC ’04), pp. 197-205, June 2004.
Index Terms
Keywords