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."

34 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 ThePhilips · · Score: 1

      Digg is going to no-sql, for example. They released some of their mysql schema/code and it was poorly designed (bad indexing, manual joins, braindead queries). They chose to go with no-sql because they're clueless retards.

      Lazy to rephrase, so here it goes straight from rfc1925:

      Some things in life can never be fully appreciated nor understood unless experienced firsthand. Some things in networking can never be fully understood by someone who neither builds commercial networking equipment nor runs an operational network.

      In general I'm very very cautious when criticizing production code. After all it works.

      --
      All hope abandon ye who enter here.
    2. 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?

    3. 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."
    4. Re:No Winner by Arancaytar · · Score: 1

      > After all it works.

      Since they're abandoning MySQL, apparently their schema didn't work so great...

    5. Re:No Winner by mrmeval · · Score: 1

      I read the brief descriptions of each system and if there is any text that is as cotton mouthed fuzzy and unclear outside of legaleze I've not seen it.

      --
      I'd go on a Vegan diet but the delivery time from Vega is too long. --brownkitty
    6. Re:No Winner by greg1104 · · Score: 1

      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.

      That wouldn't have made any sense given the replication scheme used: "N=3 (replicas for each entry), R=2 (nodes to wait for on each read), W=2 (nodes to block for on each write)". It's hard to translate that into the sort of replication features available in the other databases you mentioned.

      Also, these tests focused on individual put/get operations, where a standard database is going to get creamed no matter what. You'd need to include something that had a higher-level query component to it than that to even approach fair. To use a social networking example, the benchmark ran tested how long it might take for one of these databases to look up a piece of information about one of your friends. To get something where a comparison against a regular database would be more fair, you'd want queries like "get the list of all my friends" instead.

    7. 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.
    8. Re:No Winner by mini+me · · Score: 1

      The guys at digg fully admit that they could spend their days tuning MySQL to achieve the performance they need. What is important to realize is that it costs real money and time to perform that tuning. Time and money that could be better spent improving the user experience of the website.

      Cassandra, on the other hand, performs optimally no matter what the developers throw at it, without the need to tune every last detail to squeeze every last bit of performance out of it. As the site grows, if the cluster is not able to handle the load, new (cheap) systems can be added in minutes.

      Digg's move to Cassandra was a business decision to keep their operational costs low. The links you posted mention that a good DBA would solve all of digg's problems, which is probably true from a technology standpoint, but what they fail to mention is that a good DBA costs as much, if not more, than it costs them to run their entire Cassandra cluster.

      So yes, with the right tuning MySQL would be capable of powering digg. They admit it themselves. It just did not make sense from a business point of view because keeping MySQL running well is much more expensive than keeping Cassandra running well.

    9. Re:No Winner by DragonWriter · · Score: 1

      I don't know that comparing an RDBMS vs key-value storage is meaningful.

      Since they are alternative approaches to implementing a backend store for an information system, and the decision between key/value and relational technology is in many cases a bigger decisions with greater risk involved in making the wrong choice than the decision between particular key/value or particular relational options (since the conversion between different systems using the same basic information model is cheaper than the conversion between system using different information models), I think it would be more important to have comparisons between, e.g., key/value stores, SQL-based RDBMSs, non-SQL (e.g., D -- the SQL-alternative relational language family, not the Digital Mars programming language)-based RDBMSs than to have comparisons between different members of the same family.

  2. Drat by sys.stdout.write · · Score: 1

    Did anyone else read this as comparing Cassandra from King's Quest and Voldemort from Harry Potter?

    1. Re:Drat by Anonymous Coward · · Score: 1, Funny

      You mean "He-Who-Must-Not-Be-Named"

    2. Re:Drat by WWWWolf · · Score: 5, Funny

      Did anyone else read this as comparing Cassandra from King's Quest and Voldemort from Harry Potter?

      I was expecting something about Cassandra producing a bunch of warnings in log files that no one ever bothers to read, and Voldemort having various problems managing the child processes in the cluster (mostly being unable to kill or reap them).

    3. Re:Drat by Arancaytar · · Score: 1

      Wouldn't the problem be rather that Voldemort would keep killing child processes randomly?

    4. Re:Drat by deniable · · Score: 3, Funny

      I hear Voldemort has a really good replication strategy.

    5. Re:Drat by Rennt · · Score: 1

      I always figured Cassandra was a reference to Red Dwarf.

    6. Re:Drat by mysidia · · Score: 1

      Maybe so, but Cassandra is sexier, and Voldemort is just plain evil.

  3. Key compression... by shic · · Score: 1

    Are there ANY open source key/value stores that support prefix compression?

  4. Re:Let there be light by OeLeWaPpErKe · · Score: 1

    I kinda wonder why it's not possible to use these projects as backends for mysql and postgres. Seems to me that shouldn't be that hard an exercise.

    Or even having these as mountable volumes.

  5. Silly question by Hognoxious · · Score: 3, Interesting

    Is a key/value system a database with just one table that has one key field and one non-key field?

    --
    Confucius say, "Find worm in apple - bad. Find half a worm - worse."
    1. Re:Silly question by CrashNBrn · · Score: 1

      AFAIK it's akin to a Mapping/Hash (array), ie:
      mArray[name] := ({ "Crash" }) or
      mArray[stats] := ({ ({ "STR", 10 )}, ({ "DEX", 12 }) })

      They could also be multi-tiered mappings:
      mPlayer[data][name], mPlayer[data][stats]

      DGD and LPmuds have done mapping/arrays for ~20 years. The underlying DGD core is C++ and the interpreted language is like-C. The underlying core of most other LPMuds is C and interpreted like-C.

      Mappings and Compiled (Data) Objects were extremely useful in DGD. Named arrays with decent access speed.

    2. Re:Silly question by legoburner · · Score: 1

      At the simplest level yes, but cassandra (for example) is more like a multi-dimensional hashmap. Eg; Key-Value where Value points to another Key-Value and so on, so you can reference values such as: SomeApp.Users[UserID][username]=bob The advantage of this is being able to sort by time, alpha, etc, and therefore handle sorted pagination from the key/value listings. The main advantage though is that you can literally just plug in more systems and have it scale horizontally without any extra work, unlike databases which need sharding, bigger machines, redevelopment, etc. once you hit the limits of basic clustering.

      --
      Warhammer forums
    3. Re:Silly question by adamchou · · Score: 1

      When you say "database", I imagine you're referring to the traditional relational database. I've never used Cassandra or Voldemort but I have used memcachedb and tokyodb and the one major difference is that you can't select on ranges in a key/value system. You can't select all keys > 100 or keys 100 - 500, etc

    4. Re:Silly question by inKubus · · Score: 1

      That sounds like a tree. Like LDAP for instance, who has been doing this with extremely high performance, with replication, etc. for decades ;) These are all solved problems, new copies of the same comes out every 10 years in a cycle, and all the new kids don't realize that it already existed, came to full maturity and was bought by IBM long ago.. IBM has a product that will solve everyone's problems if you'd just call them. But the kids like to go it alone, as if the problem of indexing a few million web pages is anything hard like say, the U.S. Census or the NASDAQ trading system. I have a system I'm working on that has 400,000 users on mysql and it was running on a single Pentium 4 processor with a single 7200 rpm SATA drive and ran fine. A lot of stuff was done with Perl and flat files to keep stuff responsive. I mean, in one core of a modern PC you have more processing than the entire IRS had in 1980, yet they still managed to do everyone's tax returns, year after year. As if your stupid "Social" interactions are critical to anything. As if anyone gives a fuck what you had for breakfast today. Jesus, stop caring so much and learn how to program instead of jumping on the fucking hype wagon of cargo-cult data storage and retrieval.

      And yes, I did that in one paragraph on purpose.

      --
      Cool! Amazing Toys.
    5. Re:Silly question by Hurricane78 · · Score: 1

      It’s not a tree. It’s a graph. A tree is a graph’s retarded incomplete brother.

      I wish people would stop using trees, and use full ontologies instead. It only creates problems. In file systems. In OO class hierarchies, in categories and tags, etc.

      --
      Any sufficiently advanced intelligence is indistinguishable from stupidity.
  6. Well, Cassandra does better. by Chas · · Score: 2, Funny

    Until Voldy pulls that whole Avada Kedavra thing...

    --


    Chas - The one, the only.
    THANK GOD!!!
    1. Re:Well, Cassandra does better. by blair1q · · Score: 1

      fawkes.hogwarts.edu # su - voldemort
      Password:
      2010-05-08 16:08:45 have you hugged your death eater today? alias avada_kedavra
      kill -9
      2010-05-08 16:08:45 have you hugged your death eater today?

  7. Oracle/MySQL - Voldemort by caluml · · Score: 1

    A very large company I know is moving from Oracle/MySQL to Voldemort for certain parts of their system. The two they evaluated were Cassandra and Voldemort.

    --
    Get your own free personal location tracker
  8. Re:He-Who-Must-Not-Be-Named by blair1q · · Score: 1

    http://www.democraticunderground.com/discuss/duboard.php?az=view_all&address=433x266988

  9. File system? by Bromskloss · · Score: 1

    Key-value storage? That sounds like the ordinary file system to me.

    --
    Swedish plasma phys. PhD student; MSc EE; knows maths, programming, electronics; finance interest; seeks opportunities
    1. Re:File system? by Xeriar · · Score: 1

      Not a particularly useful use of the inode table. The filesystem is great for a few hundred or even a few thousand records, but when you're dealing with billions of records, that adds up to a lot of wasted space.

      --
      I am a science fantasy fan
  10. Re:Silly question - Couchdb by MrTrick · · Score: 1

    Try couchdb if you want to select ranges.

    Its keys are stored in a heap, so selecting ranges of values is a core use case.
    The view system also uses the same mechanism, so by having a cached view you can emit any key you like per record, and grab individual or ranges of values.

    Nifty. :-)

  11. Comparison Against Established Systems? by RAMMS+EIN · · Score: 1

    I am in a bit of a rush, so I can't netgrep for it myself right now, but I am curious how these new contenders stack up against more established key-value stores such as Berkeley DB and GDBM. Has anyone run the benchmarks?

    --
    Please correct me if I got my facts wrong.
  12. Re:Let there be light by DragonWriter · · Score: 1

    I kinda wonder why it's not possible to use these projects as backends for mysql and postgres.

    You could, but as soon as you try to implement the features of SQL that they lack on top of them you'll end up making them peform far worse than existing backends that are designed from the ground up to provide these features, so what would be the point?