[Hama Wiki] Trivial Update of "Hamburg" by HyunsikChoi

[Apache Wiki <wi...@apache.org>]

Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Hama Wiki" for change notification.

The following page has been changed by HyunsikChoi:
http://wiki.apache.org/hama/Hamburg

------------------------------------------------------------------------------
   * or make an M/R program more complicated
    * To avoid above two inefficient methods, the M/R program will be complicated with code to communicate data among data nodes.
  
- These problems are very common in many areas; especially, many graph problems are exemplary. Let's write description of an example
+ These problems are very common in many areas; especially, many graph problems are exemplary. 
+ 
+ TODO - write description of an example.
+ 
  Therefore, we try to propose a new programming model, named Hamburg. The main objective of Hamburg is to support well the problems based on data having complexity dependency one another. This page is an initial work of our proposal.
+ 
  == Goal ==
  Follow scalability concept of shared-nothing architecture
  Support to computation for data having complexity relations, like graph data.
@@ -24, +28 @@

  It will be efficient if total communicated data is smaller then intermediate data to be aggregated into reducers.
  
  === Initial contributors ===
- 
   * Edward J. (edwardyoon AT apache.org)
   * Hyunsik Choi (hyunsik.choi AT gmail.com)