Re: Designing database tables for performance?
From: -CELKO- <jcelko212_at_earthlink.net>
Date: 28 Feb 2007 11:21:20 -0800
Message-ID: <1172690480.650235.104920_at_t69g2000cwt.googlegroups.com>
Date: 28 Feb 2007 11:21:20 -0800
Message-ID: <1172690480.650235.104920_at_t69g2000cwt.googlegroups.com>
>> The fact the items are a hierarchy doesnt help - difficult to avoid the 'in' statement without knowing how many levels there are in the hierarchy. <<
You might consider looking at TREES & HIERARCHIES IN SQL for other ways to model a hierarchy which perform much better for queries. In particular, Nested Sets model is very good for reporitng that needs hierachical aggregations and display when the number of levels is not known.
Please forgive me for getting back on topic in a thread with Cimode and Badour ranting, but I just had to make an actual response :) Received on Wed Feb 28 2007 - 20:21:20 CET