|
ABSTRACT
In a replicated database, a data item may have copies residing on several sites. A replica control protocol is necessary to ensure that data items with several copies behave as if they consist of a single copy, as far as users can tell. We describe a new replica control protocol that allows the accessing of data in spite of site failures and network partitioning. This protocol provides the database designer with a large degree of flexibility in deciding the degree of data availability, as well as the cost of accessing data.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
 |
3
|
|
| |
4
|
|
| |
5
|
CHEUNG, D., AND KAMEDA, W. Optimal decentralized termination protocols for partition failures. LCCR TR 86-1, Laboratory for Computer and Communication Research, Simon Fraser Univ., Burnaby, B.C., Canada, Jan. 1986.
|
| |
6
|
CHUNG-KUO, C., AND GOUDA, M. Independent recovery. In Proceedings of the 6th Symposium on Relaibility in Distiributed Software and Database Systems (Williamsburg, Va. Mar. 1987). IEEE, New York, 1987, pp. 93-104.
|
 |
7
|
Brian A Coan , Brian M Oki , Elliot K Kolodner, Limitations on database availability when networks partition, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.187-194, August 11-13, 1986, Calgary, Alberta, Canada
[doi> 10.1145/10590.10606]
|
 |
8
|
|
 |
9
|
|
| |
10
|
|
 |
11
|
|
 |
12
|
Amr El Abbadi , Dale Skeen , Flaviu Cristian, An efficient, fault-tolerant protocol for replicated data management, Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.215-229, March 25-27, 1985, Portland, Oregon, United States
[doi> 10.1145/325405.325443]
|
 |
13
|
|
 |
14
|
|
 |
15
|
Nathan Goodman , Dale Skeen , Arvola Chan , Umeshwar Dayal , Stephen Fox , Daniel Ries, A recovery algorithm for a distributed database system, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia
[doi> 10.1145/588058.588061]
|
 |
16
|
Jim Gray , Paul McJones , Mike Blasgen , Bruce Lindsay , Raymond Lorie , Tom Price , Franco Putzolu , Irving Traiger, The Recovery Manager of the System R Database Manager, ACM Computing Surveys (CSUR), v.13 n.2, p.223-242, June 1981
[doi> 10.1145/356842.356847]
|
| |
17
|
HADZ~LACOS, V. Issues of fault tolerance in concurrent computations. Tech. Rep. 11-84, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass. (june i984).
|
 |
18
|
|
 |
19
|
|
 |
20
|
|
| |
21
|
|
 |
22
|
|
| |
23
|
SKEEN, D. Crash recovery in a distributed database management system. Ph.D. thesis, Memo. UCB/ERL M82/45, Electronics Research Lab., Univ. California, Berkeley, 1982.
|
 |
24
|
|
| |
25
|
WRIGHT, D. Managing distributed databases in partitioned networks. TR83-572, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y., Sept. 1983.
|
CITED BY 35
|
|
|
|
|
|
|
|
|
|
|
Dahlia Malkhi , Michael Reiter , Rebecca Wright, Probabilistic quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.267-273, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
|
Idit Keidar , Danny Dolev, Increasing the resilience of atomic commit, at no additional cost, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.245-254, May 22-25, 1995, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dahlia Malkhi , Michael Reiter , Avishai Wool, The load and availability of Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.249-257, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Charles William Bash : Reviewer"
.abstract
In a replicated database, a data item may have copies residing on several
sites. A replica control protocol is necessary to ensure that data items
with several copies behave as if they consist of a single copy, as far
as users can tell
more...
|