Mailing-List: contact common-commits-help@hadoop.apache.org; run by ezmlm
Precedence: bulk
Reply-To: common-dev@hadoop.apache.org
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
From: Apache Wiki <wikidiffs@apache.org>
To: core-commits@hadoop.apache.org
Date: Wed, 02 Sep 2009 14:30:37 -0000
Message-ID: <20090902143037.4098.62214@eos.apache.org>
Subject: [Hadoop Wiki] Trivial Update of "BristolHadoopWorkshop" by
 SteveLoughran

Dear Wiki user,

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

The following page has been changed by SteveLoughran:
http://wiki.apache.org/hadoop/BristolHadoopWorkshop

The comment on the change is:
fix some sentences

------------------------------------------------------------------------------
  
  There was discussion on handing big graphs in the system, ones where the graph itself is very large. Someone need's to take Paolo's PageRank-over-MapReduce code and test it on bigger data sets.
  
- There was a good point on what is "efficient" in this world: If you can do it in O(n) on MR, and there is no single computer in the world that can work on a graph of that scale, then it's efficient.
+ There was a good point on what is "efficient" in this world. 
  
- The key point here being that yes, something done as a chain of MR jobs on a Hadoop cluster may seem an inefficient approach, but if there is no other way to store that much data, or run through it, then graph people will be happy.
+ Yes, something done as a chain of MR jobs on a Hadoop cluster may seem an inefficient approach, but if there is no other way to store that much data, or run through it, then graph people will be happy.
  
  = Yahoo! MS search deal =