[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] RE: Re: Theory question: Node trees and 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 more.) Michael Kay http://www.saxonica.com/
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|