10 ms·
FoundationDB: A new generation of NoSQL database
- jacques_chester 14y agoWithout wanting to be any snarkier than usual, all-the-scale-without-the-compromise has been possible for decades. It's just really expensive.
- shansinha79 14y agogood point.. the key difference here is that it's also "..without the cost"
- olalonde 14y agoHow?
- d0ugal 14y agonoSQL and YesACID. It's that easy.
- jacques_chester 14y agoCall your local Oracle, IBM, Sybase, Teradata, AsterData etc sales engineer. They'll be happy to fill you in. Be prepared for sticker shock.
- aaronblohowiak 14y agoExplain how you can have availability in the face of network partitions and a perfect total ordering to events (ie: the sequentiality you claim.)
- jamesaguilar 14y agoPresumably they sacrifice availability? If your network is only partitioned 1/1000 of the time and you only need 99.9% uptime, that would be a viable approach.
- DanWaterworth 14y agoYou can use Paxos. There will be some partitions that can cause an outage, but this is only the case when there is no majority of nodes that can communicate with each other, which in practice means you are exposing yourself to a vanishingly small risk.
- aaronblohowiak 14y ago3 rounds of communication to reach consensus for every transaction? Off the cuff, it seems like that would hinder the performance. I haven't tested it, though..
- DanWaterworth 14y agoIt doesn't have to be per transaction, it could be for a batch of transactions. There are also optimizations like multi-paxos that can reduce the number of round trips.
- sausagefeet 14y agohttp://cs-www.cs.yale.edu/homes/dna/papers/calvin-sigmod12.pdf http://cs-www.cs.yale.edu/homes/dna/papers/calvin-sigmod12.p...
- surrealize 14y agoThat system works by giving up interactive transactions. But the foundationdb page claims to have interactive transactions, so it must be doing something else. From Abadi's blog: http://dbmsmusings.blogspot.com/2012/05/if-all-these-new-dbms-technologies-are.html http://dbmsmusings.blogspot.com/2012/05/if-all-these-new-dbm... Calvin requires all transactions to be executed fully server-side and sacrifices the freedom to non-deterministically abort or reorder transactions on-the-fly during execution. In return, Calvin gets scalability, ACID-compliance, and extremely low-overhead multi-shard transactions over a shared-nothing architecture. The comments on that post are pretty interesting, too. And from the foundationdb features page: http://foundationdb.com/#features http://foundationdb.com/#features FoundationDB transactions are true interactive sessions, unlike distributed databases that require stored procedures. This means that client code can make an iterative series of reads and writes over the network to execute complex transactions.
- sausagefeet 14y agoThank you for clarifying. I don't know much about DBs and the Calvin paper is the only one I'm aware of that addressed the commenters question.
- blackhole 14y agoThis very badly needs proof that it is, in fact, ACID compliant. Incredible claims require incredible evidence.
- Dave_Rosenthal 14y agoFoundationDB co-founder here. Yes, we provide the strongest level of ACID semantics. Although proving things about large computer programs is pretty hard, we have spent much of the past three years building testing and validations systems to ensure this is true. We run tens-of-thousands of nightly simulations to check system correctness and properties in the face of machine failures, partitions, etc. We also run long-running tests on real-world clusters using programmable network and power switches to simulate these same cases in the real world. So, we've convinced ourselves. What would you like to see on the site to help provide the kind of incredible evidence you're looking for?
- tagx 14y agoI worked under two of these guys two summers ago. They're really sharp guys and I have faith they can back up their claims.
- shin_lao 14y agoI'd be surprised to see how they can be truly ACID and truly scale out. This is an unsolved problem to me, I submit there are fine prints regarding ACID or scalability...
- wmf 14y agoJim Gray solved it in the 80s, but then we forgot about it.
- shin_lao 14y agoTo which of Jim's contribution are you referring to? I wasn't aware he designed a scale-out ACID transaction principle.
- wmf 14y agoI was thinking of http://research.microsoft.com/en-us/um/people/gray/papers/TEs.pdf http://research.microsoft.com/en-us/um/people/gray/papers/TE... although in retrospect I'm not sure if they implemented cross-node transactions.
- fdr 14y agoHmm. Okay. I open a transaction for three days (let's say indefinitely), maybe reading a few tuples here and there and updating a few, but never committing. How does this system not fall over? I guess it could abort my transaction... Still, I think their performance numbers can be legit, because they are much, much slower than what a handful (much less than 24) machines could do if fully partitioned and without coordination. 500KRead/Second on such small values is not really fantastic performance over 24 machines. I also don't understand the initial burst-capacity on the read-side either, although I can guess -- on writes it can make sense because some work is deferred, but I'm trying to understand how that can happen on reads as well. My guess is a transaction ID allocation on-read that hits a wall somewhere. Another common use case is I want to take a consistent backup/copy. For large databases, this is a very, very long snapshot to maintain, if MVCC, or a lot of locks to acquire, if 2PL. How does the system act then? All in all, I think it's pretty neat, and I like that someone is dealing with OLTP database problems with a mind towards easing one's burden via transactions.
- haberman 14y ago> Okay. I open a transaction for three days (let's say indefinitely), maybe reading a few tuples here and there and updating a few, but never committing. How does this system not fall over? They say they use optimistic concurrency control, so your writers aren't taking any locks, instead the transaction will just fail when you commit if any of your read/modify/write's were modified in the meantime.
- cbsmith 14y agoHonestly... if you have figured out how to scale with full ACID... I have a hard time believing that having SQL support in there is going to "kill" your ability to scale.
- Roboprog 14y agoI'm guessing that no-SQL documents are written at a more course granularity than SQL table rows. One document could well represent 3, 4, 5 rows in a normalized SQL database. OTOH, if you put all your "documents" in 3rd normal form, you might not see much gain.
- cbsmith 14y agoLooking at what they are providing, it's a shared nothing architecture, with data stored in ordered form. Technically, you can make this work in a very scalable fashion with an SSTable style store. Think of it as LevelDB with a distributed B+ tree (or even just a few extra levels) handling the partitioning between nodes. That can scale quite well, and wrap updates and reads with snapshots at very low overhead to provide all the key bits to handle ACID in a distributed database.
- shin_lao 14y agoWhat's problematic is when you have a transaction that span amongst several nodes and you need to reconcile several transactions (commit phase). The usual way to do it is to refuse the transaction if a conflict is detected, however this is a real performance and useability issue for a NoSQL database. What I'm implying is that if you have ACID transactions but they can fail very easily, you don't offer much...
- cbsmith 14y agoSSTable style databases are very cheap to snapshot, so you could totally handle this MVCC style. I buy the logic could get nutty in some pathological cases, but performance wise it shouldn't be much of a problem.
- jynnan 14y agoIt's not that hard to retry a transaction until some deadline is reached. Many programming languages have standard library facilities to make this extremely easy. If the database is fast enough and transaction failure is at least moderately unlikely, it's not really an issue.
- damian2000 14y agoI recommend having a read of this article explaining the differences between CAP and ACID: http://www.infoq.com/articles/cap-twelve-years-later-how-the-rules-have-changed http://www.infoq.com/articles/cap-twelve-years-later-how-the... TL;DR ACID represents one design philosophy at the consistency end of the consistency-availability spectrum. According to CAP, to have the maximum Consistency of ACID, you'd need to trade-off against a lower Availability and/or Partitionability.
- jynnan 14y ago"Trading off against partinonability" is kind of a strange concept -- not only can you not prevent network partitions, you usually can't tell when they've happened until it's too late. The real upshot of the CAP theorem is that you have to choose what goes in the face of a partition. An ACID system says you lose availability (writes, and possibly reads, fail if you can't reach a majority of the participants); an Eventually Consistent system may pick either.
- haberman 14y agoThis is a beautiful site with tons of information, graphs, lists, examples, etc. and yet omits the one thing that underpins it all: how it actually works. The claims are: serializable ACID cross-machine transactions "without performance penalty." MVCC with optimistic concurrency control. Optimistic concurrency control means that the server has to check the version on all modified data before the transaction commits. Cross-machine transactions mean that this version check has to happen on multiple machines. ACID means that both machines have to either commit (if all the version checks succeed) or roll back. How are you going to reconcile all of these requirements without resorting to two-phase commit, which most certainly has a performance penalty? And how are you going to get serializable transactions across machines without processing these cross-machine commits one at a time (waiting for two-phase commit each time)? I'm just not seeing it.
- aphyr 14y agoSerialized transactions over a broad distribution of keys isn't a huge problem, but you're right: this bodes poorly for hot data. I'm more concerned about their CAP semantics: I'm sorry, but claiming multidc availability and acid transactions is not gonna work.
- voidmain 14y agoFoundationDB co-founder here. As any ACID database must, we choose Consistency over Availability in the CAP theorem sense. This means that when a datacenter is disconnected or poorly connected to the internet, the database is not available for writes in that datacenter. If you are serving a web site to the internet, and need it to stay available if one Amazon AZ fails, this isn't too bad. Some applications really do need disconnected operation, and thus 'AP' semantics. (For example, a grocery list for a mobile phone, or an application that must be available everywhere if the entire Internet partitions.)
- aphyr 14y agoSo you require quorum over data centers to stay up? How do you provide transactional consistency between dcs? Multipaxos over blocks of transactions with delayed failure?
- d0ugal 14y agoWhat exactly is "YesACID" ?
- ericcholis 14y agoPerhaps I'm being a designer-snob, but Twitter's Bootstrap has quickly become too popular. I honestly have a hard time taking a site seriously when it uses the default Bootstrap look. Having a unique visual identity is extremely important.
- Kudos 14y agoI don't think you're being a designer-snob. Bootstrapping your design with Twitter Bootstrap is cool, making Twitter Bootstrap your design is not.
- Wilya 14y agoHonestly, if someone wants to sell me a database, I'd prefer they spend money on database engineers rather than on designers. To each his own, I guess.
- forgotAgain 14y agoI don't think it's a designer-snob thing. Taking the bootstrap provided website and a lot of overreaching claims of db goodness gives me an immediate sense of there being no there, there.
- crazygringo 14y agoIt's true. It's fine for a small MVP in beta, and even a good sign (shows they're concentrating on the product details the are important). But launching an entire new database, does deserve its own visual identity. That said, their logo is rather nice!
- jhull 14y agoIs it just me or is there a new "superior-than-the-others" NoSQL solution every week?
- bsg75 14y agoToday's database is better than yesterday's.
- wmf 14y agoHey guys, I like units on the Y axis of graphs.
- Dave_Rosenthal 14y agoSo do I. Fixed :)
- christianaranda 14y agoI don't need to be convinced. No doubt this works as advertised. Nicely done.
- d0ugal 14y agoSwitching all my production code to use their alpha as we speak.
- js4all 14y agoThe claim to be the first acid compliant NoSQL database is wrong. Bigcouch and Couchbase are around for a while. There is also CouchDB (without the scaling).
- voidmain 14y agoI was nervous writing that sentence, because it's hard to be sure of the truth of any claim to be 'first'! But none of the examples you mention, to my knowledge, provide multi-key ACID transactions. A compare and set facility for an individual key/document/row/entity group/etc is a very useful feature, but cannot be used to provide atomicity or isolation for transactions that read or write more than one key. We plan to write something longer talking about the different levels of support that various products provide for A,C,I, and D.
- js4all 14y ago> But none of the examples you mention, to my knowledge, provide multi-key ACID transactions If you see it that way, you are right. The guaranty is just for one key/document pair (the key can be a key vector though). There is no way to have a commit over several key/document pairs with these databases. If FoundationDB can do that, it is a big plus. If it can do it in a cluster, your product will have a great future.
- jynnan 14y agoYour performance tests seem to have been run on a cluster that lives on one gigabit LAN. Have you tested a cluster that's distributed geographically?