BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:HyperDex: A Consistent\, Fault-tolerant\, Searchable NoSQL Store -
  Bernard Wong\, University of Waterloo
DTSTART:20120820T090000Z
DTEND:20120820T100000Z
UID:TALK39320@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Distributed key-value stores are now a standard component of h
 igh-performance web services and cloud computing applications. While key-v
 alue stores offer significant performance and scalability advantages\, the
  first wave of NoSQL stores typically compromise on consistency and drasti
 cally limit the system API.\n\nIn this talk\, I will present HyperDex\, a 
 novel\, open-source distributed key-value store that provides (1) strong c
 onsistency guarantees\, (2) fault-tolerance for failures and partitions af
 fecting up to f nodes\, and\n(3) a rich API which includes a unique search
  primitive that enables queries on secondary attributes. HyperDex achieves
  these properties through the combination of two recent technical advances
  called hyperspace hashing and value-dependent chaining. Performance measu
 rements from the industry-standard YCSB benchmark show that HyperDex these
  properties do not extract a high overhead: HyperDex is actually a factor 
 of 2-13 faster than Cassandra and MongoDB.\n\nI will also briefly present 
 two of our on-going projects on improving NoSQL stores. The first project 
 is a new lightweight distributed transaction processing framework for web 
 services. This framework avoids multi-phase commit protocols and coordinat
 or election by organizing transaction participants into transactional chai
 ns. The second project is a new NoSQL store that offers both performance i
 solation between jobs and high system utilization through reactive\, deadl
 ine-driven replication and an affinity-based job scheduling scheme\n\nOver
 all\, this talk outlines our vision on what properties the next generation
  data stores should offer their users\, and the steps we are taking toward
 s efficiently providing these properties in our systems.\n
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR
