Brian, I believe "merge join" actually refers to an implementation of the sort-merge join algorithm. Which is all kinds of awesome fastness for certain JOIN cases (columns without indexes on them, for example), BUT not what you describe. If I'm wrong, I'm sure Thomas Mueller will post and correct this.
That said, can you provide a use case and example where this would be better than current MERGE behavior? I think I know what you describe, but I'm not entirely sure how it would be useful. Cheers, Bob McGee On Jul 24, 1:20 am, Brian <[email protected]> wrote: > I saw merge join on the TODO list - which I presume is making MERGE > behave more like it does in Oracle/SQL with WHEN MATCHED THEN and WHEN > NOT MATCHED THEN clauses etc.. > > Just wanted to register that it would be a useful feature - hopefully > bumping it up in priority somewhere higher than it is now - but of > course under the current flurry of activity around CSVREAD I/O, the > new PAGESTORE, and multithreading. All of which is goodness. > > I did see a test case being discussed over on the PostgreSQL forums > at:http://archives.postgresql.org/pgsql-hackers/2008-04/msg01475.php > and it looks like HSQL has an implementation. > > Loving H2, > -Brian --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "H2 Database" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/h2-database?hl=en -~----------~----~----~----~------~----~------~--~---
