A Path Through A NOSQL Summer Reading

     转自http://doubleclix.wordpress.com/2010/06/12/a-path-throug-nosql-summer-reading/  相当多的NOSQL文章值得一读

      The NOSQL Summer reading is an excellent idea initiated by Tim & is now spread across the world (~380 participants in 27 cities!).  The papers are interesting and cover a variety of topics of interest to the NOSQL community.

As I was collecting the papers, the parallels with the Design Patterns study group struck me. So I thought of adding a suggested navigation through the papers and also a few opening questions for discussions. If it makes sense,  would be happy to move this to a Wiki for a collaborative navigation/question/notes. Let me know … :

P.S : I also have materials from my OSCON NOSQL Tutorial

Update [10/2/x] : As I see more related papers, I am adding them to this list

Navigation:

The papers can be grouped & discussed as a topic:

• Core NOSQL (Start with running code)
  • Dynamo
  • Cassandra
  • BigTable
  • *The Google File System
  • MapReduce
• CAP Theorem (And now time for some background and underlying discussions)
  • *Towards Robust Distributed Systems (Brewer’s 2000 PODC Keynote)
  • BASE
  • The Byzantine Generals Problem
  • Brewer’s Conjuncture
  • Eventually Consistent
  • The End Of An Architecture Era
  • Harvest, Yield,…
  • Life beyond Transactions
• The SQL World (Time to take a peek into the SQL world)
  • The transaction Concept
  • Henry Baker’s e-mail
  • The 1995 SQL reunion
  • Access Path Selection
  • A relational Model
• Distributed Storage
  • Stasis
  • Virtual Synchrony
• Distributed Time
  • Paxos Made Simple
  • *Paxos Made Practical
  • Time, Clocks,…
  • Timestamps in Message Passing
  • Virtual Time
  • Chubby
• Algorithmics & Data Structures of interest (Optional)
  • CRDT
  • The graph Traversal Pattern
  • LSM Tree
• Internet-scale systems (End the summer reading with a bang – looking at the big picture)
  • On designing and deploying …
  • The Process Group Approach
• Missing (Homework for the Winter ?)
  • Vector Clocks
  • [Update 7/15/10] Bloom Filter
    • Original Paper by Walter H.Bloom
    • Scalable Bloom Filters
    • HBase BF Impl (0.90) (Also the attached Bloom_Filters_in_Hbase.pdf is very informative)
    • Combinatoral Generation
    • Cache Efficient Bloom Filter
  • Schemes for the usage of memory & disk
  • [Update 6/27/10]Gossip
    • Efficient Reconciliation and Flow Control for Anti-Entropy Protocols, Robbert van Renesse et al
    • A weakly coupled adaptive Gossip Protocol
  • [Update 6/28/10]Consistent Hashing
    • Consistent Hashing Paper
  • [Update 7/8/10]Failure Detection 
    • The ϕ Accrual Failure Detector
    • Unreliable Failure Detectors (Tushar,Sam)
    • The Weakest Failure Detector (Tushar, Vassos & Sam)
    • Implementing the Weakest Failure Detector
• Scalability (new)
  • [Update 10/2/x] Google Percolator
• Appendix:
  • PNUTS
  • YSB

Opening Questions & Discussion Pointers:

• Notes from Philadelphia group

P.S: I also have a decent number of NOSQL bookmarks – need to organize it a bit better …