A.W. Fu and D.W. Cheung, "A Transaction Replication Scheme for a Replicated Database with Node Autonomy," Proc. Very Large Data Bases Conf., pp. 214-225, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
PAN: Providing Reliable Storage in Mobile Ad Hoc Networks.. - Luo, Hubaux, Eugster (2003) (1 citation) (Correct)
....network (the servers are in black whereas the clients are in white) To reduce the complexity of our protocols, we consider a relaxed consistency model for the replicated data. More precisely, our protocols do not commit themselves to any message ordering, except FIFO order. The shared private [24] model can be a good example of the relaxed consistency. This type of data object is owned by a particular node. It can only be modified by that node but be shared with, i.e, read by, any other node. We can find many application examples of such a model in ad hoc networks, such as key management, ....
A.W. Fu and D.W. Cheung, "A transaction replication scheme for a replicated database with node autonomy," in Proc. of VLDB'94), 1994, pp. 214--225.
Data Replication for External Searching in Static Tree Structures - Hambrusch, Liu (2000) (Correct)
....all but one block contain exactly B nodes increases the blocknumber by at most 2. 1. INTRODUCTION Data replication allows better performance with increased availability of data. In static environments, data replication does not have to deal with maintaining consistency among multiple copies [1, 3, 6, 11, 13, 14]. Static environments dealing with large data sets arise frequently. They include environments in which updates happen at certain, chosen points in time and in bulk, and queries are not present at the time of updating. In this paper we show how to e ectively use data replication to improve ....
A. W.-C. Fu and D. W.-L. Cheung. A transaction replication scheme for a replicated database with node autonomy. In Proc. of 20th International Conference on Very Large Data Bases, pages 214-225, 1994.
Database Replication Techniques: a Three Parameter.. - Wiesmann, Pedone.. (2000) (27 citations) (Correct)
....is processed in a non deterministic way. The transaction is broadcast to all servers. Processing continues on all replicas. A voting termination phase takes place. Each replica terminates the transaction according to the voting protocol. References. As an example of this technique, in [11] the delegate server broadcasts a transaction to the other sites immediately when it is submitted and a total order broadcast is used (the total order being derived using synchronised clocks) Also here, the total order is used as a guideline at every site to serialise transactions. The final ....
A. W. Fu and D. W. Cheung. A transaction replication scheme for a replicated database with node autonomy. In Proceedings of the International Conference on Very Large Databases, Santiago, Chile, 1994.
Pilot: Probabilistic Lightweight Group Communication.. - Luo, Eugster, Hubaux (2004) (2 citations) (Correct)
No context found.
A.W. Fu and D.W. Cheung, "A Transaction Replication Scheme for a Replicated Database with Node Autonomy," Proc. Very Large Data Bases Conf., pp. 214-225, 1994.
PILOT: ProbabIlistic Lightweight grOup communication.. - Luo, Eugster, Hubaux (2003) (2 citations) (Correct)
No context found.
A.W. Fu and D.W. Cheung, "A transaction replication scheme for a replicated database with node autonomy," in Proc. of the 20th International Conference on Very Large Data Bases (VLDB'94), 1994, pp. 214--225.
Beyond 1-Safety and 2-Safety for replicated databases.. - Wiesmann, Schiper (2004) (Correct)
No context found.
Fu, A.W., Cheung, D.W.: A transaction replication scheme for a replicated database with node autonomy. In: Proceedings of the International Conference on Very Large Databases, Santiago, Chile (1994)
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