Re: Nested sets in SQL - inventor?

Appeo Allkam wrote:
> http://www.dbpd.com/vault/9811/kamfn.shtml

I don't quite understand the following passage in Kamfonas article

<quote>
You may ask: "Why don't we use a hierarchical keyword to achieve the same result?" For example, an IP address-like scheme enumerates the nodes of a tree as 1,1.1,1.2,1.3,1.1.1, and so on. The problem with this scheme is that you have to start all qualifications from the top. Otherwise, you'll have to scan the whole index or table. With the L and R enumeration however, you can anchor your search at any level, relate any node to any other one, and still employ matching index scans. </quote>

Any interpretations? Received on Wed Jul 27 2005 - 20:14:39 CEST