University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > The Brave New World of Next-Generation NoSQL Data Stores

The Brave New World of Next-Generation NoSQL Data Stores

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance and scalability advantages, the first wave of NoSQL stores typically compromise on consistency, fault-tolerance, performance, or functionality, and sometimes on all four. This talk will present HyperDex, a novel, open-source, distributed key-value store developed by my group that provides (1) strong consistency guarantees, (2) fault-tolerance for failures and partitions affecting up to f nodes, and (3) a rich API which includes ACID transactions and a unique search primitive that enables queries on secondary attributes. HyperDex achieves these properties through the combination of three recent technical advances called hyperspace hashing, value-dependent chaining and linear transactions. Despite offering stronger guarantees than first-gen NoSQL data stores, HyperDex is also a factor of 2-13 faster than Cassandra and MongoDB. This talk will outline these techniques, identify new research directions, and discuss how these breakthroughs relate to the oft-quoted, but mostly misunderstood, CAP credo.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity