Data caching issues in an information retrieval system
ACM Transactions on Database Systems (TODS)
Weak-consistency group communication and membership
Weak-consistency group communication and membership
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Partitioned data objects in distributed databases
Distributed and Parallel Databases
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Things every update replication customer should know (abstract)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Protocols for Integrity Constraint Checking in FederatedDatabases
Distributed and Parallel Databases
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Replication Techniques in Distributed Systems
Replication Techniques in Distributed Systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Deferred Updates and Data Placement in Distributed Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Using History Information to Process Delayed Database Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Extending Logging for Database Snapshot Refresh
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Managing Semantic Heterogeneity with Production Rules and Persistent Queues
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Improving Performance in Replicated Databases through Relaxed Coherency
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract)
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
The Management of Interdependent Asynchronous Transactions in Heterogeneous Database Environments
Proceedings of the 4th International Conference on Database Systems for Advanced Applications (DASFAA)
A Uniform Reliable Multicast Protocol with Guaranteed Response Times
LCTES '98 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
A FIFO worst case analysis for a hard real-time distributed problem with consistency constraints
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Improving Data Freshness in Lazy Master Schemes
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Using Broadcast Primitives in Replicated Databases
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Parallel Processing with Autonomous Databases in a Cluster System
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Lazy Database Replication with Ordering Guarantees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Adaptive middleware for data replication
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Postgres-R(SI): Combining Replica Control with Concurrency Control Based on Snapshot Isolation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Middleware based data replication providing snapshot isolation
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fine-grained replication and scheduling with freshness and correctness guarantees
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Preventive Replication in a Database Cluster
Distributed and Parallel Databases
The leganet system: Freshness-aware transaction routing in a database cluster
Information Systems
Online recovery in cluster databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Adaptive hybrid partitioning for OLAP query processing in a database cluster
International Journal of High Performance Computing and Networking
Consistency-aware evaluation of OLAP queries in replicated data warehouses
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Database replication: a tale of research across communities
Proceedings of the VLDB Endowment
Scaling up the preventive replication of autonomous databases in cluster systems
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
In a lazy master replicated database, a transaction can commit after updating one replica copy (primary copy) at some master node. After the transaction commits, the updates are propagated towards the other replicas (secondary copies), which are updated in separate refresh transactions. A central problem is the design of algorithms that maintain replica's consistency while at the same time minimizing the performance degradation due to the synchronization of refresh transactions. In this paper, we propose a simple and general refreshment algorithm that solves this problem and we prove its correctness. The principle of the algorithm is to let refresh transactions wait for a certain “deliver time” before being executed at a node having secondary copies. We then present two main optimizations to this algorithm. One is based on specific properties of the topology of replica distribution across nodes. In particular, we characterize the nodes for which the deliver time can be null. The other improves the refreshment algorithm by using an immediate update propagation strategy.