Understanding Distributed Data Storage

Operations, Sutton North
Average rating: **...
(2.90, 10 ratings)

We’ll investigate how and why certain data structures work, and most importantly, what exactly you use them for.

  • DHT: Distributing storage to several nodes
  • Map/reduce: Distributed data mining (without Hadoop)
  • Push/pull: Distributing workload across servers
  • Merkle trees: Active anti-entropy for replicated values
  • bloom filters: Reduce cache reads by pre-checking existence
  • CRDTs (commutative replicated data types): Automated replicated value merging on any eventually consistent database
  • messaging patterns: Passing signals between processes and/or data storage
Photo of Eric Redmond

Eric Redmond

Nike

Eric’s a programmer. He’s also a longtime advocate of alternative storage mechanisms (especially the distributed kind), and loves to write and talk about them. He’s co-author of Seven Databases in Seven Weeks and recently A Little Riak Book. Eric is a Riak Engineer at Basho, and runs the largest technical web group in Portland.

Sponsors

Sponsorship Opportunities

For information on exhibition and sponsorship opportunities at the conference, contact Gloria Lombardo at (203) 381-9245 or glombardo@oreilly.com

Media Partner Opportunities

For media partnerships, contact mediapartners@ oreilly.com

Press and Media

For media-related inquiries, contact Maureen Jennings at maureen@oreilly.com

Contact Us

View a complete list of Velocity contacts