7. Modeling for High Availability | Cassandra High Availability

Sign In Start Free Trial

Book Overview & Buying
Table Of Contents
Feedback & Rating

Cassandra High Availability

By : Strickland

4.6 (14)

Cassandra High Availability

4.6 (14)

By: Strickland

Overview of this book

If you are a developer or DevOps engineer who understands the basics of Cassandra and are ready to take your knowledge to the next level, then this book is for you. An understanding of the essentials of Cassandra is needed.

Preface

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Free Chapter

1. Cassandra's Approach to High Availability

1. Cassandra's Approach to High Availability

ACID

The monolithic architecture

The master-slave architecture

Cassandra's solution

Cassandra's architecture

Summary

2. Data Distribution

2. Data Distribution

Hash table fundamentals

Consistent hashing

Token assignment

Partitioners

Summary

3. Replication

3. Replication

The replication factor

Snitches

Consistency conflicts

Balancing the replication factor with consistency

Summary

4. Data Centers

4. Data Centers

Use cases for multiple data centers

Data center setup

Replication across data centers

Summary

5. Scaling Out

5. Scaling Out

Choosing the right hardware configuration

Scaling out versus scaling up

Growing your cluster

How to scale out

How to scale up

Removing nodes

Other data migration scenarios

Snitch changes

Summary

6. High Availability Features in the Native Java Client

6. High Availability Features in the Native Java Client

Thrift versus the native protocol

Setting up the environment

Connecting to the cluster

Executing statements

Handling asynchronous requests

Load balancing

Failing over to a remote data center

Tying it all together

Summary

7. Modeling for High Availability

7. Modeling for High Availability

How Cassandra stores data

Understanding compaction

CQL under the hood

Understanding queries

How collections are stored

Working with time-series data

Designing for immutability

Working with geospatial data

Summary

8. Antipatterns

8. Antipatterns

Multikey queries

Secondary indices

Distributed joins

Deleting data

Unbounded row growth

Summary

9. Failing Gracefully

9. Failing Gracefully

Knowledge is power

Logging

Monitoring node metrics

When a node goes down

Backing up data

Summary

Index

Index

Customer Reviews

4.6 (14)

5 star

64.3%

4 star

35.7%

3 star

0

2 star

0

1 star

0

Understanding queries

In order to make sense of the various types of queries, we will start with a common data model to be used across the following examples. For this data model, we will return to the authors table, with name as the partition key, followed by year and title as clustering columns. We'll also sort the year in descending order. This table can be created as follows:

CREATE TABLE authors (
  name text,
  year int,
  title text,
  isbn text,
  publisher text,
  PRIMARY KEY (name, year, title)
) WITH CLUSTERING ORDER BY (year DESC);

Also, for the purpose of these examples, we will assume a replication factor of three and consistency level of QUORUM.

Query by key

We'll start with a basic query by key:

SELECT * FROM authors WHERE name = 'Tom Clancy';

For this simple select, the query makes the request to the coordinator node, which in this case owns a replica for our key. The coordinator then retrieves the row from another replica node to satisfy the quorum. Thus, we need a total of two...

Search

Your notes and bookmarks