Re: Hierarchical Query
From: Vadim Tropashko <vadimtro_invalid_at_yahoo.com>
Date: 26 May 2005 07:38:04 -0700
Message-ID: <1117118284.876512.319460_at_o13g2000cwo.googlegroups.com>
Date: 26 May 2005 07:38:04 -0700
Message-ID: <1117118284.876512.319460_at_o13g2000cwo.googlegroups.com>
Mikito Harakiri wrote:
> Kendall Willets suggested this method on comp.databases.theory some
> time ago.
If you are referring to this thread
http://tinyurl.com/7q57b
then, Kendall Willets' encoding assignes primes to leaves and is,
therefore, volatile. The novelty of Roji Thomas' approach is that his
method (developed into much greater detail, BTW) uses non-volatile
encoding.
> encodings for large graph fragment. Plus, how to handle acyclic graphs?
Cyclic? It's quite interesting why there are so many encodings for trees and almost none for graphs. Received on Thu May 26 2005 - 16:38:04 CEST