6 citations found. Retrieving documents...
D.Z. Badal. Correctness of concurrency control and implications for distributed databases. In Proceedings of the IEEE COMPSAC 79, Chicago, USA, November 1979.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
An Algebraic Approach to Transactional Processes - van Beek (2002)   (Correct)

....[14] This concurrency control technique is widely used in most database management systems. Many variations on the 2PL technique exist [1, 23, 17, 21] Apart from two phase locking, other concurrency control mechanisms exist, like timestamp ordering (TO) techniques [22] and optimistic schedulers [2]. All techniques can be combined into hybrid techniques, e.g. 2PL TO combinations [12] 9 Conclusions Both transactions and process algebra are widely used, however, as far as we know, no formalism to express transactions using process algebra has been developed before. In this paper we joined ....

D.Z. Badal. Correctness of concurrency control and implications for distributed databases. In Proceedings of the IEEE COMPSAC 79, Chicago, USA, November 1979.


A Unified Implementation of Concurrency Control and Recovery - Alonso, Agrawal, Abbadi (1993)   (3 citations)  (Correct)

....be reduced in H n01 and therefore they can also be reduced in H n . Hence, adding a i can not create new conflicts. Hence, we conclude that SOT is equivalent to PRED. 2 This characterization of PRED in terms of termination rules allows us to derive a serialization graph based testing protocol [Bad79, Cas81] for recognizing PRED executions. In particular, a scheduler would maintain the serialization graph and each time an operation is submitted, the appropriate nodes and edges are added to the graph. When a transaction T j wants to commit, the graph is tested for any active transactions T i such that ....

D. Z. Badal. Correctness of Concurrency Control and Implications in Distributed Databases. In IEEE Proceedings of COMPSAC Conference, pages 588--593, November 1979.


Unifying Concurrency Control and Recovery of Transactions - Alonso, Vingralek.. (1994)   (9 citations)  (Correct)

....manner, which hinders its use for the development of dynamic schedulers. Hence we develop a new definition, Serializability with Ordered Termination (SOT) which is procedural and is shown to be equivalent to PRED. Our characterization leads to extensions of traditional serialization graph testing [4, 12], two phase locking protocols [13] and timestamp ordering protocols, such that the extended protocols ensure both atomicity and serializability. This paper combines the results of [1] and [27] in which closely related results have been developed independently and in parallel. The rest of the ....

D. Z. Badal. Correctness of Concurrency Control and Implications in Distributed Databases. In IEEE Proceedings of COMPSAC Conference, pages 588--593, November 1979.


Relative Serializability: An Approach for Relaxing .. - Agrawal, Bruno.. (1994)   (11 citations)  (Correct)

....by our assumption. Therefore S rs is relatively serial. 2 The relative serialization graph provides an efficient (polynomial) method for recognizing relatively serializable schedules. This graph can be used as the basis for a concurrency control protocol similar to serialization graph testing [Bad79, Cas81] We are currently investigating locking protocols for ensuring relative serializability of transactions with relative atomicity. 4 Related Work The relative atomicity model is a generalization of the traditional absolute atomicity model. In particular, our model retains the standard ....

D. Z. Badal. Correctness of Concurrency Control and Implications in Distributed Databases. In IEEE Proceedings of COMPSAC Conference, pages 588--593, November 1979.


Abstractions for Constructing Dependable Distributed Systems - Mishra, Schlichting (1992)   (10 citations)  (Correct)

.... according to the logical global time at which the actions start (see Section 3) Timestamps can also be used to avoid deadlocks in the two phase locking scheme [RSL78] Another approach maintains a dynamic graph of how different actions are accessing various shared resources at any point in time [Bad79, Cas81, HY86] This graph contains a node for each action that is currently executing, as well as a node for actions that have committed. The edges between nodes specify dependencies between actions, and serializability is guaranteed by ensuring that the graph always remains acyclic. The ....

D. Z. Badal. Correctness of concurrency control and implications in distributed databases. In Proceedings of IEEE COMPSAC Conference, pages 588--593, Nov 1979.


Network-Aided Concurrency Control in Distributed Databases - Srinivasa (2002)   (1 citation)  (Correct)

No context found.

BADA79 Badal D. Z., Correctness of Concurrency Control and Implications in Distributed Databases, Proceedings of COMPSAC 79 Conference, Nov 1979.

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