SlideShare is now on Android. 15 million presentations at your fingertips.  Get the app

×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Beware of your Hype Value Stores

by Working at Exalead on Jun 23, 2009

  • 5,209 views

Key value stores are popping all around the web, describing themselves as the best fit for your webapp… but take care of the hype ! Think you’ll have 10000+ writes a sec ? There’s a lot of ...

Key value stores are popping all around the web, describing themselves as the best fit for your webapp… but take care of the hype ! Think you’ll have 10000+ writes a sec ? There’s a lot of unsaid “special features” that you have to know. Don’t trust benchmarks, even your own. Here’s how to choose the right key value store for your app !

The video is also available on youtube: http://www.youtube.com/watch?v=YZD8-EzozKQ

Statistics

Views

Total Views
5,209
Views on SlideShare
5,131
Embed Views
78

Actions

Likes
7
Downloads
36
Comments
2

4 Embeds 78

http://www.altaidevalley.com 46
http://www.slideshare.net 18
http://www.linkedin.com 13
http://altaide.typepad.com 1

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel

12 of 2 previous next

  • ahfeel Jérémie BORDIER at Exalead Hi Jeff,
    Of course there are some misrepresentations on these slides, but only in terms of generalisation (you can't say much in 5 minutes ;)).

    First, on your last notice on the error we made on our algorithms, we didn't screw them up. We designed them in what seemed a very good way. We just faced the truth when dealing with billion of records, and guess what ? Tokyo cabinet b+trees are designed in the same fashion, leading to dramatic perf decrease (http://bjclark.me/2009/08/04/nosql-if-only-it-was-that-easy/ for example...).

    About the 'up to 9' random IOs, the actual truth it that it may be less of course, but more importantly, it may be a lot more too, depending on the size of your key, the number of node to visit, if they are in RAM or not etc... So it's much more complicated than that, in both ways.
    4 years ago
    Are you sure you want to
    Your message goes here
    Processing…
  • guest25d0c1 Jeff Darcy There are a couple of serious misrepresentations in these slides. A decent disk is capable of doing ~300 *random* IOPS, but only a complete idiot lets their data store - be it a database, filesystem, or anything else - generate a seek per operation, and anything serious uses multiple spindles. You say *up to* nine random IOPS per lookup (which is a bit of a stretch even when using only one disk), and then you use that as an *average* for further calculation, which is simply dishonest. When you say you 'had similar algorithms' you obviously screwed them up; just because you didn't know how to implement such a system better doesn't mean others don't.

    You obviously have an axe to grind, or maybe you just want to get some publicity by being contrary. That's fine, but don't let your agenda undermine your integrity.
    4 years ago
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Beware of your Hype Value Stores Beware of your Hype Value Stores Presentation Transcript