| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: A Logical Model for Lists as Relations
JOG wrote:
> Bob Badour wrote:
>
>>Jay Dee wrote: >> >>>Bob Badour wrote: >>> > Since it is relatively easy to write a query that extends a relation >>> > with a rank per any explicit order, I am not even sure the ordinal >>> > attribute is required. >>> >>>True. I wasn't exactly sure what MS wanted to happen, for example, >>>to the fourth element in a list when the second element is elided. >>>Does it become the third? If so, your proposal is a good >>>solution. But... >>> >>>What if he envisions a list in which duplication of elements is >>>significant? >> >>If one has a numeric index that differs for each tuple, one never has >>duplication. If one has duplication, one wonders how to refer to the >>duplicates. As Codd observed long ago, once one has said a thing is >>true, what does saying it again achieve?
If there are two Ernies in real life, there is some way to distinguish them. The problem you describe is not a flaw of the logical data model but an incomplete analysis and design.
The same problems arose when recording information with pen and paper before computers were ever built. Received on Thu May 11 2006 - 08:51:20 CDT
![]() |
![]() |