DuyHai Doan and Patrick McFadin explain the primary two ways of distributing data used in computer science: hash-based partitioning and range-based partitioning, and the implications of each of these on operations (hint: rebalancing!).
Back to Resources
Partitioning Techniques with DuyHai Doan and Patrick McFadin
Distributed Data Show Episode 26
Speakers
Duy Hai Doan
at DataStax
Patrick McFadin
VP Developer Relations at DataStax
Luke Tillman
Technical Evangelist for Apache Cassandra at DataStax
You May Also Like:
Blog
How to Optimize Data Management in Containers with Kubernetes and DataStax
In recent years, containers have become an increasingly popular technology used to accelerate modern application development. Thanks to prevalent container platforms like Docker,…
Learn More
Webinar
Wert der Daten und ihrer Beziehungen untereinander
Moderne Applikationen erfordern eine breite Funktionspalette — einschließlich eines integrierten und anpassbaren Data Layers, der schnelllebige Daten in großem Umfang verarbeiten…
Learn More
Blog
DataStax Accelerate 2019 Rewind: IBM (Watch Video)
Running a Globally Distributed Cassandra Cluster on Kubernetes in the Cloud As enterprises increasingly build applications with microservices and containers, more and more of…
Learn More