| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: repeating groups
Jonathan Leffler wrote:
> mAsterdam wrote:
>> Marshall Spight wrote: >> >>> ... there are several ways out of the repeating groups problem >>> >>> 1) decomposing relations, aka "classical" 1NF >>> 2) higher-than-1 cardinality attributes: lists or sets >> >> Aren't you jumping over the "order may have meaning" problem >> here by taking these two together?
In the products I know the choice is made for us. In the XML family every order is kept (treated as significant - even when it isn't/shouldn't be), in the SQL family in everything except in the list of characters (varchar) order is thrown away (treated as insignificant).
>>> 3) Fully nested relations. >> >> >> lists-of-lists? sets-of-sets? lists-of-sets? sets-of-lists? >> >>> Actually, 2) was something I hadn't really thought of before: >>> add *one* level of nesting. This idea is interesting but less >>> appealing than 3, because it is less regular. I tend to prefer >>> orthogonal designs; they have fewer arbitrary limitations.
Nice.
> 1-level of nesting would be arbitrary and would very quickly become
> restrictive. Indeed, you'd have to be very careful not to lose the
> closure property of the algebra.
>
> >[...snippage...]
Time for the obligatory Einstein quote (and some more) on simplicity: http://www.quotegarden.com/simplicity.html Received on Sun Feb 19 2006 - 05:03:32 CST
![]() |
![]() |