Distributed and Parallel Databases

, Volume 3, Issue 1, pp 5–35 | Cite as

Partitioned data objects in distributed databases

  • G. Alonso
  • A. El Abbadi
Article
  • 37 Downloads

Abstract

In many distributed databases “locality of reference” is crucial to achieve acceptable performance. However, the purpose of data distribution is to spread the data among several remote sites. One way to solve this contradiction is to use partitioned data techniques. Instead of accessing the entire data, a site works on a fraction that is made locally available, thereby increasing the site's autonomy. We present a theory of partitioned data that formalizes the concept and establishes the basis to develop a correctness criterion and a concurrency control protocol for partitioned databases. Set-serializability is proposed as a correctness criterion and we suggest an implementation that integrates partitioned and non-partitioned data. To complete this study, the policies required in a real implementation are also analyzed.

Keywords

Partitioned data distributed databases concurrency control recovery 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Alonso, R. Vingralek, D. Agrawal, Y. Breitbart, A. El Abbadi, H.J. Schek, and G. Weikum, “A Unified Approach to Concurrency Control and Transaction Recovery,”Proceedings of the 4th International Conference on Extending Database Technology, EDBT'94. An extended version will appear in Information Systems, 1994.Google Scholar
  2. 2.
    R. Alonso, D. Barbara, and H. Garcia Molina, “Data Caching isues in an information retrieval system,”ACM Transactions on Database Systems, 15(3):359–384, September 1990.Google Scholar
  3. 3.
    D. Barbara and H. Garcia Molina, “The Demarcation Protocol: A technique for maintaining linear arithmetic constraints in distributed database systems,”3rd International Conference on Extending Database Technology, Vienna, Austria, pp. 373–387, March 1992.Google Scholar
  4. 4.
    P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987.Google Scholar
  5. 5.
    O.S.F. Carvalho and G. Roucairol, “On the distribution of an assertion,”Proceedings of the ACM-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, pp. 121–131, 1982.Google Scholar
  6. 6.
    P.K. Chrysanthis and K. Ramamrithan, “ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior,“ACM SIGMOD Conference, pp. 194–203, May 1990.Google Scholar
  7. 7.
    L. Golubchik and A. Thomasian, “Token allocation in distributed systems,”IEEE 12th International Conference on Distributed Computing Systems, Yokohama, Japan, 12:64–71, June 1992.Google Scholar
  8. 8.
    V. Hadzilacos, “A Theory of Reliability in Database Systems,”Journal of the ACM, 35(1):121–145, January 1988.Google Scholar
  9. 9.
    N. Krishnakumar and A.J. Bernstein, “High throuhput Escrow algorithms for replicated databases,”Proceedings of the 18th VLDB Conference, Vancouver, Canada, 18:175–186, August 1992.Google Scholar
  10. 10.
    A. Kumar, “An Analysis of Borrowing Policies for Escrow Transactions in a Replicated Data Environment,”Proceedings of the IEEE Conference on Data Engineering, pp. 446–454, 1990.Google Scholar
  11. 11.
    A. Kumar and M. Stonebraker, “Semantics based transaction management techniques for replicated data,”Proceedings of the ACM-SIGMOD International Conference on Management of Data, Chicago, pp. 117–125, 1988.Google Scholar
  12. 12.
    P. O'Neil, “The Escrow Transactional Method,”ACM Transactions on Database Systems, 11(4):405–430, December 1986.Google Scholar
  13. 13.
    H.-J. Schek, G. Weikum, and H. Ye, “Towards a unified theory of concurrency control and recovery,” Proceedings of the ACM Symposium on Principles of Database Systems, pp. 300–311, June 1993.Google Scholar
  14. 14.
    L. Sha, J.P. Lehoczky, and E.D. Jensen, “Modular concurrency control and failure recovery,”IEEE Transactions on Computers, 37(2):146–159, February 1988.Google Scholar
  15. 15.
    N. Soparkar and A. Silberschatz, “Data-Value Partitioning and Virtual Messages,”Proceedings of the Conference on Principles of Database Systems, pp. 357–367, 1990.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • G. Alonso
    • 1
  • A. El Abbadi
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta Barbara

Personalised recommendations