Cited By
View all- Kshemkalyani ASinghal M(1999)A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated DatabasesIEEE Transactions on Knowledge and Data Engineering10.1109/69.82460111:6(880-895)Online publication date: 1-Nov-1999
Efficient availability mechanisms in distributed database systems
References
[1]
Ann' E1 Abbadi and S. Toueg. Availability in partitioned replicated databases, hx Proc. Fifth A CM SiGA CT- SIGMOD Syrup, on Principles of Database Systems, pages 240-251, Mard~ 1986.]]
[2]
P. Alsberg and J. Day. A principle for resilient sharing of dist. ributed re.~ources. Proceedings of the 2nd lnt'! Con- .fercnce on Software Engzneering, pages 562-570, October 1976.]]
[3]
J. F. Bartlett. A nonstop operating system. Proc. o.f Hawaii Intn'l Conference on System Sciences, Ja:t~uary 1978.]]
[4]
P. A. Bernstein and N. Goodman. An algorithm for concurrency control and recovery in replicated distributed databases. A UM Transactions on Database Systems, 9(4) :596-615, December 1984.]]
[5]
Philip Bern,tein and Nathan Goodman. The failure and recovery problem for replicated databases. Proceedings of the' 2nd A (?M Syrup. on Principles of Distributed Computing, pages 114-1'2'2, Augu~,t 1983.]]
[6]
Bharat Bhargava, Karl Friesen, Abdelsalam Helal, Srinivasan Jagannathas~, and John Riedl. Design and implementation ~)f the RAID V2 distribated database system. Technical Report CSD-TR-962, Purdue University, March 1990.]]
[7]
Bharat Bhargava, I(arl Frlesen, Abdelsalam Helal, and John Riedl. Adaptability experiments in the raid distributed database system. Proceedings of the 9th iEEE Symposium on Rehab,hiy,n Distributed Systems, pages 76-85, October 1990.]]
[8]
Bharat Bhargava, Abdelsalam HelM, and Karl Friesen. Analyzing availability of replicated database systems. International Journal o} Computer Simulation, 1(4):393-,t18, December 1991. A special issue on distributed file systems and database simulation.]]
[9]
Bharat Bhargava, Enrique Mafia, and John Riedl. Communication in the Raid distributed databa.e system. Computer Networks and ISDN Systems, 1991.]]
[10]
Bharat Bhargava and John Riedl. A model for adaptable systems for transaction processing. IEEE Transaction, on Knowledge and Data Eng,neerzng, 1(4):433-449, December 1989.]]
[11]
Bharat Bhargava, John Riedl, and Andrew Royappa. The raid distributed database system. Teclimcal Pleport CSD- TR-691, Purdue University, August 1987.]]
[12]
Kemxeth Birman and Thomas Jo.~eph. Exploiting virt. ual synchrony in distributed systems. A UM 11 th 5'ymposzum on Operating Systems Principles, pages 123-138, November 1987.]]
[13]
Sally Bn~so. A failure detection and notification protocol for distributed computing systems. Proc. o.f IEEE 5th Intn'l Conference on Distribv. ted Uomputing Systems, pages 116-123, May 1985.]]
[14]
P. Dasgupta and M. Morsi. An ohject-ba~ed distributed database system supported on the clounds operating system. Technical Report GIT-ICS-86/07, Georgia Tech, 1986.]]
[15]
D. K. Gifford. Weighted voting for replicated data. P'roceedings o.f the 7th Symposium on Operating System P?'~aciples, pages 150-162, December 1979.]]
[16]
Abdelsalam Abdelhamid Hedclaya. Managing Event-based Replication .for Abstract Data Types,n D~stmbut~d Systems. PhD thesis, Harvard University, ()ctober 1988. TR- 20-88.]]
[17]
C. Hedrick. Routing informati on protocol. Network Working Group, RFU 1058, June 1988.]]
[18]
AbdelsalamHelal. E~'pe?'imental Analys~s of tieplicat, on,'a Distributed S!/stems. PhD thesis, Purdue {lniversi{y, May 1991.]]
[19]
Abdelsalam Helal, Yongguang Zhang, a~cl Bharat Bhargays. Surveillance for co~t rolled perf~r~ance (legra~lati(m during failures. In Proc. 25th Hawaii l~,tervtatzo~zal ~?oa- .ference on System Sciences, pages 202-210, t(auai, Hawaii, January 1992.]]
[20]
Maurice Herlihy. A quorum-conse~sus replication method for abstract data types. A UM Tra?zsact,ons on Computer Systems, 4(1):32-53, February 1986.]]
[21]
W. t(im. Auditor: A framework for highly available DB- DC systems. Proc. of iEEE Second Symposium on Rrhabihty in Distrzbuted Software and Database Systems, pages 116-123, July 1982.]]
[22]
Akhil Kumar. Hierarchical quorum consensus: A new class of algorithms for replicated data. Proceedings o.f the lOth IEEE symposium on Distmbuted Computing Systems, May 1990.]]
[23]
Buttler W. Lampson. Hints for computer system designers. A UM 9th Sympostum on Operating System Principles, Bre tton Woods, October 1983.]]
[24]
Bruce G. Lindsay, Laura M. Haas, C. Mohan, Paul F. Wilms, and Robert A. Yost. Computation and communication in R*: A distributed database manager. ACM Transactions on Corr, puter Systems, 2(1), February 1984.]]
[25]
Barbara Liskov. Distributed programming in Argus. Commitnications o.f the A CM, 31(3):300-312, March 1988.]]
[26]
T. Minoura and G. Wiederhold. Resilient extended truecopy toke~t scheme for a distributed database system. IEEE Transacttons on Software Engineering, 9(5):173-189, May 1982.]]
[27]
Calton Pu. Replication and Nested Transactions in the Eden Distributed System. PhD thesis, University of Washington, May 1985]]
[28]
Bernd Walter. Network partitioning and surveillance protocols. Proc. o.f IEEE 5th lntn'l Conference on D~stributed Computing Systems, pages 124-129, May 1985.]]
Index Terms
- Efficient availability mechanisms in distributed database systems
Recommendations
Database high availability using SHADOW systems
SoCC '15: Proceedings of the Sixth ACM Symposium on Cloud ComputingHot standby techniques are widely used to implement highly available database systems. These techniques make use of two separate copies of the database, an active copy and a backup that is managed by the standby. The two database copies are stored ...
Maximizing the Availability of Replicated Services in Widely Distributed Systems Considering Network Availability
SERE '13: Proceedings of the 2013 IEEE 7th International Conference on Software Security and ReliabilityAvailability is an important issue in distributed environments that promise to provide quality of services and thus the mechanisms to improve data or service availability is critical to ensure such quality of service. Replication schemes have been ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
December 1993
742 pages
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGAI: ACM Special Interest Group on Artificial Intelligence
- SIGIR: ACM Special Interest Group on Information Retrieval
- Inst Soc for Comp & Applic: Inst Soc for Comp & Applic
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1993
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 1,861 of 8,427 submissions, 22%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 606Total Downloads
- Downloads (Last 12 months)93
- Downloads (Last 6 weeks)11
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Kshemkalyani ASinghal M(1999)A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated DatabasesIEEE Transactions on Knowledge and Data Engineering10.1109/69.82460111:6(880-895)Online publication date: 1-Nov-1999
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in