On Designing Dependable Services with Diverse Off-the-Shelf SQL Servers

Gashi, Ilir; Popov, Peter; Stanković, Vladimir; Strigini, Lorenzo

doi:10.1007/978-3-540-25939-8_9

Cited by 17 publications

(23 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have reported recently results of studies on dependability and performance of database servers [34], [35], [36], [37]. The focus of these earlier studies was in measuring the amount of "diversity", in both correctness and response time, which exists between different servers, i.e.…”

Section: Numerical Examples: a Study With Off-the-shelf Database Serversmentioning

confidence: 99%

Uncertainty explicit assessment of off-the-shelf software: A Bayesian approach

Gashi¹,

Popov²,

Stanković³

2009

Information and Software Technology

Self Cite

View full text Add to dashboard Cite

Section: Numerical Examples: a Study With Off-the-shelf Database Serversmentioning

confidence: 99%

Uncertainty explicit assessment of off-the-shelf software: A Bayesian approach

Gashi¹,

Popov²,

Stanković³

2009

Information and Software Technology

Self Cite

View full text Add to dashboard Cite

“…We have described elsewhere [9], [2] in more detail the FT-node architecture. Here we will only elaborate on the parts relevant to the discussion of rephrasing.…”

Section: General Schemementioning

confidence: 99%

“…the next transaction. Therefore the diverse setups here are always slower (other configurations are possible and we have discussed some of these in [9]). Figure 2 illustrates the sequence of executions within a transaction for the different non-diverse setups.…”

Section: Performance Implications Of Rephrasingmentioning

confidence: 99%

See 1 more Smart Citation

Rephrasing Rules for Off-The-Shelf SQL Database Servers

Gashi¹,

Popov²

2006

2006 Sixth European Dependable Computing Conference

Self Cite

View full text Add to dashboard Cite

We have reported previously [1] results of a study with a sample of bug reports from four off-the-shelf SQL servers. We checked whether these bugs caused failures in more than one server. We found that very few bugs caused failures in two servers and none caused failures in more than two. This would suggest a fault-tolerant server built with diverse off-the-shelf servers would be a prudent choice for improving failure detection. To study other aspects of fault tolerance, namely failure diagnosis and state recovery, we have studied the "data diversity" mechanism and we defined a number of SQL rephrasing rules. These rules transform a client sent statement to an additional logically equivalent statement, leading to more results being returned to an adjudicator. These rules therefore help to increase the probability of a correct response being returned to a client and maintain a correct state in the database.

show abstract

“…Various studies in complex systems have shown that crash failures constitute a minority of failures [2,3], while trends in hardware increase the probability of transient hardware errors such as bit flips [4][5][6]. Worse yet, most replication protocols deployed in cloud centers provide weak consistency guarantees, meaning that they introduce inconsistencies even if there are no faults [7,8].…”

Section: Introductionmentioning

confidence: 99%

Byzantine Chain Replication

Renesse

Schiper

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a new class of Byzantine-tolerant State Machine Replication protocols for asynchronous environments that we term Byzantine Chain Replication. We demonstrate two implementations that present different trade-offs between performance and security, and compare these with related work. Leveraging an external reconfiguration service, these protocols are not based on Byzantine consensus, do not require majoritybased quorums during normal operation, and the set of replicas is easy to reconfigure. One of the implementations is instantiated with t + 1 replicas to tolerate t failures and is useful in situations where perimeter security makes malicious attacks unlikely. Applied to in-memory BerkeleyDB replication, it supports 20,000 transactions per second while a fully Byzantine implementation supports 12,000 transactions per second-about 70% of the throughput of a non-replicated database.

show abstract

On Designing Dependable Services with Diverse Off-the-Shelf SQL Servers

Cited by 17 publications

References 26 publications

Uncertainty explicit assessment of off-the-shelf software: A Bayesian approach

Uncertainty explicit assessment of off-the-shelf software: A Bayesian approach

Rephrasing Rules for Off-The-Shelf SQL Database Servers

Byzantine Chain Replication

Contact Info

Product

Resources

About