Path: dp-news.maxwell.syr.edu!spool.maxwell.syr.edu!drn.maxwell.syr.edu!news.maxwell.syr.edu!newscon02.news.prodigy.com!prodigy.net!news.glorb.com!postnews.google.com!o13g2000cwo.googlegroups.com!not-for-mail
From: "Vadim Tropashko" <vadimtro_invalid@yahoo.com>
Newsgroups: microsoft.public.sqlserver.programming,comp.databases.theory
Subject: Re: Hierarchical Query
Date: 26 May 2005 07:38:04 -0700
Organization: http://groups.google.com
Lines: 16
Message-ID: <1117118284.876512.319460@o13g2000cwo.googlegroups.com>
References: <42928048$1_1@rain.i-cable.com>
   <1116960769.637939.154330@z14g2000cwz.googlegroups.com>
   <u6t67cOYFHA.4032@tk2msftngp13.phx.gbl>
   <1117037337.540731.73370@g14g2000cwa.googlegroups.com>
   <1117048985.084993.174910@o13g2000cwo.googlegroups.com>
NNTP-Posting-Host: 148.87.1.171
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1117118290 11042 127.0.0.1 (26 May 2005 14:38:10 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Thu, 26 May 2005 14:38:10 +0000 (UTC)
In-Reply-To: <1117048985.084993.174910@o13g2000cwo.googlegroups.com>
User-Agent: G2/0.2
Complaints-To: groups-abuse@google.com
Injection-Info: o13g2000cwo.googlegroups.com; posting-host=148.87.1.171;
   posting-account=2WgjWgwAAABr6Be8TvmMtJT3Qcj_MnoS
Xref: dp-news.maxwell.syr.edu microsoft.public.sqlserver.programming:481422 comp.databases.theory:31014

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.

