Introduction to a system for distributed databases (SDD-1)

Rothnie, James B.; Bernstein, P. A.; Fox, Stephen; Goodman, Nathan; Hammer, M. M.; Landers, Terry A.; Reeve, Christopher L.; Shipman, David W.; Wong, Eugene

doi:10.1145/320128.320129

Cited by 203 publications

(33 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…SDD-1 is a distributed database system developed by the Computer Corporation of America [23]. SDD-1 permits a relational database to be distributed among the sites of a computer network, yet accessed as if it were stored at a single site.…”

Section: Introductionmentioning

confidence: 99%

Query processing in a system for distributed databases (SDD-1)

Bernstein

Goodman

Wong

et al. 1981

ACM Trans. Database Syst.

401

125

View full text Add to dashboard Cite

Thii paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage query into a relational calculus form called an envelope, which is essentially an aggregate-free QUEL query. This paper is primarily concerned with the optimization of envelopes.Envelopes are processed in two phases. The first phase executes relational operations at various sites of the distributed database in order to delimit a subset of the database that contains all data relevant to the envelope. This subset is called a reduction of the database. The second phase transmits the reduction to one designated site, and the query is executed locally at that site.The critical optimization problem is to perform the reduction phase efficiently. Success depends on designing a good repertoire of operators to use during this phase, and an effective algorithm for deciding which of these operators to use in processing a given envelope against a given database. The principal reduction operator that we employ is called a sem@oin. In this paper we define the semijoin operator, explain why semijoin is an effective reduction operator, and present an algorithm that constructs a cost-effective program of semijoins, given an envelope and a database.

show abstract

Section: Introductionmentioning

confidence: 99%

Query processing in a system for distributed databases (SDD-1)

Bernstein

Goodman

Wong

et al. 1981

ACM Trans. Database Syst.

401

125

View full text Add to dashboard Cite

show abstract

“…The stock level of each item affects the transaction behavior, but each item affects a different portion of the code. Using a read-write dependency analysis like the one in SDD-1 [31], we identify such points of independence and use them to encode symbolic tables more concisely in a factorized manner.…”

Section: System Designmentioning

confidence: 99%

The Homeostasis Protocol

Roy

Kot

Bender

et al. 2015

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

Datastores today rely on distribution and replication to achieve improved performance and fault-tolerance. But correctness of many applications depends on strong consistency properties-something that can impose substantial overheads, since it requires coordinating the behavior of multiple nodes. This paper describes a new approach to achieving strong consistency in distributed systems while minimizing communication between nodes. The key insight is to allow the state of the system to be inconsistent during execution, as long as this inconsistency is bounded and does not affect transaction correctness. In contrast to previous work, our approach uses program analysis to extract semantic information about permissible levels of inconsistency and is fully automated. We then employ a novel homeostasis protocol to allow sites to operate independently, without communicating, as long as any inconsistency is governed by appropriate treaties between the nodes. We discuss mechanisms for optimizing treaties based on workload characteristics to minimize communication, as well as a prototype implementation and experiments that demonstrate the benefits of our approach on common transactional benchmarks.

show abstract

“…A variation of this technique known as read-one write-all-available (ROWAA) improves the availability of the database [Bernstein et al , 1987Rothnie et al 1980]. Although the original protocol does not tolerate partitions, the basic protocol can be extended with a primary component (partitions) approach that makes it partition tolerant.…”

Section: Read-one Write-allmentioning

confidence: 99%

Are quorums an alternative for data replication?

Jiménez-Peris

Patiño-Martı́nez

Alonso³

et al. 2003

ACM Trans. Database Syst.

121

View full text Add to dashboard Cite

Data replication is playing an increasingly important role in the design of parallel information systems. In particular, the widespread use of cluster architectures often requires to replicate data for performance and availability reasons. However, maintaining the consistency of the different replicas is known to cause severe scalability problems. To address this limitation, quorums are often suggested as a way to reduce the overall overhead of replication. In this article, we analyze several quorum types in order to better understand their behavior in practice. The results obtained challenge many of the assumptions behind quorum based replication. Our evaluation indicates that the conventional read-one/write-all-available approach is the best choice for a large range of applications requiring data replication. We believe this is an important result for anybody developing code for computing clusters as the read-one/write-all-available strategy is much simpler to implement and more flexible than quorum-based approaches. In this article, we show that, in addition, it is also the best choice using a number of other selection criteria.

show abstract

Introduction to a system for distributed databases (SDD-1)

Cited by 203 publications

References 17 publications

Query processing in a system for distributed databases (SDD-1)

Query processing in a system for distributed databases (SDD-1)

The Homeostasis Protocol

Are quorums an alternative for data replication?

Contact Info

Product

Resources

About