Cassandra Overview培训课件.pptxVIP

Cassandra OverviewWhat is Cassandra?Highly scalable NoSQL data storeNo single point of failureVery fast writes and readsConsistency, Availability, and Partition ToleranceTunable ConsistencyFree! Go to /dyn/closer.cgi?path=/cassandra/1.1.12/apache-cassandra-1.1.12-bin.tar.gz/dyn/closer.cgi?path=/cassandra/1.1.12/apache-cassandra-1.1.12-bin.tar.gzCommodity hardwareUsed by Netflix, Twitter, eBay, to name a few.Check out - /docs/1.1/indexExample of Ring InformationThe Cassandra “Ring”Node 0 (Node 7, Node 0]Node 1(Node 0, Node 1]Node 7Node 6Node 2Node 5Node 3Node 4The Cassandra “Ring” ReplicationNode 0 (Node 7, Node 0]Node 1(Node 0, Node 1]Node 7Node 6Node 2Node 5Node 3Node 4Cassandra Summit 2013 Netflix1) Nodes can be easily added to an existing Cassandra cluster, with an initial token which splits an existing token range existing nodes.2) Refer to /cassandracalculator/ for useful information.3) Write to memory cache, then to commitlog, for the node that is it. Reads from memory, then intelligent read from disk, then generic read from disk.4) CAP theoremFrom Wikipedia, the free encyclopediaJump to: navigation, search In theoretical computer science, the CAP theorem, also known as Brewers theorem, states that it is impossible for a distributed computer system to simultaneously provide all three of the following guarantees:[1][2]Consistency (all nodes see the same data at the same time)Availability (a guarantee that every request receives a response about whether it was successful or failed)Partition tolerance (the system continues to operate despite arbitrary message loss or failure of part of the system)According to the theorem, a distributed system cannot satisfy all three of these guarantees at the same time.[3]In May 2012 Brewer clarified some of his positions, including why the oft-used two out of three concept can be misleading or misapplied, and the different definition of consistency used in CAP relative to the one used in ACID.[4]In computer science, ACID (Ato