Skip to main content

Availability and Reliability Issues in Distributed Databases Using Optimal Horizontal Fragmentation

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1677))

Included in the following conference series:

Abstract

In this paper, a horizontal fragmentation algorithm and a replication protocol that increases the availability and reliability are proposed and proven for a distributed database system. The first implements a previously proven vertical transaction-based algorithm that yields to an optimal number of fragments. The proposed horizontal algorithm substitutes the concept of attributes in the vertical problem by the predicates. The second algorithm, increases the availability and reliability by using a matrix log replicated at each site. Further, the system is fully maintained even during network partitioning and it remains operational as long as there is one available replica of an object. The latter algorithm minimizes the number of object replicas using an adaptive algorithm, and hence reduces the costs of message transfer, updates and storage.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ceri, M. Negri, G. Pelagatti, “Horizontal Data Partitioning in Database Design,” ACM, pp. 128–136, 1982.

    Google Scholar 

  2. S. Ceri, S. Navathe, G. Wiederhold, “Distribution Design of Logical Database Schemas,” IEEE Transactions on Software Engineering, vol. SE-9, no. 4, pp. 487–503, Jul. 1983.

    Article  Google Scholar 

  3. S. Navathe, S. Ceri, G. Wiederhold, J. Dou, “Vertical Partitioning Algorithms for Database Design,” ACM Transactions on Database Systems, vol. 9, no. 4, pp. 680–710, Dec. 1984.

    Article  Google Scholar 

  4. S. Ceri, G. Pelagetti, Distributed Databases: Principles and Systems, McGraw-Hill, 1984.

    Google Scholar 

  5. M. Herlihy, “Dynamic Quorum Adjustment for Partitioned Data”, ACM Transaction on Database Systems, vol. 12, no. 2, pp. 170–194, Jun 1987.

    Article  Google Scholar 

  6. P. M. G. Apers, “Data Allocation in Distributed Database Systems”, ACM Transaction on Database System, vol. 13, no. 3, pp. 263–304, Sept. 1988.

    Article  Google Scholar 

  7. H. M. Gladney, “Data Replicas in Distributed Information Services”, ACM Transaction on Database Systems, vol. 14, no. 1, pp. 75–97, Mar. 1989.

    Article  Google Scholar 

  8. A. E. Abbadi, S. Toueg, “Maintaining Availability in Partitioned Replicated Databases”, ACM Transaction on Database Systems, vol. 14, no. 2, pp. 246–290, Jun. 1989.

    Article  Google Scholar 

  9. S. B. Navathe, M. Ra, “Vertical Partitioning for database Design: a Graphical Algorithm,” ACM SIGMOD, pp. 440–450, Jun. 1989.

    Google Scholar 

  10. D. Agrawal, A. El Abbadi, “Storage Efficient Replicated Databases”, IEEE Transactions on Knowledge and Data Engineering, vol. 2, no.3, pp. 342–352, Sept. 1990.

    Article  Google Scholar 

  11. P. Triantafilou, D. TAYLOR, “Efficiently Maintaining Availability in the Presence of Partitionings in Distributed Systems”, IEEE, 1991.

    Google Scholar 

  12. D. Agrawal, A. El Abbadi, “The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data”, ACM Transactions on Database Systems, vol. 17, no. 4, pp. 689–717, Dec. 1992.

    Article  MathSciNet  Google Scholar 

  13. D. Bell, J. Grimson, Distributed Database Systems, Addison-Wesley Pub, 1992.

    Google Scholar 

  14. M. Ra, “Horizontal Partitioning for Distributed Database Design: a Graph-Based Approach”, Australasian Database Conference: Brisbane, pp. 101–120, 1993.

    Google Scholar 

  15. W. W. Chu, I. T. Ieong, “A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems,” IEEE Transactions on Software Engineering, vol. 19, no. 8, pp. 804–812, Aug. 1993.

    Article  Google Scholar 

  16. Y. Zhang, “On Horizontal Fragmentation of Distributed Database Design,” Australian Database Conference: Brisbane, pp. 121–130, 1993.

    Google Scholar 

  17. M. L. Liu, D. Agrawal, A. El Abbadi, “What Price Replication?”, Technical Report TRCS94-14, Computer Science Department, University of California, Santa Barbara, Jul. 1994.

    Google Scholar 

  18. S. Chakravarthy, J. Muthuraj, R. Varadarajian, S. B. Navathe, “An Objective Function for Vertically Partitioned Relations in Distributed Database and Its Analysis”, Distributed and Parallel Databases, vol. 2, pp. 183–207, 1994.

    Article  Google Scholar 

  19. P. Triantafilou, D. J. Taylor, “The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems”, IEEE Transaction on Software Engineering, vol. 21, no. 1, pp. 1–17, Jan. 1995.

    Article  Google Scholar 

  20. P. Triantafilou, D. J. Taylor, “VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems”, IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 2, pp. 305–321, Apr. 1996.

    Article  Google Scholar 

  21. M. Nicola, M. Jarkej, “Integration Replication and Communication in Performance Models of Distributed Databases”, Technical Report-Technical University of Aachen, Informatik V (Information Systems), Germany 1997.

    Google Scholar 

  22. K. Karlapalem, N. M. Pun, “Query Driven Data Allocation Algorithms for Distributed Database Systems”, Proceedings of the 8th Int’l Conference on Data and Expert Systems Application (DEXA), pp. 347–356, Sept. 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khalil, N., Eid, D., Khair, M. (1999). Availability and Reliability Issues in Distributed Databases Using Optimal Horizontal Fragmentation. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66448-2

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics