Results 311 to 320 of about 304,318 (354)
Some of the next articles are maybe not open access.
2009
This chapter covers a wide range of issues relating to database concurrency control. The first section of the chapter presents the concept of a database transaction. It then examines problems that occur when multiuser databases operate without concurrency control, including lost updates, inconsistent analysis, dirty reads, nonrepeatable reads, and ...
openaire +3 more sources
This chapter covers a wide range of issues relating to database concurrency control. The first section of the chapter presents the concept of a database transaction. It then examines problems that occur when multiuser databases operate without concurrency control, including lost updates, inconsistent analysis, dirty reads, nonrepeatable reads, and ...
openaire +3 more sources
Concurrency Control by Versioning [PDF]
, 2014 All the concepts related to transactional isolation and concurrency control discussed in the previous chapters pertain to a single-version database model in which for each data item (identified by a unique key) in the logical database, only a single version, namely, the most recent or the current version , of the data item is available at any time ...
Seppo Sippu +2 more
openaire +1 more source
Distributed Concurrency Control
2011As we discussed in Chapter 10, concurrency control deals with the isolation and consistency properties of transactions. The distributed concurrency control mechanism of a distributed DBMS ensures that the consistency of the database, as defined in Section 10.2.2, is maintained in a multiuser distributed environment.
M. Tamer Özsu, Patrick Valduriez
openaire +2 more sources
The Complexity of Distributed Concurrency Control
SIAM Journal on Computing, 1981We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this framework. Our transactions are partially ordered sets of actions, as opposed to the straight-line programs of the centralized case. The concurrency control algorithm, or scheduler, is itself a distributed program.
Christos H. Papadimitriou +1 more
openaire +3 more sources
2005
This paper is a review of recent theoretical work on the problems which arise when many users access the same database. For a detailed exposition of this material, the interested reader is referred to a forthcoming monograph [Pa4].
openaire +2 more sources
This paper is a review of recent theoretical work on the problems which arise when many users access the same database. For a detailed exposition of this material, the interested reader is referred to a forthcoming monograph [Pa4].
openaire +2 more sources
The Complexity of Reliable Concurrency Control
SIAM Journal on Computing, 1985We define what it means for a schedule to be reliable, that is, correct in the face of possible transaction failures (assuming that aborting a transaction to restore correctness is not allowed). It turns out that the right definition is recursive, and surprisingly involved.
Mihalis Yannakakis +1 more
openaire +3 more sources
Transactions and Concurrency Control
2005Publisher Summary There is a handy mnemonic for the four characteristics wanted in a transaction: the ACID properties. The initials are an abbreviation for four properties that should be in a transaction processing system: atomicity, consistency, isolation, and durability. Concurrency control is the part of transaction handling that deals with the way
openaire +3 more sources
Verifiable concurrent programming using concurrency controllers
Proceedings. 19th International Conference on Automated Software Engineering, 2004., 2004We present a framework for verifiable concurrent programming in Java based on a design pattern for concurrency controllers. Using this pattern, a programmer can write concurrency controller classes defining a synchronization policy by specifying a set of guarded commands and without using any of the error-prone synchronization primitives of Java.
Tevfik Bultan, Aysu Betin-Can
openaire +2 more sources
Concurrent checking in dedicated controllers
Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2003A novel method for introducing online test facilities in a controller with a very low overhead is presented. This online test consists of detecting illegal paths in the control flow graph. These illegal paths may be due to either permanent faults or transient errors.
Leveugle, Régis, Saucier, G.
openaire +3 more sources
Concurrency control performance in DAYS
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access, 2003Through the use of broadcast, data may be retrieved by wireless users in an efficient manner. In this paper, we provide a description of our architecture, DAYS, which is designed to provide a flexible broadcast environment which allows clients to update the content of the broadcast.
Margaret H. Dunham, Ahmad S. Al-Mogren
openaire +2 more sources