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

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

11 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)458-467
Journal / PublicationProceedings - International Conference on Data Engineering
Publication statusPublished - 1999

Conference

Title15th International Conference on Data Engineering (ICDE '99)
PlaceAustralia
CitySydney
Period23 - 26 March 1999

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.