Improving Predictability of Transaction Execution Times in Real-time Databases

被引:0
作者
Rajeev Rastogi
S. Seshadri
Philip Bohannon
Dennis Leinbaugh
Avi Silberschatz
S. Sudarshan
机构
[1] Bell Laboratories,Computer Science and Engineering Dept.
[2] Indian Institute of Technology,undefined
来源
Real-Time Systems | 2000年 / 19卷
关键词
transactions; versioning; concurrency-control; aging; consistency; locking; timestamps; deadlines;
D O I
暂无
中图分类号
学科分类号
摘要
We present a design for multi-versionconcurrency control and recovery in a main memory database, anddescribe logical and physical versioning schemes that allowread-only transactions to execute without obtaining data itemlocks or system latches. Our schemes enable a system to providethe guarantee that updaters will never interfere with read-onlytransactions, and read-only transactions will not be delayeddue to data contention. Consequently, transaction executionsbecome more predictable—this partially alleviates a majorproblem in real-time database system (RTDBS) scheduling, namely,significant unpredictability in transaction execution times.As a result, in addition to a transaction's deadline, a moreaccurate estimate of its execution time can also be taken intoaccount, thus facilitating better scheduling decisions. Our contributionsinclude several space saving techniques for the main-memory implementation,including improved methods for logical aging of data items andthe introduction of physical aging for low-level structures.Some of these schemes have been implemented on a widely-usedsoftware platform within Lucent, and the full scheme is implementedin the Dalí main-memory storage manager.
引用
收藏
页码:283 / 302
页数:19
相关论文
共 20 条
[1]  
Bayer R.(1980)Parallelism and recovery in database systems ACMTrans. on Database Systems 5 139-156
[2]  
Heller H.(1983)Multiversion concurrency control — theory and algorithms ACM Transactions on Database Systems 8 465-483
[3]  
Reiser A.(1993)Value-based scheduling in real-time database systems VLDB Journal 2 117-152
[4]  
Bernstein P. A.(1980)Concurrent manipulation of binary search trees ACM Transactions on Database Systems 5 354-382
[5]  
Goodman N.(1992)An evaluation of Starburst's memory resident storage component IEEE Transactions on Knowledge and Data Engineering 4 555-566
[6]  
Haritsa J.(1993)Real-time databases International Journal of Distributed and Parallel Databases 1 199-226
[7]  
Carey M.(1990)System M: A transaction processing testbed for memory resident data IEEE Transactions on Knowledge and Data Engineering 2 161-172
[8]  
Livny M.(1988)Concurrent search structure algorithms ACM Transactions on Database Systems 13 53-90
[9]  
Kung H. T.(1988)On real-time transactions ACM Sigmod Record 17 4-18
[10]  
Lehman P. L.(undefined)undefined undefined undefined undefined-undefined