C. Pu. Relaxing the limitations of serializable transactions in distributed systems. In Proceedings of the 5th ACM SIGOPS European Workshop, August 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Database Support for Evolving Data in Product Design - Posselt, Hillebrand (Correct)
....semantics along with the transactions themselves. That, in our view, is a bad tradeoff; the consistency guarantees and semantics of a database system should be as simple as possible. A much less drastic modification of the classic ACID paradigm is the notion of ffl serializability, introduced in [9] as a means of trading precision for concurrency. ffl seriali zability is applicable to data that possess a numerically quantifiable degree of uncertainty, and it extends ordinary serializability by permitting transaction histories whose results differ (according to a suitable metric) by no ....
C. Pu. Relaxing the limitations of serializable transactions in distributed systems. In Proceedings of the 5th ACM SIGOPS European Workshop, August 1992.
Object-based Semantic Real-time Concurrency Control - Wolfe, Cingiser (1993) (13 citations) (Correct)
.... are enforced through techniques such as those that employ user defined compatibility sets of transactions [GM83] Epsilonserializability provides increased concurrency by allowing each transaction to define its own limits on the amount of inconsistency that it may view and that it may write [Pu93]. Data temporal consistency correctness criteria can range from no temporal constraints to requiring absolute temporal consistency and or relative temporal consistency of data. Absolute temporal consistency is maintained only if the data s value is updated within a specified time interval (so as ....
Carlton Pu. Relaxing the limitations of serializable transaction in distributed systems. Operating Systems Review, 27(2):66--71, April 1993.
Building Secure and Reliable Network Applications - Birman (1996) (121 citations) (Correct)
....as extensions to the transactional model to improve its usefulness in settings such as these. 21.5. 1 Epsilon serializability Originally proposed by Pu, this is a model in which a pre agreed strategy is used to limit the possible divergence between a primary database and its remote replicas [Pu93]. The epsilon refers to the case where the database contains numeric data, and it is agreed that any value read by a transaction is within e of the correct one. For example, suppose that a remote transaction is executed to determine the current value of a bank balance, and the result obtained ....
Calton Pu. Relaxing the Limitations of Serializable Transactions in Distributed Systems. Operating Systems Review 27:2 (special issue on the Workshop on Operating Systems Principles at Le. Mont St. Michel), 66-71. April 1993.
Issues in the design of a scalable shared virtual.. - Lea, Honda.. (1997) (8 citations) (Correct)
....databases (or proxies) in a coherent manner in the face of message failures and unbounded delays is a significant problem and one on which there has been much work in the research community. This includes work on message based systems [2] 4] and work that focuses on distributed memory [3] [10] [11] However, in most cases the work either does not scale, or will scale only if we accept a performance overhead or significant delay. We have started to address the scaling issue by partial replication through spatial auras, however we still need to provide conistency mechanims. Our basic ....
Pu, C. Relaxing the limitations of serializable transactions in distributed systems. Proceedings of the 5th ACM European Workshop, Le Mont St Michel, France. Operating Systems Review Vol. 27. No. 2 pp. 66-71. ACM press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC