Skip to main content

Abstract

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.

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 169.00
Price excludes VAT (USA)
  • Available as 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 shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bellatreche, L., Karlapalem, K. and Simonet A., (2000), ‘Algorithms and support for horizontal class partitioning in object-oriented databases’,Distributed and Parallel Databases8(2), 155–179.

    Article  Google Scholar 

  2. 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 

  3. 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 

  4. Chinchwadkar, G. S. and Goh, A. (1999), ‘An overview of vertical partitioning in object oriented databases’,The Computer Journal 42(1).

    Google Scholar 

  5. 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 

  6. Ezeife, C. I. and Barker, K. (1995), ‘A comprehensive approach to horizontal class fragmentation in a distributed object based system’,Distributed and Parallel Databases 3(3), 247–272.

    Article  Google Scholar 

  7. Ezeife, C. I. and Barker, K. (1998), ‘Distributed object based design: Vertical fragmentation of classes’,Distributed and Parallel Databases 6(4), 317–350.

    Article  Google Scholar 

  8. 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 

  9. 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 

  10. Jain A. and Dubes R.. (1988)Algorithms for clustering Data. Prentice Hall Advanced Reference Series, Englewood Cliffs, NJ.

    MATH  Google Scholar 

  11. Lin X., Orlowska M., and Zhang Y.(1993) A graph based cluster approach for vertical partitioning in database design.Data an Knowlegde Engineering, 11:151-169.

    Article  MATH  Google Scholar 

  12. Ma, H. (2003), Distribution design in object oriented databases, Master’s thesis, Massey University.

    Google Scholar 

  13. 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 

  14. Navathe S., Ceri S., Wiederhold G., and Dou J. (1984) Vertical Partitioning %Algorithm for Database DesignACM Transactions on Database Systems, Vol. 9. [14]. Navathe S. and Ra M. (1989) Vertical Partitioning for Database Design: A %Graphical Algorithm.ACM SIGMOD, Portland.

    Google Scholar 

  15. 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 

  16. 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 

  17. Tamer O. and Valduriez P. (1999)Principles of Distributed Database Systems. Prentice Hall Englewood Cliffs, Second Edition, New Jersey 07362.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media B.V.

About this paper

Cite this paper

Runceanu, A. (2008). Fragmentation in distributed databases. In: Elleithy, K. (eds) Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8735-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-8735-6_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-8734-9

  • Online ISBN: 978-1-4020-8735-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics