Nested Sets, NSs, implemented as tree-like, adjacent lists,
are relatively flexible and extensible data structures and I
was wondering how you could define a metric or some sort of
criterion of measurability on them.
._ 'equality' between two nested set entities
implemented in the same system/using the same algorithm
could be reduced to a simple sequencial comparison of
their data streams;
._ 'commonality' between two or more NS entities could be
somehow measurably quantified by sequentially comparing the
'nodes of branches in the sets' . . .,
._ 'difference' between two or more NSs, based on
'commonality' could be somehow defined as how 'uncommon'
branches are, considering the differing parts of each NS
Then, given a number of nested sets, how would you define a
'metric' that would measurably give you the distance
between any two pairs of them?
Could you point me to any links on these ideas?
Please, notice I am not talking here about
implementation of NSs in SQL, which, by the way, I don't
find to be so optimal.
[email hidden]