Abstract
Most operations in database (DB) is based on the deferred update replication technique, especially in distributed environments. In deferred update replication, transactions are executed on a single host and broadcast to other hosts at commit time. Upon delivering a transaction, each host confirms it to ensure a globally serializable execution. The mechanism is subject to CAP theorem in order to ensure data consistency and availability. This paper proposes a dependable cache query mechanism in distributed relational database (DRDB). The key insight of the cache query mechanism provides high performance, strong consistency and availability for mass connection systems. In addition to presenting the cache query mechanism, we elaborate its implementation, and provide an experiment and analysis of its performance.
Original language | English |
---|---|
Pages (from-to) | 457-461 |
Number of pages | 5 |
Journal | Applied Mathematics and Information Sciences |
Volume | 9 |
Issue number | 1 |
DOIs | |
State | Published - 01 2015 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2015 NSP Natural Sciences Publishing Cor. All Rights Reserved.
Keywords
- CAP theorem
- DRDB
- cache query mechanism
- mass connection systems