Path: dp-news.maxwell.syr.edu!spool.maxwell.syr.edu!drn.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!newsfeed.frii.net!newsfeed.frii.net!140.99.99.194.MISMATCH!newsfeed1.easynews.com!easynews.com!easynews!news.he.net!chekhov.conxion.net!news.oracle.com!not-for-mail From: "Mikito Harakiri" Newsgroups: comp.databases.theory References: <1c92edeb.0411102354.45157060@posting.google.com> Subject: Re: The TransRelational Model: Performance Concerns Lines: 12 X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Message-ID: Date: Thu, 11 Nov 2004 16:26:58 -0800 NNTP-Posting-Host: 130.35.179.159 X-Trace: news.oracle.com 1100219880 130.35.179.159 (Thu, 11 Nov 2004 16:38:00 PST) NNTP-Posting-Date: Thu, 11 Nov 2004 16:38:00 PST Xref: dp-news.maxwell.syr.edu comp.databases.theory:28084 "Marshall Spight" wrote in message news:K7Tkd.396968$D%.165120@attbi_s51... > "Josh Hewitt" wrote in message news:1c92edeb.0411102354.45157060@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.