Cassandra node vs partition: A simple explanation

As explained in How does Cassandra store data? – A simple explanation Cassandra uses partitioning key (the first part of primary key) to store a record into a partition on a node. Prior to version 1.2, one server = one node. That is each machine was assigned to a range of values, so that the entire cluster covered … Continue reading Cassandra node vs partition: A simple explanation

Cassandra Primary Key = ((Partitioning Key), Clustering Key): A simple explanation

Cassandra primary key (a unique identifier for a row) is made up of two parts - 1) one or more partitioning columns and 2) zero or more clustering columns. To search a table without any indexes, all partitioning columns must be provided to avoid error message: Cannot execute this query as it might involve data filtering … Continue reading Cassandra Primary Key = ((Partitioning Key), Clustering Key): A simple explanation

How and when to index data in Cassandra for fast and efficient retrieval? – A simple explanation

Cassandra is a multi-node, peer-to-peer cluster/distributed system that distributes/stores data across all nodes in the cluster. Every table in Cassandra is physically stored in multiple SSTable files spread across one or multiple nodes. Rows are spread around the cluster based on a hash of the partition key, which is the first part of the primary key. … Continue reading How and when to index data in Cassandra for fast and efficient retrieval? – A simple explanation