| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Generalised approach to storing address details
> The relational algebra lacks the computational power needed to compute the transitive closure.
Below dbd does transitive closure over the following hierarchy:
god
adam
john
mary
eve
john
mary
(new 'god)
(new 'adam)
(new 'eve)
(new 'john)
(set god child adam)
(set god child eve)
(set adam child john)
(set adam child mary)
(set eve child john)
(set eve child mary)
(; Get god's children)
(; Gets adam, eve, john and mary)
(getRelD god child *)
Received on Wed Dec 13 2006 - 23:12:28 CST
![]() |
![]() |