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
Data mining: concepts and techniques
Data mining: concepts and techniques
The Jasmine Object Database: Multimedia Applications for the Web
The Jasmine Object Database: Multimedia Applications for the Web
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
Automating Fine Concurrency Control in Object-Oriented Databases
Proceedings of the Ninth International Conference on Data Engineering
An Optimal Locking Scheme in Object-Oriented Database Systems
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Two Version Concurrency Control Algorithm with Query Locking for Decision Support
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
| Hi-index | 0.00 |
The decision support processing is essential in multimedia databases since it reveals valuable information from tremendous hidden data. In decision support environments, most transactions have long-term read operations accessing significant portions of database. In this sense, the traditional concurrency control schemes that are tuned to online transaction processing (OLTP) are not suitable for decision supporting environments since long transactions may cause serious locking overhead. In this paper, a locking-based concurrency control scheme is presented for decision support environments in multimedia databases. In this work, transactions are classified into two groups, the typical OLTP transaction and query transaction that is composed of read operation for decision support. Assuming that query transactions read considerable portions of whole database, the proposed scheme incurs less locking overhead than the existing scheme called explicit locking. This paper also proves that the proposed scheme performs better than the existing scheme.