Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
![]() |
![]() |
Home -> Community -> Usenet -> c.d.o.misc -> Re: Efficiency of hierarchical queries
Hi,
I meet the same trouble with table where there is a lot hierachical level. The table is big and have a few insert/update/delete. A second table has been created bigger with all the hierachy. insert update delete is done by store procedure. The query is made only on that table.
-- Regards LANGE Francois. flange_at_pt.lu 29A Route du vin. L5450 Stadtbredimus. Grand Duchy Of Luxembourg. TEL (int) 352 697412.(*) CEL(int) 352 021193652(*) Phone numbers are variable length in Luxembourg. Grand Duchy Of Luxembourg is a small country 80 miles on 60 miles between France,Germany and Belgium. Keith D Gregory <keith_at_inconcert.com> wrote in article <34D60B3D.41D9798_at_inconcert.com>...Received on Tue Feb 03 1998 - 00:00:00 CST
> Looking at the execution plan for a hierarchical query, I see a table
> scan, no matter what I do for indexing hints. It seems to me that this
> will result in very poor performance for the table in question, which
> could contain several million rows.
>
> So, is there something magical about the CONNECT BY operation, or will
> it really scan my table?
>
> -kdg
>
![]() |
![]() |