Real-Time Data Access Control on B-Tree Index Structures

This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-tree-indexed data based on non-real-time algorithms in [12] and the idea of priority inheritance [23]. We propose methodologies to reduce the number of disk I/O's to improve the system performance without introducing more priority inversion. The performance of our methodologies was evaluated by a series of experiments, for which we have some encouraging results.

• Type: Conference
• Year: 1999
• Where: ICDE
• Authors: Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
• Keywords: Database, ICDE 1999, Paper Proposes Methodologies, Priority Inversion, Rebalance B-tree-indexed Data