Re: Implementing trees in a relational database
From: Kai Großjohann <Kai.Grossjohann_at_CS.Uni-Dortmund.DE>
Date: Tue, 30 Jul 2002 16:13:45 +0200
Message-ID: <vafeldlnw12.fsf_at_lucy.cs.uni-dortmund.de>
Date: Tue, 30 Jul 2002 16:13:45 +0200
Message-ID: <vafeldlnw12.fsf_at_lucy.cs.uni-dortmund.de>
"Paul DeWolf" <paul_at_thievesandkings.com> writes:
> Can someone point me to information (books, white papers) on techniques for
"Accelerating XPath location steps" by Torsten Grust. The idea is to
number the nodes in preorder and postorder and to store both numbers
for each node. If you also store the level in the tree then you can
find out whether A is ancestor of B or A is parent of B really
> efficiently implementing trees and networks in an RDBMS? Has anyone done it
> themselves and showed that they can scale linearly?
Cool paper.
kai
-- A large number of young women don't trust men with beards. (BFBS Radio)Received on Tue Jul 30 2002 - 16:13:45 CEST