Empirical Evaluation of Threshold and Time Constraint Algorithm for Non-replicated Dynamic Data Allocation in Distributed Database Systems

  • Conference paper
  • First Online:
Proceedings of the International Congress on Information and Communication Technology

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 439))

Abstract

Data allocation plays a significant role in the design of distributed database systems. Data transfer cost is a major cost of executing a query in a distributed database system. So the performance of distributed database systems is greatly dependent on allocation of data between the different sites of the network. The performance of static data allocation algorithms decreases as the retrieval and update access frequencies of queries from different sites to fragments changes. So, selecting a suitable method for allocation in the distributed database system is a key design issue. In this paper, the data allocation framework for non-replicated dynamic distributed database system using threshold and time constraint algorithm (TTCA) is developed and the performance of TTCA is evaluated against the threshold algorithm on the basis of total cost of reallocation and the number of migrations of fragments from one site to another site.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ceri, S., Pelagatti, G.: Distributed Databases: Principles & Systems. McGraw-Hill International Editions.

    Google Scholar 

  2. Ozsu, M., Valduriez, P.: Principles of Distributed Database Systems. Prentice Hall, second ed. 1999.

    Google Scholar 

  3. Rivera-Vega, P.I., Varadarajan, R., Navathe, S.B.: Scheduling Data Redistribution in Distributed Databases. In Proceedings of 6th International Conference on Data Engineering, pp.166–173, 5-9 February 1990.

    Google Scholar 

  4. Wilson, B., Navathe, S.B.: An Analytical Framework for the Redesign of Distributed Databases. In Proceedings of the 6th Advanced Database Symposium, pp. 77–83, 1986.

    Google Scholar 

  5. Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication Algorithm. ACM Trans. Database Systems, vol. 22, no. 2, pp. 255–314, 1997.

    Google Scholar 

  6. Brunstroml, A., Leutenegger, S.T., Simhal, R.: Experimental Evaluation of Dynamic Data Allocation Strategies in a Distributed Database with changing Workload. ACM Trans. Database Systems, 1995.

    Google Scholar 

  7. Chaturvedi, A., Choubey, A., Roan, J.: Scheduling the Allocation of Data Fragments in a Distributed Database Environment: A Machine Learning Approach. IEEE Trans. Eng. Management, vol. 41, no. 2, pp. 194–207, 1994.

    Google Scholar 

  8. Chin, A.: Incremental Data Allocation and Reallocation in Distributed Database Systems. Journal of Database Management, vol. 12, no. 1, pp. 35–45, 2001.

    Google Scholar 

  9. Lin, W.J, Veeravalli, B.: A Dynamic Object Allocation and Replication Algorithm for Distributed System with Centralized Control. International Journal of Computer and Application, vol. 28, no. 1, pp. 26–34, 2006.

    Google Scholar 

  10. Mei, A., Mancini, L., Jajodia, S.: Secure Dynamic Fragment and Replica Allocation in Large-Scale Distributed File Systems. IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 9, pp. 885–896, Sept. 2003.

    Google Scholar 

  11. Ulus, T., Uysal, M.: Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems. Pakistan Journal of Information and Technology, 2(3): pp. 231–239, 2003.

    Google Scholar 

  12. Singh, A., Kahlon, K.S.: Non-replicated Dynamic Data Allocation in Distributed Database Systems. International Journal of Computer Science and Network Security, VOL.9 No.9, pp. 176–180, September 2009.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arjan Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Arjan Singh (2016). Empirical Evaluation of Threshold and Time Constraint Algorithm for Non-replicated Dynamic Data Allocation in Distributed Database Systems. In: Satapathy, S., Bhatt, Y., Joshi, A., Mishra, D. (eds) Proceedings of the International Congress on Information and Communication Technology. Advances in Intelligent Systems and Computing, vol 439. Springer, Singapore. https://doi.org/10.1007/978-981-10-0755-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0755-2_15

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0754-5

  • Online ISBN: 978-981-10-0755-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation