Vertical Partitioning Algorithms in Distributed Databases

  • M. E. Zorrilla
  • E. Mora
  • P. Corcuera
  • J. Fernández
Conference paper

DOI: 10.1007/10720123_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1798)
Cite this paper as:
Zorrilla M.E., Mora E., Corcuera P., Fernández J. (2000) Vertical Partitioning Algorithms in Distributed Databases. In: Kopacek P., Moreno-Díaz R., Pichler F. (eds) Computer Aided Systems Theory - EUROCAST’99. EUROCAST 1999. Lecture Notes in Computer Science, vol 1798. Springer, Berlin, Heidelberg

Abstract

Data distribution is a crucial problem affecting the cost and efficient use of these systems. The problem is further exacerbated by the lack of methods and support tools for the design of distributed databases. This paper outlines some of the main techniques currently used for data distribution, such as vertical partitioning and replication. Two vertical fragmentation methods are described, the classic NAVATHE method and the newer FURD method, as well as the two proposed in this paper, the FURD-FDEZ and the FURD WITH REPLICATION methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • M. E. Zorrilla
    • 1
  • E. Mora
    • 1
  • P. Corcuera
    • 1
  • J. Fernández
    • 1
  1. 1.Department of Applied Mathematics and Computer SciencesUniversity of CantabriaSantanderSpain

Personalised recommendations