Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Achieving High Availability in Distributed Databases
IEEE Transactions on Software Engineering
Integrity versus security in multi-level secure databases
on Database Security: Status and Prospects
Database transaction models for advanced applications
Database transaction models for advanced applications
Synchronization with eventcounts and sequencers
Communications of the ACM
Concurrent reading and writing
Communications of the ACM
Non-serializable executions in heterogeneous distributed database systems
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Cryptography and data security
Cryptography and data security
A Paradigm for Concurrency Control in Heterogeneous Distributed Database Systems
Proceedings of the Sixth International Conference on Data Engineering
Modular concurrency control and failure recovery--consistency, correctness and optimality (transaction, database, distributed, operating systems)
Rewriting Histories: Recovering from Malicious Transactions
Distributed and Parallel Databases - Security of data and transaction processing
IEEE Transactions on Knowledge and Data Engineering
A practical mandatory access control model for XML databases
Information Sciences: an International Journal
Secure transaction management protocols for MLS/DDBMS
ICISS'07 Proceedings of the 3rd international conference on Information systems security
| Hi-index | 0.00 |
This paper investigates issues related to transaction concurrency control in multilevel secure databases. It demonstrates how the conflicts between the correctness requirements and the secrecy requirements can be reconciled by proposing two different solutions. This paper, first, explores the correctness criteria that are weaker than one-copy serializability. Each of these weaker criteria, though not as strict as one-copy serializability, is required to preserve database consistency in some meaningful way, and moreover, its implementation does not require the scheduler to be trusted. It proposes three different, increasingly stricter notions of serializability驴level-wise serializability, one-item read serializability and pair-wise serializability驴that can serve as substitutes for one-copy serializability. This paper, then, investigates secure concurrency control protocols that generate one-copy serializable histories and presents a multiversion timestamping protocol that has several very desirable properties: It is secure, produces multiversion histories that are equivalent to serial one-copy histories in which transactions are placed in a timestamp order, eliminates starvation, and can be implemented using single-level untrusted schedulers.