The authors propose real-time multiversion concurrency control algorithms to: i) increase concurrency, ii) adjust the serialization order dynamically, and iii) work without an estimate of a transaction's runtime. They also propose disk scheduling algorithms which consider not only the transactions which request input/output (I/O) but also those affected by I/O. The authors consider transactions which are directly affected when priorities of I/O requests are assigned, in addition to transactions which generates these requests. The real-time disk resident database system model and the multiversion concurrency control algorithms are described. The real-time disk scheduling algorithms and their properties are also described. Real-time multiversion concurrency control and disk scheduling algorithms are shown to decrease miss ratio significantly.