Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1170–1174Cite as

Distributed Database Design

  • Reference work entry
  • First Online:

  • 51 Accesses

Synonyms

Data replication; Horizontal fragmentation; Vertical fragmentation

Definition

Distributed database design refers to the following problem: given a database and its workload, how should the database be split and allocated to sites so as to optimize certain objective function (e.g., to minimize the resource consumption in processing the query workload). There are two issues: (i) data fragmentation which determines how the data should be fragmented and (ii) data allocation which determines how the fragments should be allocated. While these two problems are interrelated, the two issues have traditionally been studied independently, giving rise to a two-phase approach to the design problem.

The design problem is applicable when a distributed database system has to be built from scratch. In the case when multiple existing databases are to be integrated (e.g., in multi-database context), there is no design issue.

Historical Background

In a distributed database system, relations are...

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.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

Learn about institutional subscriptions

Recommended Reading

  1. Ceri S, Negri M, Pelagatti G. Horizontal data partitioning in database design. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1982. p. 128–36.

    Google Scholar 

  2. Ceri S, Pelagatti G. Distributed databases: principles and systems. New York: McGraw-Hill; 1984.

    MATH  Google Scholar 

  3. Navathe S, Ceri S, Wiederhold G, Dou J. Vertical partitioning of algorithms for database design. ACM Trans Database Syst. 1984;9(4):680–710.

    Article  Google Scholar 

  4. Özsu MT, Valduriez P. Principles of distributed database systems. 2nd ed: Prentice-Hall; 1999.

    Google Scholar 

  5. Sacca D, Wiederhold G. Database partitioning in a cluster of processors. ACM Trans Database Syst. 1985;10(1):29–56.

    Article  MATH  Google Scholar 

  6. McCormick WT, Schweitzer PJ, White TW. Problem decomposition and data reorganization by a clustering techniqiue. Oper Res. 1972;20(5):993–1009.

    Article  MATH  Google Scholar 

  7. Chu WW. Optimal file allocation in a multiple computer network. IEEE Trans Comput. 1969;C-18(10):885–9.

    Article  MATH  Google Scholar 

  8. Apers PM. Data allocation in distributed database systems. ACM Trans Database Syst. 1988;13(2):263–304.

    Article  Google Scholar 

  9. Bell DA. Difficult data placement problems. Comput J. 1984;27(4):315–20.

    Article  MathSciNet  Google Scholar 

  10. Chang CC, Shieh JC. On the complexity of file allocation problem. In: Proceedings of the International Conference on the Foundations of Data Organization; 1985. p. 177–81.

    Google Scholar 

  11. Brunstrom A, Leutenegger ST, Simha R. Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads. In: Proceedings of the 4th International Conference on Information and Knowledge Management; 1995. p. 395–402.

    Google Scholar 

  12. Karlapalem K, Ng MP. Query-driven data allocation algorithms for distributed database systems. In: Proceedings of the 8th International Conference Database and Expert Systems Applications; 1997. p. 347–56.

    Google Scholar 

  13. Yoshida M, Mizumachi K, Wakino A, Oyake I, Matsushita Y. Time and cost evaluation schemes of multiple copies of data in distributed database systems. IEEE Trans Softw Eng. 1985;11(9):954–8.

    Article  Google Scholar 

  14. Muri S, Ibaraki T, Miyajima H, Hasegawa T. Evaluation of file redundancy in distributed database systems. IEEE Trans Softw Eng. 1995;11(2):199–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Singapore, Singapore, Singapore

    Kian-Lee Tan

Authors
  1. Kian-Lee Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kian-Lee Tan .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. Department of Computer Science, National University of Singapore, Singapore, Singapore

    Kian-Lee Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Tan, KL. (2018). Distributed Database Design. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_703

Download citation

Publish with us

Policies and ethics

Search

Navigation