Logo
Pattern

Discover published sets by community

Explore tens of thousands of sets crafted by our community.

Distributed Transactions

12

Flashcards

0/12

Still learning
StarStarStarStar

Serializability

StarStarStarStar

Serializability is the highest isolation level in transaction processing, ensuring that transactions in a distributed system result in the same state they would if executed serially, even if they run concurrently.

StarStarStarStar

CAP Theorem

StarStarStarStar

CAP Theorem states that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance (only two out of three). It's a fundamental property that helps to make tradeoffs in distributed system design, particularly for distributed databases and transactions.

StarStarStarStar

Transaction Identifier (TxID)

StarStarStarStar

TxID is a unique identifier assigned to a transaction, which allows all participants within a distributed system to reference and manage the specific transaction consistently across different systems.

StarStarStarStar

ACID Properties

StarStarStarStar

ACID properties (Atomicity, Consistency, Isolation, Durability) define the transaction guarantees essential for reliable processing in distributed databases. They ensure transactions are processed reliably in a multi-user and multi-tasking database environment.

StarStarStarStar

Three-Phase Commit (3PC)

StarStarStarStar

3PC is a protocol designed to overcome some limitations of 2PC, particularly blocking problems if the coordinator fails. In addition to the prepare and commit/abort phases of 2PC, it introduces a pre-commit phase to reduce the likelihood of blocking.

StarStarStarStar

Snapshot Isolation

StarStarStarStar

Snapshot Isolation is an isolation level in transaction processing which allows transactions to operate on a snapshot of the database at a point in time, reducing lock contention but not always preventing all concurrency-related anomalies.

StarStarStarStar

Distributed Deadlock

StarStarStarStar

A distributed deadlock occurs when there is a system-wide circular wait condition amongst two or more transactions in a distributed system. Detection and resolution require complex algorithms and are crucial to maintain system efficiency.

StarStarStarStar

Eventual Consistency

StarStarStarStar

Eventual Consistency is a consistency model used in distributed computing to achieve high availability that informally guarantees that, if no new updates are made to a given data item, eventually all accesses to that item will return the last updated value.

StarStarStarStar

Raft Protocol

StarStarStarStar

Raft is a consensus algorithm that is designed to be more understandable than Paxos. It provides a similar function in terms of agreeing on a single value within a distributed system and is used in systems that require strong leadership and consistency.

StarStarStarStar

Idempotence

StarStarStarStar

Idempotence is the property that a transaction can be applied multiple times without changing the result beyond the initial application, which is crucial for error recovery and redundancy in distributed systems.

StarStarStarStar

Two-Phase Commit (2PC)

StarStarStarStar

2PC is a consensus protocol used to achieve atomicity in a distributed system transaction across multiple participants. It ensures that either all nodes commit the transaction or none do (avoiding partial commits), by working in two phases: a prepare phase and a commit/abort phase.

StarStarStarStar

Paxos Protocol

StarStarStarStar

Paxos is a consensus protocol that allows a distributed system to agree on a single value (used in committing a transaction). It deals with intermittent failure and is important for ensuring that a cluster of distributed nodes reaches consensus.

Know
0
Still learning
Click to flip
Know
0
Logo

© Hypatia.Tech. 2024 All rights reserved.