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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Ceri, M. Negri, G. Pelagatti, “Horizontal Data Partitioning in Database Design,” ACM, pp. 128–136, 1982.
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.
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.
S. Ceri, G. Pelagetti, Distributed Databases: Principles and Systems, McGraw-Hill, 1984.
M. Herlihy, “Dynamic Quorum Adjustment for Partitioned Data”, ACM Transaction on Database Systems, vol. 12, no. 2, pp. 170–194, Jun 1987.
P. M. G. Apers, “Data Allocation in Distributed Database Systems”, ACM Transaction on Database System, vol. 13, no. 3, pp. 263–304, Sept. 1988.
H. M. Gladney, “Data Replicas in Distributed Information Services”, ACM Transaction on Database Systems, vol. 14, no. 1, pp. 75–97, Mar. 1989.
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.
S. B. Navathe, M. Ra, “Vertical Partitioning for database Design: a Graphical Algorithm,” ACM SIGMOD, pp. 440–450, Jun. 1989.
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.
P. Triantafilou, D. TAYLOR, “Efficiently Maintaining Availability in the Presence of Partitionings in Distributed Systems”, IEEE, 1991.
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.
D. Bell, J. Grimson, Distributed Database Systems, Addison-Wesley Pub, 1992.
M. Ra, “Horizontal Partitioning for Distributed Database Design: a Graph-Based Approach”, Australasian Database Conference: Brisbane, pp. 101–120, 1993.
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.
Y. Zhang, “On Horizontal Fragmentation of Distributed Database Design,” Australian Database Conference: Brisbane, pp. 121–130, 1993.
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.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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