Scheduling Value-Based Transactions in Real-Time Main-Memory Databases

Abstract

In a real-time database system, a transaction may be assigned a value to represent its worthiness if it is completed before the deadline. Some researches have been done on scheduling value-based transactions to maximize the total values of the executed transactions in disk-resident databases. However, no similar results have been done in a main memory database. This paper addresses the issue of scheduling value-based transactions in real-time main memory databases. The performance of various scheduling algorithms are evaluated and compared with different amounts of memory used to store partial databases. From the economic standpoint, a cost formula is developed to evaluate the optimal memory size for maximizing the profits. Some suggestions are given for scheduling valuebased transactions in real-time main memory databases. Some researches have been done on scheduling real-time transactions with different values [9-11, 16]. The main goal of the system shifts to maximize the totally ob...