- Cassandra High Availability
- Robbie Strickland
- 144字
- 2021-08-06 19:50:30
Chapter 2. Data Distribution
Cassandra's peer-to-peer architecture and scalability characteristics are directly tied to its data placement scheme. Cassandra employs a distributed hash table data structure that allows data to be stored and retrieved by a key quickly and efficiently. Consistent hashing is the core of this strategy as it enables all nodes to understand where data exists in the cluster without complicated coordination mechanisms.
In this chapter, we'll cover the following topics:
By the time you finish this chapter, you should have a deep understanding of these concepts. Let's begin with some basics about hash tables in general, and then we can delve deeper into Cassandra's distributed hash table implementation.
推薦閱讀
- 數控銑削(加工中心)編程與加工
- 機器自動化控制器原理與應用
- PyTorch Deep Learning Hands-On
- Maya極速引擎:材質篇
- 大型數據庫管理系統技術、應用與實例分析:SQL Server 2005
- 21天學通Visual C++
- 塊數據5.0:數據社會學的理論與方法
- Storm應用實踐:實時事務處理之策略
- Word 2007,Excel 2007辦公應用融會貫通
- 單片機技能與實訓
- R Machine Learning Projects
- 電氣控制與PLC原理及應用(歐姆龍機型)
- Spark大數據商業實戰三部曲:內核解密|商業案例|性能調優
- 手把手教你學Flash CS3
- EJB JPA數據庫持久層開發實踐詳解