{"id":2265,"date":"2012-02-05T06:25:32","date_gmt":"2012-02-05T11:25:32","guid":{"rendered":"http:\/\/www.bytebot.net\/blog\/?p=2265"},"modified":"2012-02-05T06:30:47","modified_gmt":"2012-02-05T11:30:47","slug":"mysql-cluster-by-ralf-gebhardt","status":"publish","type":"post","link":"http:\/\/www.bytebot.net\/blog\/archives\/2012\/02\/05\/mysql-cluster-by-ralf-gebhardt","title":{"rendered":"MySQL Cluster by Ralf Gebhardt"},"content":{"rendered":"

Ralf Gebhardt of SkySQL<\/a>.<\/p>\n

Cluster: shared nothing architecture (no single point of failure), synchronous replication between nodes, ACID transactions, row level locking. In-memory storage (some data can be stored on disk, but indexes must be in-memory). Checkpointing to disk for durability. It supports two types of indexes – ordered T-trees, unique hash indexes. Online operations like adding node groups, software upgrades, table alterations. Quick standard architecture diagram displayed about MySQL Cluster.<\/p>\n

Network partitioning protocol is designed to avoid a split brain scenario. Is there at least one node from each node group? If not then this part cannot continue – graceful shutdown. Are all nodes present from any node group? If so, then this is the only viable cluster – continue to operate. Ask the arbitrator – the arbitrator which parts will continue if no arbitrator is available the cluster shuts down.<\/p>\n

Durability – in order for a node to recover fast some data is stored locally. The REDO log is synchronized by global checkpoints (GCP). The DataMemory is synchronized by local checkpoints (LCP).<\/p>\n

I agree with Ralf — almost impossible to talk about NDB in 25 minutes. Its very deep, you’d need at least three hours to grasp it well.<\/p>\n

Share this:<\/h3>