Real-Time Access Control and Reservation on B-Tree IndexedData
Real-Time Systems
B+ retake: sustaining high volume inserts into large data pages
Proceedings of the 4th ACM international workshop on Data warehousing and OLAP
Evaluation of concurrency control strategies for mixed soft real-time database systems
Information Systems - Databases: Creation, management and utilization
Amortized Complexity of Bulk Updates in AVL-Trees
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Single and bulk updates in stratified trees: an amortized and worst-case analysis
Computer Science in Perspective
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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.