| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Nested Sets vs. Nested Intervals
asdf wrote:
> Thank you very much.
>
> I have the category in one table. The website listings in another
> table. Each website listing contains a cat_id referencing the 'id'
> column in the 'web_directory' table. Searches are done by matching the
> listings title, description, etc. What is the most efficient way to
> restrict the results to a specific category?
I prefer formal description of the problem. In Celko words "please post
DDL"
> How efficient is the nested intervals model compared to the adjacency
> model for moving categories?
Adjacency relation is more efficient for moving categories. In nested intervals you have to recalculate encodings of all the nodes in a tree branch. The formula for encoding recalculation is quite simple, but still the overall efficiency can't match adjacency model where you change the encoding of just one node. Received on Fri Nov 18 2005 - 18:25:42 CST
![]() |
![]() |