Hi Dragan,

>I discovered this by accident, having to fix an unrelated piece of code in that form, where it always built the whole tree (about 200 nodes) each time, which took about 15-20 seconds, which annoyed me to no end, because I had to run the form very often. So I ran the coverage and found out that it ran 200 SQLs. I just applied my recursive hierarchy logic I developed in 1989 (which was, basically, seek and scan while, although nested) and it started appearing instantaneously.

I also switch to seek/scan to speed up certain use cases quite often - usually through avoiding building Rushmore-bitmaps, which involves index scanning. But reading your case my first gut reaction was "different algorithm". Wouldn't it be possible to create a table defining the whole tree with a more complex single SQL statement ? Of course the second reaction was "good enough - don't fix if not broken" <g>.

regards

thomas