skip to main content
article
Free Access

Models of a very large distributed database

Published:01 August 1987Publication History
Skip Abstract Section

Abstract

The problems inherent in managing a database distributed over a very large number of sites are considered. The applications of such databases to the provision of telecommunications and other public services are discussed. It is shown that the distribution and maintenance of the directory information describing object locations poses some fundamental problems. A new partially informed class of distributed databases is described which distributes the directory information on a “needs-to-know” basis. The class is described by models of the network topology, and by the knowledge available to each site. These proposals are sufficiently general to support the partitioning of data relations into distribution fragments, and for those fragments to be replicated at multiple sites.

References

  1. 1 M. Blakey, Partially Informed Distributed Databases: Conceptual Framework And Knowledge Model, Tech. Rep. 80, Dept. of Comp. Science, Monash Univ., Melbourne, Australia, Dec., 1986.Google ScholarGoogle Scholar
  2. 2 M. Blakey, Partially Informed Distributed Databases: Data Location Algorithm, Tech. Rep. 87/85, Dept. of Comp. Science, Monash Univ., Melbourne, Australia, May, 1987.Google ScholarGoogle Scholar
  3. 3 C. Mohan, B. Lindsay and R. Obermarck, Transaction Management in the R* Distributed Data Base Management System, Report RJ 5037, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, Feb., 1986.Google ScholarGoogle Scholar
  4. 4 J. B. Rothnie, Jr., P. A. Bernstein, S. Fox, N. Goodman, M. Hammer, T. A. Landers, C. Reeve, D. W. Shipman and E. Wong, Introduction to a System for Distributed Databases (SDD-1), ACM Trans. on Database Sys. 5, 1, (t 980), 1-17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 S. Ceri and G. Pelagatti, Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 E. F. Codd, A Relational Model of Data for Large Shared Data Banks, Comm. ACM 13 , 6, (1970), 377-387. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 C. J. Date, An Introduction to Database Systems, Volume 1, 4th Edition, Addison-Wesley, Reading, Massachusetts, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 J. D. Ullman, Principles of Database Systems, Comp. Science Press, Roekville, Maryland, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 P. A. Bemstein and D. M. Chiu, Using Semi-joins to Solve Relational Queries, J. ACM 28, 1, (Jan. 1981), 25-40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 P. A. Bemstein, N. Goodman, E. Wong, C. L. Reeve and J. B. J. Rothnie, Query Processing in a System for Distributed Databases (SDD-1), ACM Trans. on Database Sys. 6,4, (1981), 602-625. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 A. Hevner and S. B. Yao, Query Processing in Distributed Database Systems, IEEE Trans. on Software Eng. SE-5 , 3, (May 1979), 177-187.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 P. M. G. Apers, A. R. Hevner and S. B. Yao, Optimization Algorithm for Distributed Queries, IEEE Trans. on Software Eng. SE-9 , 6, (Jan. 1983), 57-68, IEEE.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 D. M. Chiu and Y. C. Ho, A Methodology for Interpreting Tree Queries Into Optimal Semi-join Expressions, Proc. ACM SIGMOD International Conf. on Management of Data, Ann Arbor, Michigan, ACM, New York, Apr., 1980, 169-178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 W. Chu and P. Hurley, Optimal Query Processing for Distributed Database Systems, IEEE Trans. on Computers C-31 , 9, (Sep. 1982), 835-850.Google ScholarGoogle Scholar
  15. 15 S. Lafortune and E. Wong, A State Transition Model for Distributed Query Processing, ACM Tram. on Database Sys. 11,3, (Sep. 1986), 294-322. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Models of a very large distributed database

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGCOMM Computer Communication Review
          ACM SIGCOMM Computer Communication Review  Volume 17, Issue 5
          Oct./Nov. 1987
          397 pages
          ISSN:0146-4833
          DOI:10.1145/55483
          Issue’s Table of Contents
          • cover image ACM Conferences
            SIGCOMM '87: Proceedings of the ACM workshop on Frontiers in computer communications technology
            August 1987
            409 pages
            ISBN:0897912454
            DOI:10.1145/55482

          Copyright © 1987 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 August 1987

          Check for updates

          Qualifiers

          • article
        • Article Metrics

          • Downloads (Last 12 months)7
          • Downloads (Last 6 weeks)4

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader