Cassandra
Everything on SkillVeris tagged Cassandra — collected across the glossary, study notes, blog, and cheat sheets.
11 resources across 2 libraries
Cheat Sheets(1)
Interview Questions(10)
What is CAP Theorem?
CAP theorem states that a distributed data store can only guarantee two of three properties at once — Consistency, Availability, and Partition tolerance — duri…
What is a Column-Family Database Model?
A column-family database groups related columns into named families and stores each row's data physically by column family rather than by row, so queries touch…
Wide-Column Store vs Relational Database: What is the Difference?
A wide-column store lets each row hold millions of dynamically named, sparse columns grouped by family and distributed by row key across many nodes, while a re…
What Are the Basics of Cassandra Data Modeling?
Cassandra data modeling means designing tables around the exact queries your application will run, since Cassandra has no joins and limited ad-hoc filtering, s…
What is the CAP Theorem and What Trade-offs Does It Force?
The CAP theorem states that a distributed data store can provide at most two of Consistency, Availability, and Partition tolerance at the same time, and since…
What is Quorum-based Consensus and How Does It Work?
Quorum-based consensus requires a minimum number of nodes (a quorum) to agree before a read or write is considered successful, typically enforcing that the rea…
What is a Gossip Protocol and How Does It Work?
A gossip protocol is a decentralized way for nodes in a distributed system to spread information by periodically exchanging state with a few randomly chosen pe…
How Does a Write-Ahead Log Relate to an LSM-Tree?
A write-ahead log provides crash durability for a single write, while an LSM-tree is the broader storage engine architecture that uses that WAL alongside an in…
What is a Log-Structured Merge (LSM) Tree?
A log-structured merge (LSM) tree is a write-optimized storage data structure that buffers writes in an in-memory sorted table and periodically flushes them as…
How Are Merkle Trees Used in Distributed Systems?
A Merkle tree is a binary tree of hashes where every leaf holds the hash of a data block and every parent holds the hash of its children’s combined hashes, let…