Return-Path: Delivered-To: apmail-db-derby-dev-archive@www.apache.org Received: (qmail 59339 invoked from network); 15 Oct 2007 17:04:03 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 15 Oct 2007 17:04:03 -0000 Received: (qmail 36403 invoked by uid 500); 15 Oct 2007 17:03:50 -0000 Delivered-To: apmail-db-derby-dev-archive@db.apache.org Received: (qmail 36371 invoked by uid 500); 15 Oct 2007 17:03:50 -0000 Mailing-List: contact derby-dev-help@db.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: Delivered-To: mailing list derby-dev@db.apache.org Received: (qmail 36362 invoked by uid 99); 15 Oct 2007 17:03:50 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 15 Oct 2007 10:03:50 -0700 X-ASF-Spam-Status: No, hits=1.2 required=10.0 tests=SPF_NEUTRAL X-Spam-Check-By: apache.org Received-SPF: neutral (athena.apache.org: local policy) Received: from [63.82.107.6] (HELO red.amberpoint.com) (63.82.107.6) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 15 Oct 2007 17:03:54 +0000 Received: from [127.0.0.1] (bpendleton-dsk2.edgility.com [10.10.11.13]) by red.amberpoint.com (8.14.0/8.12.11) with ESMTP id l9FH3VhH001515 for ; Mon, 15 Oct 2007 10:03:32 -0700 (PDT) Message-ID: <47139D63.8070104@amberpoint.com> Date: Mon, 15 Oct 2007 10:03:31 -0700 From: Bryan Pendleton User-Agent: Thunderbird 2.0.0.6 (Windows/20070728) MIME-Version: 1.0 To: derby-dev@db.apache.org Subject: Re: [jira] Commented: (DERBY-2998) Add support for ROW_NUMBER() window function References: <252238.1192451271452.JavaMail.jira@brutus> In-Reply-To: <252238.1192451271452.JavaMail.jira@brutus> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Virus-Checked: Checked by ClamAV on apache.org > After an offline chat with Knut, I started looking at how a table scan is stopped for indexes. Excellent! I think this is a great way to study the problem. If you have a chance, I think it would be great if you could summarize how this algorithm currently behaves in the index case. I'm quite interested in understanding how the current implementation works, too. thanks, bryan