F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Journal of Distributed and Parallel Databases and Technology, 14(1):71--98, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Replica Consistency Algorithm For Globdata - Martins (2003) (Correct)
....grained, and allows for greater parallelism between transactions. Index locking was also modified, to avoid deadlocks with remote transactions. 2. 3 University of Minho s partial replication This work, described in [27] presents a replication algorithm that models the database as a state machine [21] (from now on refered to as DBSM approach) This model assumes that a transaction is first executed locally at a site, and interaction with other sites occurs only when the client requests for the transaction commit. At that time, the transaction s updates and some control structures are ....
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Technical Report SSC/1999.
Towards Robust Optimistic Approaches - Jimenez-Peris, Patino-Martinez (2003) (Correct)
....the high latency) This reluctance has prevented its widespread use in some contexts such as replicated databases. In this paper, we will focus on optimistic protocols for distributed databases [BHG87,LKS91] GHR97,BKS97] with special emphasis on those based on reliable multicast [KPAS99] [PGS,AT02,KA00a,JPAA01]. Typical measures of efficiency in an information system are throughput and response time. The latency introduced by reliable multicast, especially when total order and or uniformity are provided, can have a severe effect on these efficiency measurements. Thus, in practice, designers opt for ....
....what undermines scalability. This locking protocol is used to ensure one copy serializability. Recent advances in this area have shown that is possible to scale up by using an optimistic concurrency control method that serializes transactions according to the total delivery order of multicast [KA00a,PGS,KA00b]. These approaches extend former traditional optimistic concurrency control protocols [BHG87] with the use of total ordered multicast. In these new optimistic protocols a transaction is executed optimistically at a single site. The optimistic assumption is that transactions executed optimistically ....
F. Pedone, R. Guerraoui, and A. Schiper. The Database State Machine Approach. Journal of Distributed and Parallel Databases and Technology. to appear.
From Total Order to Database Replication - Amir, Tutu (2001) (18 citations) (Correct)
....to implement e cient lazy replication algorithms by using epidemic propagation [8, 14] or by exploiting application semantics [22] Atomic Broadcast [13] in the context of Virtual Synchrony [7] emerged as a promising tool to solve the replication problem. Several algorithms were introduced [29, 24, 25, 23] to implement replication 2 solutions based on total ordering. All these approaches, however, work only in the context of nonpartitionable environments. Keidar [16] uses the Extended Virtual Synchrony (EVS) 21] model to propose an algorithm that supports network partitions and merges. The ....
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Technical Report SSC/
Consistent Main-memory Database Federations under Deferred.. - Schmidt, Pedone (2005) Self-citation (Pedone) (Correct)
No context found.
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Journal of Distributed and Parallel Databases and Technology, 14(1):71--98, 2003.
Revisiting the Database State Machine Approach - Zuikeviciute, Pedone Self-citation (Pedone) (Correct)
No context found.
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Journal of Distributed and Parallel Databases and Technology, 14:71--98, 2002.
Partial Replication in the Database State Machine - Sousa, Pedone, Oliveira, Moura (2001) (3 citations) Self-citation (Pedone) (Correct)
....studies suggest that the additional cost of supporting partial replication can be mitigated through the use of Fast Atomic Broadcast. 1. Introduction Database replication protocols based on group communication primitives have recently been the subject of a considerable body of research [2, 18, 1, 19, 11, 16, 10, 6]. The reason for this stems from the adequacy of the order and atomicity properties of group communication primitives to implement synchronous replication (i.e. strong consistent) strategies. Unlike database replication schemes based on traditional transactional Research partially supported ....
....primitives to broadcast transactions to all replicas of the database. The approach allows the delegation of much of the synchronization complexity to the group communication layer and can accommodate different replication strategies. Most previous work related to group based database replication [2, 18, 1, 19, 11, 16, 10] considers full replication strategies, i.e. the whole database is available at every replica. This paper investigates the use of partial replication in the context of the Database State Machine (DBSM) 16] Partial replication is usually favored, or even required, by environments exhibiting ....
[Article contains additional citation context not shown here]
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Technical Report SSC/1999.
Semantically Reliable Group Communication - Pereira (2002) (Correct)
No context found.
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Journal of Distributed and Parallel Databases and Technology, 2002.
Evaluating Certification Protocols in the Partial Database State.. - Sousa (2003) (Correct)
No context found.
F. Pedone, R. Guerraoui, and A. Schiper. The database state machine approach. Technical Report SSC/1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC