[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

RE: Re: Theory question: Node trees and SQL.

Subject: RE: Re: Theory question: Node trees and SQL.
From: "Michael Kay" <mike@xxxxxxxxxxxx>
Date: Thu, 6 Jul 2006 09:11:14 +0100
trees sql
> Doesn't really help me much though. I'm looking to find the 
> preferred/simplest way of storing node-/b-trees in SQL to be 
> used with XSL. I need to be able to move, create, and delete 
> nodes very simply (preferably without transactions).
> Any suggestions on what method I should use?

There is no simple way of storing trees in a pure relational database. Trees
need recursive queries, and recursive queries can't be done in first-order
predicate logic. You either have to do it a complicated way in a relational
database, or a simple way in a non-relational database.

(Of course, none of the major products like Oracle are purely relational any

Michael Kay

Current Thread


Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
First Name
Last Name
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.