Fragmentation in distributed databases
The design of distributed database is an optimization problem and the resolution of several sub problems as data fragmentation (horizontal, vertical, and hybrid), data allocation (with or without redundancy), optimization and allocation of operations (request transformation, selection of the best execution strategy, and allocation of operations to sites). There are some different approaches to solve each problem, so this means that the design of the distributed databases is become hard enough. There are many researches connected to the dates fragmentation and they are presented both in the case of relational database and in the case of object-oriented database. In this paper is presented the implementation of a heuristic algorithm conceived before that uses an objective function who takes over information about the administrated dates in a distributed database and it evaluates all the scheme of the database vertical fragmentation.
KeywordsPartition Scheme Database Design Access Cost Vertical Partitioning Distribute Database System
Unable to display preview. Download preview PDF.
- Ceri S., Pernici S., and Weiderhold G. (1989) Optimization Problems and Solution Methods in the Design of Data distribution.Information Sciences Vol. no. 3 , p 261-272.Google Scholar
- Chakravarthy S., Muthuraj R., Varadarajan R., and Navathe S. (1994) An objective function for vertically partitioning relations in distributed databases and its analysis. InDistributed and parallel databases, pages 183-207. Kluwer Academic Publishers.Google Scholar
- Chinchwadkar, G. S. and Goh, A. (1999), ‘An overview of vertical partitioning in object oriented databases’,The Computer Journal 42(1).Google Scholar
- Cornell D., and Yu P. (1987) A Vertical Partitioning Algorithm for Relational Databases.Proc. Third International Conference on Data Engineering,pp. 30-35.Google Scholar
- Hammer N. and Niamir B. (1979), A heuristic aproach to attribute partitioning.In Proceedings ACM SIGMOD Int. Conf. on Management of Data,(Boston, Mass.), ACM, New York.Google Scholar
- Hoffer J. and Severance D.(1975) The Uses of Cluster Analysis in Physical Database DesignIn Proc. 1st International Conference on VLDB,Framingham, MA pp. 69 - 86.Google Scholar
- Ma, H. (2003), Distribution design in object oriented databases, Master’s thesis, Massey University.Google Scholar
- Malinowski, E. and Chakravarthy, S. (1997), Fragmentation techniques for distributing object-oriented databases, inD. W. Embley&R. C. Goldstein, eds, ‘Conceptual Modeling - ER ‘97’, Vol. 1331 ofLecture Notes in Computer Science, Springer, pp. 347–360.Google Scholar
- Navathe S., Ceri S., Wiederhold G., and Dou J. (1984) Vertical Partitioning %Algorithm for Database DesignACM Transactions on Database Systems, Vol. 9. . Navathe S. and Ra M. (1989) Vertical Partitioning for Database Design: A %Graphical Algorithm.ACM SIGMOD, Portland.Google Scholar
- Navathe S.B., Ra M. Vertical partitioning for database design : A graphical algorithm. InProceedinds of ACM SIGMOD International Conference on Management of Data ‘89.Google Scholar
- Schewe, K.-D. (2002), Fragmentation of object oriented and semi-structured data, in H.-M. Haav&A. Kalja, eds,‘Databases and Information Systems II’, Kluwer Academic Publishers, pp. 1– 14.Google Scholar
- Tamer O. and Valduriez P. (1999)Principles of Distributed Database Systems. Prentice Hall Englewood Cliffs, Second Edition, New Jersey 07362.Google Scholar