Skip to main content

A Novel Binary Vote Assignment Grid Quorum Algorithm for Distributed Database Fragmentation

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 194))

Abstract

Data replication is one of the mechanisms in data grid architecture since it improves data access and reliability. Therefore, the storage, availability, and consistency are important issues to be addressed in order to allow distributed users efficiently and safely access data from many different sites. This paper propose a new algorithm namely Binary Vote Assignment on Grid Quorum (BVAGQ) in order to handle data replication and transaction management. We address how to build reliable system by using the proposed BVAGQ algorithm for distributed database fragmentation. The result show that managing replication and transaction through proposed BVAGQ able to prepare data consistency.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mat Deris, M., Abawajy, J.H., Taniar, D., Mamat, A.: Managing Data Using Neighbour Replication On A Triangular-Grid Structure. International Journal of High Performance Computing and Networking 6(1), 56–65 (2009)

    Article  Google Scholar 

  2. Mat Deris, M., Evans, D.J., Saman, M.Y., Noraziah, A.: Binary Vote Assignment on Grid for Efficient Access of Replicated Data. Int’l Journal of Computer Mathematics 80(12), 1489–1498 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Budiarto, S., Tsukamoto, M.: Data Management Issue Mobile and Peer-to-Peer Environment. Data and Knowledge Engineering 41, 183–204 (2002)

    Article  MATH  Google Scholar 

  4. José, M.P., Félix, G.C., Jesús, C., Alejandro, C., Javier, F.: Branch Replication Scheme: A New Model For Data Replicatio In Large Scale Data Grids. Computer Architecture Group, Computer Science Department, Universidad Carlos III de Madrid, Leganes, Madrid, Spain (2010)

    Google Scholar 

  5. Gifford, D.K.: Weighted Voting for Replicated Data. In: Proceeding 7th Symposium on Operating System Principles, pp. 150–162 (December 1979)

    Google Scholar 

  6. Chen, I.R., Wang, D.C., Chu, C.P.: Analyzing User-Perceived Dependability & Performance Characteristics Of Voting Algorithms For Managing Replicated Data. In: Distributed and Parallel Databases, pp. 199–219. Kluwer Academic Publisher, Boston (2003)

    Google Scholar 

  7. Agrawal, D., EI Abbadi, A.: The Generalized Tree Quorum Technique: An Efficient Approach For Managing Replicated Data. ACM Trans. Database Systems 17(4), 689–717 (1992)

    Article  MathSciNet  Google Scholar 

  8. Awerbuch, B., Tutu, C.: Maintaining Database Consistency In Peer-to-Peer Networks, Technical Report CNDS-2002-2 (2002)

    Google Scholar 

  9. Ahmad, N., Fauzi, A.A.C., Roslina, M. S., Zin, N.M., Beg, A.H.: Lowest Data Replication Storage of Binary Vote Assignment Data Grid. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds.) NDT 2010. Communications in Computer and Information Science, vol. 88, pp. 466–473. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Wikipedia, the free encyclopedia, Replication (computer science) (January 22, 2010), http://en.wikipedia.org/wiki/Replication_computer_science

  11. Noraziah, A., Mat Deris, M., Ahmed, N.A., Norhayati, R., Saman, M.Y., Zeyed, M.A.: Preserving Data Consistency Through Neighbour Replication On Grid Daemon. American Journal of Applied Science 4(10), 748–755 (2007)

    Google Scholar 

  12. ATLAS at the University of Chicago (2010), http://www.sciencedirect.com/science?_ob=RedirectURL&_method=externObjLink&_locator=url&_cdi=5638&_plusSign=%2B&_targetURL=http%253A%252F%252Fhep.uchicago.edu%252Fatlas%252F

  13. Thomas, C., Carolyn, B.: Database Systems A Practical Approach To Design, Implementation, and Management, 5th edn.

    Google Scholar 

  14. Tang, M., Lee, B.S., Tang, X., Yeo, C.K.: The Impact on Data Replication on Job Scheduling Performance in the Data Grid. International Journal Of Future Generation Of Computer Systems (22), 254–268 (2006)

    Google Scholar 

  15. Jin, H., Cortes, T., Buyya, R. (eds.): High Performance Mass Storage and Parallel I/O: Technologies and Applications. IEEE Press and Wiley (2002)

    Google Scholar 

  16. Mat Deris, M., Mamat, R., Noraziah, A., Suzuri, H.M.: High Service Reliability for Cluster Server Systems, pp. 280–287. IEEE Xplore (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Che Fauzi, A.A., Noraziah, A., Mohd Zin, N. (2011). A Novel Binary Vote Assignment Grid Quorum Algorithm for Distributed Database Fragmentation. In: Ariwa, E., El-Qawasmeh, E. (eds) Digital Enterprise and Information Systems. DEIS 2011. Communications in Computer and Information Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22603-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22603-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22602-1

  • Online ISBN: 978-3-642-22603-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics