A Peer-To-Peer Data Processing Infrastructure That Operates On The Largest Scale



In the corporate network, information may be exchanged throughout different businesses, making it simpler for those with common interests to collaborate. With its help, firms may be able to reduce overhead costs and increase revenue. As data is exchanged and processed across firms, it increases the complexity of implementing a scalable, high-performing, and secure data management system. This article presents BP++, an expansion of the BestPeer P2P data management platform that offers elastic data sharing services for cloud-based business network applications. BP++ integrates cloud computing, databases, and P2P technologies to provide its members with data sharing services under the well-known pay-as-you-go pricing model. For our BP++ tests, we make use of Amazon's EC2 cloud infrastructure. Benchmarks show that BP++ outperforms the recently proposed HadoopDB large-scale data processing solution when both systems are employed to handle typical business network demands. The results demonstrate that BP++ is quite efficient, with throughput scaling practically linearly with the number of peer nodes.


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.

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.

V. Poosala and Y.E. Ioannidis, “Selectivity Estimation without the Attribute Value Independence Assumption,” Proc. 23rd Int’l Conf. Very Large Data Bases (VLDB ’97), pp. 486-495, 1997.

M.O. Rabin, “Fingerprinting by Random Polynomials,” Technical Report TR-15-81, Harvard Aiken Computational Laboratory, 1981.

E. Rahm and P. Bernstein, “A Survey of Approaches to Automatic Schema Matching,” The VLDB J., vol. 10, no. 4, pp. 334-350, 2001.

H.T. Vo, C. Chen, and B.C. Ooi, “Towards Elastic Transactional Cloud Storage with Range Query Support,” Proc. VLDB Endowment, vol. 3, no. 1, pp. 506-517, 2010.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.