Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Transaction management in an object-oriented database system
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Integrating concurrency control into an object-oriented database system
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
The notions of consistency and predicate locks in a database system
Communications of the ACM
The Jasmine Object Database: Multimedia Applications for the Web
The Jasmine Object Database: Multimedia Applications for the Web
Database System Concepts
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
A Revised Implicit Locking Scheme in Object-Oriented Database Systems
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Transformation Dataflow in Multimedia Software Engineering Using TAO_XML: A Component-Based Approach
MDIC '01 Proceedings of the Second International Workshop on Multimedia Databases and Image Communication
An Optimal Locking Scheme in Object-Oriented Database Systems
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Controlling Concurrent Accesses in an Object-Oriented Environment
Proceedings of the Second International Symposium on Database Systems for Advanced Applications
| Hi-index | 0.00 |
In this paper, we present a locking-based concurrency control scheme fof object-oriented database (OODBs). The proposed scheme deals with class hierarchies in OODBs. Our scheme is based on implicit locking but designed to require less locking overhead than implicit locking for all types of accesses to OODBs. Our scheme makes use of intelligent method to reduce locking overhead. Especially, our scheme utilize only structural information of OODBs so that extra information to reduce locking overhead is not necessary. We also prove theoretically that our scheme performs better than implicit locking.