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

Partitioners

You might recall from the earlier discussion of distributed hash tables that keys are mapped to nodes via an implementation-specific hash function. In Cassandra's architecture, this function is determined by the partitioner you choose. This is a cluster-wide setting specified in cassandra.yaml. As of version 1.2, there are three options:

Murmur3Partitioner: This produces an even distribution of data across the cluster using the MurmurHash algorithm. This is the default as of version 1.2, and should not be changed as it is measurably faster than the RandomPartitioner.
RandomPartitioner: This is similar to the Murmur3Partitioner, except that it computes an MD5 hash. This was the default prior to version 1.2.
ByteOrderedPartitioner: This places keys in byte order (lexically) around the ring. This partitioner should generally be avoided for reasons explained in this section.

The only reason to switch from the default Murmur3Partitioner to ByteOrderedPartitioner would be to enable...

Search

Your notes and bookmarks