skip to main content
10.1145/113413.113419acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free Access

Bounded ignorance in replicated systems

Published:01 April 1991Publication History
First page image

References

  1. ABG88.Alonso, R., Barbara, D., and Garcia-Molina, H. Quasi-Copies : Efficient data sharing for information retrieval systems. In Schmidt, 3.W., Ceri, S., and Missikoff, M., editors, Advances in Database Technology- EDBT 88 (LNCS 303), pages 443-468, Springer Verlag, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. BG90.Barbara, D. and Garcia-Molina, H. The case for controlled inconsistency in replicated data (position paper). In Proceedings of the IEEE Workshop on Replicated Data, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  3. BLNS82.Birrell, A. D., Levin, R., Needham, R. M., and Schroeder, M.D. Grapevine : An exercise in distributed computing. Communications of the A CM, 25(4):260-274, Apr. 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DLC87.Durfce, E.H., Lesser, V.R., and Corkill, D.D. Cooperation through communication in a distributed problem solving network. In Huhns, M.N., editor, Distributed ArtiJicial Intelligence, Morgan Kaufmann Publishers, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  5. EGLT76.Eswaran, K. P., Gray, 3. N., Loric, R. A., and Traiger, I. L. The notion of consistency and predicate locks in a database system. Communications of the ACM, 19(11):624- 633, Nov. 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. FM82.Fischer, M.//. and Michael, A. Sacrificing serializability to attain high availability of data in an unreliable network. In Proceedings of the A CM SIGA CT-SIGMOD Symposium on Principles of Database Systems, pages 70- 75, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Gar83.C#i#-Mol;.#. H. u.;#e #.,,#,,t;# k,,6#l_ edge for transact;on processing in a distributed database. A CM Transactions on Database Systems, 8(2):186-213, 3un. 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Her87.Heflihy, M.P. Concurrency vs. availability : Atomicity mechanisms for replicated data. A CM Transaction8 on Computer Systems, 5(3):249-274, Aug. 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. HHW89.Heddaya, A., Hsu, M., and Weild, W.E. Two phase gossip : Managing distributed event histories. Information Sciences, 49(1):35-57, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. HW87.Herlihy, M.P. and Wing, 3.M. Specifying graceful degradation in distributed systems. In Proceedings of the 6th Annual A CM Sympo. sium on Principles of Distributed Comput. ing, pages 167-177, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. KB90.Kfishnskumaz, N. and Bernstein, A. J. Bounded ignorance in replicated systems. Technical Report 90/29, SUNY st Stony Brook, 1990.Google ScholarGoogle Scholar
  12. KLS90.Korth, H. F., Levy, E., and Silberschstz, A. A Formal Approach to Recovery by Compensating Transactions. In Proceedings of the Sizteenth International Conference on Very Large Data Bases, pages 95-106, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. KPK89.Kim, J.H., Park, K.H., and Kim, M. A model of distributed control: dependency and uncertainty. Information Processing Letters, 30(1):73-77, Jan. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. KS88.Korth, H. and Speeg}e, G. Formal model of correctness without serializability. In Proceedings of the A CM SIGMOD International Conference on Management of Data, pages 70-75, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. LBS86.Lynch, N.A., Blaustein, B.T., and Siegel, M. Correctness Conditions for Highly Available Replicated Databases. In Proceedings oJ the 5th Annual A CM Symposium on Principles of Distributed Computing, pages 11-28, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. LLS88.Liskov, B., Lsdin, R., and Shfirs, L. A technique for constructing highly available distributed services. Algorithmica, 3:393-420, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. LLS90.Lsdin, R., Liskov, B. and Shrift. L. Lazy Replication : Exploiting the semantics of distributed services. In Proceedings of the 9th Annual A CM Symposium on Principles of Distributed Computing, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lyn83.Lynch, N.A. Multilevel atomic|ty- A new correctness criterion for database concurrency control. A CM Transactions on Database Systems, 8(4):484-502, Dec. 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Pai90.Paige, R. Symbolic finite differencing - Part I. In European Symposium on Programming, pages 36-56, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. QW86.Qian, X. and Wiedethold, G. Knowledgebased integrity constraint validation. In Proceedings of the Twelfth International Conference on Very Large Data Bases, pages 3-12, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sar86.Sazin, Sunil K. Robust application design in highly available distributed databases, in Proceedings of the Fifth Symposium on Reliability in Distributed Sofware and Database Systems, pages 87-94, 1986.Google ScholarGoogle Scholar
  22. SDR88.Satin, Sunil K., DeWitt, Mark, and Rosenburg, Ronni. Overview of SHARD ~ A system for highly available replicated data. Technical Report CCA-88-01, Computer Corporation of America, May 1988.Google ScholarGoogle Scholar
  23. SLJ88.Sha, L., Lehoczky, J. P., and 3ensen, E. D. Modular concurrency control and failure recovery. IEEE Transactions on Computers, 37(2):146-159, Feb. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. SS84.Schwarz, P. and Spector, .A. Synchronizing shared abstract types. A CM Transactions on Computer Systems, 2(3):223-250, Aug. 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. WB84.Wuu, G.T.3. and Bernstein, A. Efficient solutions to the replicated log and dictionary problems. In Proceedings of the 3rd Annual A CM Symposium on Principles of Distributed Computing, pages 233-244, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Wei88.Weihl, W.E. Commutafiv;ty-based concurrency control for abstract data types. IEEE Transactions on Computers, 37(12):1488- 1505, Dec. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Wei89.Weihl, W.E. Local atomicity properties ~ Modular concurrency control for abstract data types. A CM Transactions on Programmin9 Languages and Systems, 11(2):249-282, Apr. 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bounded ignorance in replicated systems

        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
        • Published in

          cover image ACM Conferences
          PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
          April 1991
          341 pages
          ISBN:0897914309
          DOI:10.1145/113413

          Copyright © 1991 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 April 1991

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate642of2,707submissions,24%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader