| http://jdobbie.blogspot.com |
1203 |
| http://www.it4business.ru |
477 |
| http://pwfisher.com |
349 |
| http://www.graph-database.org |
272 |
| http://www.coderholic.com |
241 |
| http://www.slideshare.net |
144 |
| http://blog.meta.ua |
128 |
| http://moskalyuk.name |
86 |
| http://kupreev.com |
73 |
| http://www.stetsenko.net |
55 |
| http://jayant7k.blogspot.com |
51 |
| http://www.kupreev.com |
48 |
| http://www.cs.vsb.cz |
44 |
| http://www.blinkoftheday.com |
40 |
| http://it4business.ru |
40 |
| http://khishigee.miniih.com |
34 |
| http://www.khishigee.miniih.com |
31 |
| http://lj-toys.com |
29 |
| http://rubyrailsandwindows.blogspot.com |
29 |
| http://blog.klaushofeditz.de |
26 |
| http://www.pwfisher.com |
16 |
| http://jdobbie.blogspot.de |
12 |
| http://twitter.com |
10 |
| http://software-testing.ru |
10 |
| http://oo-programming.blogspot.com |
8 |
| http://web |
8 |
| http://paper.li |
5 |
| http://jayantkumar.in |
5 |
| http://jdobbie.blogspot.com.au |
5 |
| http://jdobbie.blogspot.fr |
5 |
| http://hdknr.posterous.com |
4 |
| http://www.e-presentations.us |
4 |
| http://translate.googleusercontent.com |
4 |
| http://xss.yandex.net |
4 |
| https://si0.twimg.com |
3 |
| http://jdobbie.blogspot.co.uk |
3 |
| http://russomi.blogspot.com |
3 |
| http://localhost |
3 |
| http://rubyrailsandwindows.blogspot.com.au |
2 |
| http://jdobbie.blogspot.in |
2 |
| https://twitter.com |
2 |
| http://jdobbie.blogspot.com.br |
2 |
| http://jdobbie.blogspot.ca |
1 |
| http://jdobbie.blogspot.mx |
1 |
| http://209.85.229.132 |
1 |
| http://www.miniih.com |
1 |
| http://feeds.feedburner.com |
1 |
| http://rubyrailsandwindows.blogspot.in |
1 |
| http://eddieawad.com |
1 |
| http://s.deeeki.com |
1 |
| http://graph-databases.org |
1 |
| https://twimg0-a.akamaihd.net |
1 |
The idea is to let
- the root node be represented by the interval [0, 1],
- the two children of the root node be represented by the intervals [0, 1/2] and [1/2, 1] respectively,
- the grandchild nodes by [0, 1/4], [1/4, 1/2], [1/2, 3/4] and [3/4, 1].
Then it's easy to find:
- the left and right children (one or both),
- all descendents of a node,
- all ancestors of a node,
- all nodes where you only go left (or right) from a given node. 3 months ago Reply
You can get a more exact definition on Wikipedia:
http://en.wikipedia.org/wiki/Big_O_notation 3 months ago Reply
I would have thought that, if there were 10 nodes, the maximum number of rows in the closure table would be 10 x 9 x 8 x 7 x ...etc... No? 6 months ago Reply
You're right about CONNECT BY syntax in Oracle. There's also a SQL-2003 syntax for 'common table expressions' that allows you to run recursive queries for Adjacency List tree designs (among other uses). As far as I know, Microsoft SQL Server, IBM DB2, and the recently released PostgreSQL 8.4 support this syntax (see http://wiki.postgresql.org/wiki/CTEReadme). 2 years ago Reply