That would be a rather simple project, because it's already
implemented :-) unless, you mean something else with "tree join". What
I meant with "tree join" is nested joins in the form of a tree, for
example:
drop table a;
drop table b;
drop table c;
drop table d;
create table a(x int);
create table b(x int);
create table c(x int);
create table d(x int);
select * from (a inner join b on a.x=b.x) left outer join (c left
outer join d on c.x=d.x) on c.x=a.x;
... and not just as a chain as in:
select * from a inner join b on a.x=b.x left outer join c on c.x=a.x
left outer join d on c.x=d.x;
This was originally not possible, but was eventually implemented. I
forgot to remove it from the list. By the way, it was really tricky to
implement, if you really want to implement a join mechanism (for
example full outer join or merge join) I would probably do that
outside of the database, for example using TreeMaps or (for full outer
joins) by converting SQL statements to other SQL statements (for full
outer join possibly a "union all" or similar).
Regards,
Thomas
> --
> You received this message because you are subscribed to the Google Groups "H2 Database" group.
> To post to this group, send email to h2-da...@googlegroups.com.
> To unsubscribe from this group, send email to h2-database...@googlegroups.com.
> For more options, visit this group at http://groups.google.com/group/h2-database?hl=en.
>
--