CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Analysis of Database Replication Algorithm in Local and Global Networks

by Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 84 - Number 6
Year of Publication: 2013
Authors: Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav
10.5120/14584-2816

Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav . Analysis of Database Replication Algorithm in Local and Global Networks. International Journal of Computer Applications. 84, 6 ( December 2013), 48-54. DOI=10.5120/14584-2816

@article{ 10.5120/14584-2816,
author = { Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav },
title = { Analysis of Database Replication Algorithm in Local and Global Networks },
journal = { International Journal of Computer Applications },
issue_date = { December 2013 },
volume = { 84 },
number = { 6 },
month = { December },
year = { 2013 },
issn = { 0975-8887 },
pages = { 48-54 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume84/number6/14584-2816/ },
doi = { 10.5120/14584-2816 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:00:15.852753+05:30
%A Sanjay Kumar Yadav
%A Gurmit Singh
%A Divakar Singh Yadav
%T Analysis of Database Replication Algorithm in Local and Global Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 84
%N 6
%P 48-54
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a database replication algorithm is presented. The main idea is to reduce the latency in database replication while maintaining very high throughput. The main points of the algorithm are detailed in this paper. Simulation results are presented to evaluate throughput and average delay. For the in-depth analysis of the algorithm, various cases are considered and it has been found that if the numbers of servers that can serve requests are larger in number then throughput is very high with very less average delay. The overall, throughput and average delay also depend heavily on the load and if load is comparatively less (< 0. 8) then the throughput is very high and average delay is nearly zero.

References
  1. Database Replication - Oracle Documentatio docs. oracle. com/cd/F49540_01/DOC/server. 815/a67781/c31repli. htm?
  2. Oracle Database 11g: Oracle Streams (Technical White Paper)www. oracle. com/technetwork/database/twp-streams-11gr1-134658. pdf?
  3. Introduction to Advanced Replication – Oracle Documentationdocs. Oracle. com/cd/B19306_01/server . 102/b14226/repoverview. htm
  4. Design Guide – Sybase infocenter. sybase. com/help/topic/com. sybase. infocenter. . . /design. pdf
  5. Practical Wide-Area Database Replication1 1. Introduction Y. Amir ww. cnds. jhu. edu/pub/papers/cnds-2002-1. ps?
  6. Bettina Kemme, Gustavo Alonso. 2010. Database Replication: A Tale of Research across Communities. VLDB, Vol. 3, No. 1.
  7. A. Dogan, 2009. A study on performance of dynamic file replication algorithms for real-time file access in data grids, Future Generation Computer Systems 25 (8): 829– 839 .
  8. R. S. Chang, P. H. Chen, 2007. Complete and Fragmented selection and retrieval in data grids, Future Generation Computer Systems, 23 : 536–546.
  9. Marius Cristian MAZILU,2010. "Database Replication", Database Systems Journal , 1(2), 33-38.
  10. Ratnasamy, S. ; Karp, B. ; Yin, L. ; Yu, F. ; Estrin, D. ; Govindan, R. ; Shenker, S. GHT. 2002. A Geographic Hash Table for Data-centric Storage. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, GA, USA, 28; pp. 78–87.
  11. Wiesmann, Pedone, Schiper, Kemme, Alonso. 2000. Understanding Replication in Databases and Distributed Systems. Proceedings of 20th International Conference on Distributed Computing Systems.
  12. Yair Amir, Claudiu Danilov, Michal Miskin-Amir, Jonathan Stanton and Ciprian Tutu. 2002. Practical Wide-Area Database Replication. Technical Report Johns Hopkins University, http://www. cnds. jhu. edu/publications.
  13. Y. Amir. Replication Using Group Communication Over a Partitioned Network. 1995. Ph. D. thesis, The Hebrew University of Jerusalem, Israel. www. cs. jhu. edu/~yairamir
  14. N. Saadat and A. M. Rahmani. 2012. PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids. Springer: Future Generation Computer Systems, vol 28, pp. 666-681.
  15. Sanjay Kumar Yadav, Gurmit Singh, Divakar Singh Yadav. 2013. Mathematical Framework for A Novel Database Replication Algorithm. International Journal of Modern Education and Computer Science (IJMECS), vol. 5, no. 9, pp. 1-10, DOI: 10. 5815.
Index Terms

Computer Science
Information Sciences

Keywords

Database Replication Throughput Average Delay

Powered by PhDFocusTM