A Two-tier Coarse Indexing Scheme for MLS Database Systems
暂无分享,去创建一个
In this paper, we propose a two-tier indexing scheme for multilevel secure database systems, primarily with the intent of improving query response time and reducing the storage required for indexing. At the bottom tier, our scheme requires separate single-level indices, one for each partition of the multilevel relation; at the top tier, our scheme requires a coarse multilevel index consisting of only those key values from the single-level indices that are necessary to direct a query to the appropriate single-level index. Our scheme seems suitable for both single-level and range queries. We prove this claim for B+trees by providing a detailed performance analysis for this index structure. We also give the algorithms for inserting and deleting key values, as well as for searching for a key value, in the proposed index structure.
[1] Günther Pernul,et al. Supporting Range Queries in Multilevel-Secure Databases , 1991, DBSec.
[2] S. B. Yao,et al. Efficient locking for concurrent operations on B-trees , 1981, TODS.
[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[4] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[5] Abraham Silberschatz,et al. Database System Concepts , 1980 .