Real-Time Access Control and Reservation on B-Tree Indexed Dta

摘要

This paper proposes methodologies to control the access of B~+-tree-indexed data in a batch and firm real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B~+-tree-indexed data based on the non-real-time algorithms proposed in Kerttu, Eljas, and Tatu(1996) and the idea of priority inheritance (Sha, Rajkumar, and Lehoczky, 1990). We propose methodologies to reduce the number of disk I/O to improve the system performance without introducing more priority inversion.