Sciweavers

17 search results - page 2 / 4
» Dynamic Real-Time Optimistic Concurrency Control
Sort
View
PODS
1990
ACM
150views Database» more  PODS 1990»
13 years 9 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
RTSS
1994
IEEE
13 years 9 months ago
Timeliness via Speculation for Real-Time Databases
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 ...
Azer Bestavros, Spyridon Braoudakis
RTAS
1999
IEEE
13 years 9 months ago
MIRROR: A State-Conscious Concurrency Control Protocol for Replicated Real-Time Databases
Data replication can help database systems meet the stringent temporal constraints of current time-critical applications, especially Internet-based services. A prerequisite, howev...
Ming Xiong, Krithi Ramamritham, Jayant R. Haritsa,...
RTSS
1990
IEEE
13 years 9 months ago
Concurrency Control in Real-Time Databases by Dynamic Adjustment of Serialization Order
Time-critical scheduling in real-time database systems has two components: real-time transaction scheduling,which is related to task scheduling in realtime operating systems, and ...
Yi Lin, Sang Hyuk Son
RTCSA
2000
IEEE
13 years 9 months ago
Extensions to optimistic concurrency control with time intervals
Although an optimistic approach has been shown to be better suited than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and h...
Jan Lindström