Results 1 - 10 of 99

Replica Refresh Strategies in a Database Cluster

by Cecile Le Pape, Stephane Gancarski, Patrick Valduriez - in "Journées Bases de Données Avancées (BDA05 , 2005
"... We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we study the impact of refresh strategies on the query response time. Assuming mono-master lazy replication, we propose a model for refresh strategies and a workload g ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we study the impact of refresh strategies on the query response time. Assuming mono-master lazy replication, we propose a model for refresh strategies and a workload

Refresco: Improving Query Performance Through Freshness Control in a Database Cluster

by Cécile Le Pape , Stéphane Gançarski , Patrick Valduriez - In Int. Conf. On Cooperative Information Systems (CoopIS , 2004
"... Abstract. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying the requ ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Abstract. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying

Refresco: Improving Query Performance through Freshness Control in a Database Clus- ter

by Cécile Le, Pape Stéphane, Gançarski Patrick Valduriez
"... ABSTRACT. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying the requi ..."
Abstract - Add to MetaCart
ABSTRACT. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying

Providing High Availability Using Lazy Replication

by Rivka Ladin, Barbara Liskov , LIUBA SHRIRA, SANJAY GHEMAWAT , 1992
"... To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. For some applications a weaker causal operat ..."
Abstract - Cited by 166 (5 self) - Add to MetaCart
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. For some applications a weaker causal

Don't be lazy, be consistent: Postgres-R, A new way to implement Database Replication

by Bettina Kemme, Gustavo Alonso , 2000
"... Database designers often point out that eager, update everywhere replication suffers from high deadlock rates, message overhead and poor response times. In this paper, we show that these limitations can be circumvented by using a combination of known and novel techniques. Moreover, we show how ..."
Abstract - Cited by 185 (15 self) - Add to MetaCart
techniques. 1 Introduction Existing replication protocols can be divided into eager and lazy schemes [GHOS96]. Eager protocols ensure that changes to copies happen within the transaction boundaries. That is, when a transaction commits, all copies have the same value. Lazy replication protocols propagate

Lazy Replication: Exploiting the Semantics of Distributed Services

by Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat - IN IEEE COMPUTER SOCIETY TECHNICAL COMMITTEE ON OPERATING SYSTEMS AND APPLICATION ENVIRONMENTS , 1990
"... To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. In this paper, we propose lazy replication a ..."
Abstract - Cited by 91 (1 self) - Add to MetaCart
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. In this paper, we propose lazy replication

Lazy database replication with ordering guarantees

by Khuzaima Daudjee, Kenneth Salem - In Int. Conf. on Data Engineering (ICDE , 2004
"... Lazy replication is a popular technique for improving the performance and availability of database systems. Al-though there are concurrency control techniques which guarantee serializability in lazy replication systems, these techniques may result in undesirable transaction orderings. Since transact ..."
Abstract - Cited by 30 (1 self) - Add to MetaCart
Lazy replication is a popular technique for improving the performance and availability of database systems. Al-though there are concurrency control techniques which guarantee serializability in lazy replication systems, these techniques may result in undesirable transaction orderings. Since

Replicated Objects with Lazy Consistency

by Cristian Ionitoiu, Birger Andersen - Proc. Workshop Mobility and Replication, ECOOP ’95 , 1995
"... This paper describes the principles of lazy consistency in a general object model with replicated objects. The object model allows for active objects, locking of objects, three kind of invocations, and any number of replicas of an object. The main goal of our work is to develop a programming model f ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper describes the principles of lazy consistency in a general object model with replicated objects. The object model allows for active objects, locking of objects, three kind of invocations, and any number of replicas of an object. The main goal of our work is to develop a programming model

Semi-passive replication and lazy consensus

by Andre ́ Schiper - J. of Parallel and Distributed Computing , 2004
"... This paper presents two main contributions: semi-passive replication and Lazy Consensus. The former is a replication technique with parsimonious processing. It is based on the latter; a variant of Consensus allowing the lazy evaluation of proposed values. Semi-passive replication is a replication te ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
This paper presents two main contributions: semi-passive replication and Lazy Consensus. The former is a replication technique with parsimonious processing. It is based on the latter; a variant of Consensus allowing the lazy evaluation of proposed values. Semi-passive replication is a replication

A Scalable Distributed Information Management System

by Praveen Yalagandula, Mike Dahlin
"... We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building block for a broad range of large-scale distributed applications by providing detailed views of nearby information and summary ..."
Abstract - Cited by 192 (17 self) - Add to MetaCart
extensions to current DHT algorithms, and (4) achieves robustness to node and network reconfigurations through lazy reaggregation, on-demand reaggregation, and tunable spatial replication. Through extensive simulations and micro-benchmark experiments, we observe that our system is an order of magnitude more
Results 1 - 10 of 99