Research of multilevel transaction schedule algorithm based on transaction segments

Authors:
Hongbin Wang;Daxin Liu;Binge Cui
Affiliations:
College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, China;College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, China;College of Computer Science and Technology, Harbin Engineering University, Harbin, Heilongjiang, China
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 4
Cited 0

Maintaining multilevel transaction atomicity in MLS database systems with kernelized architecture

Results of the Sixth Working Conference of IFIP Working Group 11.3 on Database Security on Database security, VI : status and prospects: status and prospects
Correctness Criteria for Multilevel Secure Transactions

IEEE Transactions on Knowledge and Data Engineering
Transaction Processing in Multilevel Secure Databases with Kernelized Architecture: Challenges and Solutions

IEEE Transactions on Knowledge and Data Engineering
A Model of Atomicity for Multilevel Transactions

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new multilevel transaction schedule algorithm based on transaction segments is proposed as a high-ready-wait algorithm. A multilevel transaction is divided into several transaction segments. High security level transaction segments are executed if there aren’t any conflicted low security level transaction segments. Transaction segments are committed in an increasing order of security levels in multilevel transactions. This algorithm eliminates the read-firstly semantic dependency and write-firstly semantic dependency in multilevel transactions without using multi-version, so it can be implemented using un-trusted codes. The algorithm is described and proved that it is A-CIS-correct in this paper.