25 search results - page 2 / 5 » Using importance of transactions and optimistic concurrency ... |
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency ...
ICEIS
2003
IEEE
13 years 10 months ago
2003
IEEE
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
PODS
1990
ACM
13 years 8 months ago
1990
ACM
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
VLDB
1991
ACM
13 years 8 months ago
1991
ACM
Due to its potential for a high degree of parallelism, optimistic concurrency control is expected to perform better than two-phase locking when integrated with priority-driven CPU...
ECRTS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper we present a concurrency control algorithm that allows co-existence of soft real-time, relational database transactions, and hard real-time database pointer transact...