|
|
|
 |
|
 |
|
Real-Time Data Access Control on B-Tree Index Structures
|
T.-W. Kuo,
C.-H. Wei,, and
K.-Y. Lam
View Paper (PDF)
Return to Session 13: Index Schemas I
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.
Copyright(C) 2000 ACM
|
|
|
|
|
|
|
