Slashdot Mirror

← Back to Stories (view on slashdot.org)

Cassandra and Voldemort Benchmarked

Posted by timothy on from the rifling-the-file-cabinet dept.

kreide33 writes "Key/Value storage systems are gaining in popularity, much because of features such as easy scalability and automatic replication. However, there are several to choose from and performance is an important deciding factor. This article compares the performance of two of the most well-known projects, Cassandra and Voldemort, using several different mixes of access types, and compares both throughput and latency."

4 of 45 comments (clear)

  1. No Winner by WrongSizeGlass · · Score: 5, Informative

    Their conclusion was that there was "no clear winner". Not surprising. Both of these products are in their early stages of development (Voldemort v0.80.1, Cassandra 0.6.0-beta3) and will certainly work on optimization and performance issues after the product is stable.

    I'd like to have seen them run MySQL, PostgreSQL or SQLite through the same tests so we could see how these NoSQL solutions compared.

    1. Re:No Winner by Anonymous Coward · · Score: 2, Informative

      I wouldn't have mentioned it if it wasn't pure shit that. 1.5 seconds for a query that should be 3-4 disk blocks at max?

    2. Re:No Winner by Hognoxious · · Score: 2, Informative

      Production code works ... until it doesn't.

      I've seen a situation where half of the bugs reports in our system were down to one badly conceived and shittily implemented module. But when I suggested binning it and doing it again properly, the answer was "but it works!".

      --
      Confucius say, "Find worm in apple - bad. Find half a worm - worse."
    3. Re:No Winner by inKubus · · Score: 2, Informative

      And what about memcached? It's a simple key/value object database. What about an "associative array", isn't that basically a key/value database? I don't see what the hype is about.

      --
      Cool! Amazing Toys.