Fine-grained sharing in a page server OODBMS
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Even though most commercial database management systems use pessimistic concurrency control in transaction processing systems, these approaches may restrict system throughput levels inconsistent with the available processing capacity. This paper suggests an efficient hybrid concurrency control scheme that uses a deadlock-free approach and ensures that transactions are re-started at most once. By the simulation-based analysis, we show that the proposed protocol outperforms than static hybrid protocol across all range of system and workload settings.