Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Performance Evaluation of the Time-Stamp Ordering Algorithm in a Distributed Database
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Time-Stamp Ordering Algorithms in Database Systems: The Pure Restarts Case
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
A Queueing Model of Timestamp Ordering in a Distributed System
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Performance modelling of asynchronous replica distribution technique on distributed database systems
International Journal of Computer Mathematics - Distributed Algorithms in Science and Engineering
A resource allocation scheme for capacity improvement in the downlink of wideband CDMA networks
Computer Communications
Hi-index | 0.00 |
This paper is concerned with the minimisation of the update response time in distributed database systems (DDBS) where resequencing algorithms are used to preserve the consistency of the databases. The authors proposed a novel resequencing technique, in reference [7], namely hop-by-hop resequencing with batch processing for connecting the first stage to the second stage of a two-stage DDBS. In this paper, a stochastic upper bound is calculated for the system response time and it is shown that the system response is smaller than that for a one-stage system of the same size and parameters.