Real-Time Data Access Control on B-Tree Index Structures
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 458-467 |
Journal / Publication | Proceedings - International Conference on Data Engineering |
Publication status | Published - 1999 |
Conference
Title | 15th International Conference on Data Engineering (ICDE '99) |
---|---|
Place | Australia |
City | Sydney |
Period | 23 - 26 March 1999 |
Link(s)
Abstract
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.
Citation Format(s)
Real-Time Data Access Control on B-Tree Index Structures. / Kuo, Tei-Wei; Wei, Chih-Hung; Lam, Kam-Yiu.
In: Proceedings - International Conference on Data Engineering, 1999, p. 458-467.
In: Proceedings - International Conference on Data Engineering, 1999, p. 458-467.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review