Re: The TransRelational Model: Performance Concerns
From: Mikito Harakiri <mikharakiri_at_iahu.com>
Date: Thu, 11 Nov 2004 16:26:58 -0800
Message-ID: <IBTkd.14$vi7.133_at_news.oracle.com>
Date: Thu, 11 Nov 2004 16:26:58 -0800
Message-ID: <IBTkd.14$vi7.133_at_news.oracle.com>
"Marshall Spight" <mspight_at_dnai.com> wrote in message
news:K7Tkd.396968$D%.165120_at_attbi_s51...
> "Josh Hewitt" <lajos.nagy_at_gmail.com> wrote in message
news:1c92edeb.0411102354.45157060_at_posting.google.com...
> I note that if all columns are sorted, then
> every join can be a merge join, which is darned fast. O(m+n).
Merge join (and performance-wise similar HJ) is a mediocre method. It's better than [unindexed] Nested Loops, but all [OLTP] applications are usually tuned to leverage indexed Nested Loops, which is the fastest of all. Received on Fri Nov 12 2004 - 01:26:58 CET