Results 221 to 230 of about 23,629 (265)
Some of the next articles are maybe not open access.
Unifying concurrency control and recovery of transactions
Information Systems, 1994Abstract Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery, which have been considered as orthogonal problems. Consequently, the correctness criteria derived for these problems are incomparable.
Gustavo Alonso +6 more
openaire +1 more source
TRANSACTION PROCESSING IN DISTRIBUTED CONTROL SYSTEMS
IFAC Proceedings Volumes, 1979Abstract While the flexibility of a process control system may be enhanced by modular design, the effectiveness of the system often depends upon coordination of the modules’ actions. The conflict between designing clearly bounded modules and providing for coupling between them gives rise to important design tradeoffs in two major areas: the ...
openaire +1 more source
Hybrid Transactional Memory with Pessimistic Concurrency Control
International Journal of Parallel Programming, 2010Transactional Memory (TM) intends to simplify the design and implementation of the shared-memory data structures used in parallel software. Many Software TM systems are based on writer-locks to protect the data being modified. Such implementations can suffer from the “privatization” problem, in which transactional and non-transactional accesses to the ...
Enrique Vallejo 0001 +7 more
openaire +2 more sources
Commit scope control in nested transactions
1996A common limitation of all the existing nested transaction models is that they only allow subtransactions to commit either to parent transactions or to databases. In order to adequately balance atomicity and concurrency at selected levels of a transaction hierarchy, the notion of scoped commitment is proposed, that allows a subtransaction to commit to ...
Qiming Chen, Umeshwar Dayal
openaire +1 more source
Concurrency control for resilient nested transactions
Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '83, 1983A formal framework is developed for proving correctness of algorithms which implement nested transactions. In particular, a simple "action tree" data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data.
openaire +1 more source
Redactable Transactions in Consortium Blockchain: Controlled by Multi-authority CP-ABE
Lecture Notes in Computer Science, 2021Zongyang Zhang +2 more
exaly
What can randomized controlled trials tell us about nutrition and cancer prevention?
Ca-A Cancer Journal for Clinicians, 1999T Byers
exaly
The impact of related party transactions on the operational performance of listed companies in China
Journal of Economic Policy Reform, 2009Chien-Hsun Chen
exaly