On Mon, 11 Mar 2019 10:39:06 +0100 Jean-Luc Hainaut <[email protected]> wrote:
> Your implementation of trees is that of network databases at the > pointer-based physical level but definitely not relational. Try this: > > create table TREE( > ID integer not null primary key, > Parent integer references TREE on delete ... on update cascade); > -- Notice the absence of "not null" > create index XTREE on TREE(Parent); -- Only useful for large sets of > nodes > > That's all. Bravo! To the OP: this is the answer you want, whether you want it or not. > > I've a tree with doubly linked items. That's the root of your problem, as it were. It's hard to solve in SQL because you're trying to use SQL in a nonrelational way. --jkl _______________________________________________ sqlite-users mailing list [email protected] http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
