Email this article A Novel Approach For Large-Scale D ata Processing Platform On Peer- To- Peer Based Bestpeer++
Abstract
We introduce BestPeer++, a framework which conveys versatile information sharing administrations for corporate system applications in the cloud taking into account BestPeer—a distributed (P2P) based information administration stage. By incorporating distributed computing, database, and P2P innovations into one framework, BestPeer++provides a sparing, adaptable and versatile stage for corporate system applications and conveys information sharing administrations to members taking into account the broadly acknowledged pay-as-you-go plan of action. We assess BestPeer++ on Amazon EC2 Cloud stage. The benchmarking results demonstrate that BestPeer++ beats HadoopDB, an as of late proposed substantial scale information preparing framework, in execution when both frameworks are utilized to handle normal corporate system workloads.
References
K. Aberer, A. Datta, and M. Hauswirth, “Route Maintenance Overheads in DHT Overlays,” in 6th Workshop Distrib. Data Struct., 2004.
A. Abouzeid, K. Bajda-Pawlikowski, D.J. Abadi, A. Rasin, and A. Silberschatz, “HadoopDB: An Architectural Hybrid of MapReduce and DBMS Technologies for Analytical Workloads,” Proc. VLDB Endowment, vol. 2, no. 1, pp. 922-933, 2009.
C. Batini, M. Lenzerini, and S. Navathe, “A Comparative Analysis of Methodologies for Database Schema Integration,” ACM Computing Surveys, vol. 18, no. 4, pp. 323-364, 1986.
D. Bermbach and S. Tai, “Eventual Consistency: How Soon is Eventual? An Evaluation of Amazon s3’s Consistency Behavior,” in Proc. 6th Workshop Middleware Serv. Oriented Comput. (MW4SOC ’11), pp. 1:1-1:6, NY, USA, 2011.
B. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears, “Benchmarking Cloud Serving Systems with YCSB,” Proc. First ACM Symp. Cloud Computing, pp. 143-154, 2010.
G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo: Amazon’s Highly Available Key-Value Store,” Proc. 21st ACM SIGOPS Symp. Operating Systems Principles (SOSP ’07), pp. 205-220, 2007.
J. Dittrich, J. Quian_e-Ruiz, A. Jindal, Y. Kargin, V. Setty, and J. Schad, “Hadoop++: Making a Yellow Elephant Run Like a Cheetah (without it Even Noticing),” Proc. VLDB Endowment, vol. 3, no. 1/2, pp. 515-529, 2010.
H. Garcia-Molina and W.J. Labio, “Efficient Snapshot Differential Algorithms for Data Warehousing,” technical report, Stanford Univ., 1996.
Google Inc., “Cloud Computing-What is its Potential Value for Your Company?” White Paper, 2010.
R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, and I. Stoica, “Querying the Internet with PIER,” Proc. 29th Int’l Conf. Very Large Data Bases, pp. 321-332, 2003.
H.V. Jagadish, B.C. Ooi, K.-L. Tan, Q.H. Vu, and R. Zhang, “Speeding up Search in Peer-to-Peer Networks with a Multi-Way Tree Structure,” Proc. ACM SIGMOD Int’l Conf. Management of Data, 2006.
H.V. Jagadish, B.C. Ooi, K.-L. Tan, C. Yu, and R. Zhang, “iDistance: An Adaptive B+-Tree Based Indexing Method for Nearest Neighbor Search,” ACM Trans. Database Systems, vol. 30, pp. 364-397, June 2005.
H.V. Jagadish, B.C. Ooi, and Q.H. Vu, “BATON: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. 31st Int’l Conf. Very Large Data Bases (VLDB ’05), pp. 661-672, 2005.
A. Lakshman and P. Malik, “Cassandra: Structured Storage System on a P2P Network,” Proc. 28th ACM Symp. Principles of Distributed Computing (PODC ’09), p. 5, 2009.
W.S. Ng, B.C. Ooi, K.-L. Tan, and A. Zhou, “PeerDB: A P2P-Based System for Distributed Data Sharing,” Proc. 19th Int’l Conf. Data Eng., pp. 633-644, 2003.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.