Return-Path: Delivered-To: apmail-lucene-hadoop-dev-archive@locus.apache.org Received: (qmail 9457 invoked from network); 16 Nov 2006 18:29:48 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 16 Nov 2006 18:29:48 -0000 Received: (qmail 34764 invoked by uid 500); 16 Nov 2006 18:29:57 -0000 Delivered-To: apmail-lucene-hadoop-dev-archive@lucene.apache.org Received: (qmail 34726 invoked by uid 500); 16 Nov 2006 18:29:57 -0000 Mailing-List: contact hadoop-dev-help@lucene.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: hadoop-dev@lucene.apache.org Delivered-To: mailing list hadoop-dev@lucene.apache.org Received: (qmail 34712 invoked by uid 99); 16 Nov 2006 18:29:57 -0000 Received: from herse.apache.org (HELO herse.apache.org) (140.211.11.133) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 16 Nov 2006 10:29:57 -0800 X-ASF-Spam-Status: No, hits=0.0 required=10.0 tests= X-Spam-Check-By: apache.org Received-SPF: neutral (herse.apache.org: local policy) Received: from [204.127.192.81] (HELO rwcrmhc11.comcast.net) (204.127.192.81) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 16 Nov 2006 10:29:43 -0800 Received: from [192.168.168.15] (c-71-202-24-246.hsd1.ca.comcast.net[71.202.24.246]) by comcast.net (rwcrmhc11) with ESMTP id <20061116182923m110019ma2e>; Thu, 16 Nov 2006 18:29:23 +0000 Message-ID: <455CAE02.6030309@apache.org> Date: Thu, 16 Nov 2006 10:29:22 -0800 From: Doug Cutting User-Agent: Thunderbird 1.5.0.7 (X11/20060922) MIME-Version: 1.0 To: hadoop-dev@lucene.apache.org Subject: Re: [jira] Created: (HADOOP-713) dfs list operation is too expensive References: <002701c708fe$77c2d0c0$d09215ac@ds.corp.yahoo.com> In-Reply-To: <002701c708fe$77c2d0c0$d09215ac@ds.corp.yahoo.com> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Virus-Checked: Checked by ClamAV on apache.org Hairong Kuang wrote: > "Dfs -du" is implemented using list requests. So I propose that we support > two types of list: one computing subtree size and one not. Put another way: there should be a namenode method that computes a subtree size: we don't want to compute these client-side. Doug