Commits

jus...@basho.com  committed b842c3a

typo

  • Participants
  • Parent commits e916d83

Comments (0)

Files changed (2)

File www/arch.html

 as well as the vnodes responsible for the next N-1 partitions in the
 ring, where N is a bucket-configurable parameter that describes how
 many copies of the value to store.  A put request may specify
-that at least W (=< N) of those vnodes reply with success, and that DW
+that at least W (=&lt; N) of those vnodes reply with success, and that DW
 (=< W) reply with success only after durably storing the value.  The
 request will only be considered successful to the client when both
 W and DW have been satisfied by the nodes in question.

File www/mapreduce.html

 </p>
 
 <p>
-A "reduce phase" is conceptually simpler.  As it receives inputs from the preceding phase, it collates those inputs along with the ones already received and continually "reduces" the input set until it receives notification that it will receive no further data, at which point the entire reduced set will be streamed to the next phase. Note that this makes a reduce phase a concurrency barrier, as opposed to map phases which can be processing in parallel.  In order for this process to make any sense, a reduce phase's function must be commutative, associative, and idempotent.  Good examples are <code>sum</code> and <code>set-union</code>.  As Riak's core focus is on decentralized data storage and not on compute farming, reduce phases are generally run on a single cluster -- there is no data-locality gain to be had in reduce.
+A "reduce phase" is conceptually simpler.  As it receives inputs from the preceding phase, it collates those inputs along with the ones already received and continually "reduces" the input set until it receives notification that it will receive no further data, at which point the entire reduced set will be streamed to the next phase. Note that this makes a reduce phase a concurrency barrier, as opposed to map phases which can be processing in parallel.  In order for this process to make any sense, a reduce phase's function must be commutative, associative, and idempotent.  Good examples are <code>sum</code> and <code>set-union</code>.  As Riak's core focus is on decentralized data storage and not on compute farming, reduce phases are generally run on a single node -- there is no data-locality gain to be had in reduce.
 </p>
 
 <h3>A perfect fit for the Web</h3>