Real-time data access control on B-tree index structures

被引：4

作者：

Kuo, TW ^{[1
]}

Wei, CH ^{[1
]}

Lam, KY ^{[1
]}

机构：

[1] Natl Chung Cheng Univ, Dept Comp Sci & Informat Engn, Chiayi 621, Taiwan

来源：

15TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS | 1999年

关键词：

D O I：

10.1109/ICDE.1999.754962

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 tvas evaluated by a series of experiments, for which we have some encouraging results.

引用

页码：458 / 467

页数：10

共 26 条

[1] Abbott R., 1988, Proceedings of the Fourteenth International Conference on Very Large Databases, P1
[2] ANDRESEN D, 1996, 3 FOR RES TECHN ADV, P139
[3] BAKER TP, 1990, IEEE 11 REAL TIM SYS
[4] BAYER R, 1977, ACTA INFORM, P9
[5] BESTAVROS A, 1997, REAL TIME DATABASE S
[6] CHOY DM, IEEE COMPCON, P291
[7] ELMASRI R, 1994, FUNDAMENTALS DATABAS
[8] GOYAL B, 1995, P 21 VLDB C, P146
[9] GROSSMAN R, 1995, IEEE S MASS STOR SYS, P89, DOI 10.1109/MASS.1995.528219
[10] HARITSA JR, 1990, PROCEEDINGS OF THE NINTH ACM SIGACT-SIGMOD-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, P331, DOI 10.1145/298514.298585

← 1 2 3 →