Sponsorised links
June 2007
March 2007
February 2007
DBAzine.com: Trees in SQL: Nested Sets and Materialized Path
Relational databases are universally conceived of as an advance over their predecessors network and hierarchical models. Superior in every querying respect, they turned out to be surprisingly incomplete when modeling transitive dependencies. Almost every couple of months a question about how to model a tree in the database pops up at the comp.database.theory newsgroup. In this article I'll investigate two out of four well known approaches to accomplishing this and show a connection between them. We'll discover a new method that could be considered as a "mix-in" between materialized path and nested sets.
Making a tree with "millions and millions" of dynamic nodes
First mail of a thread on the postgresql mailing list dealing of various ways to implement a tree structure with PostgreSQL.
Representing Trees in a relational DB
This document describes an approach for handling hierarchical data in a relational database.
Sponsorised links
July 2006
Storing Hierarchical Data in a Database
Whether you want to build your own forum, publish the messages from a mailing list on your Website, or write your own cms [1]: there will be a moment that you’ll want to store hierarchical data in a database. And, unless you’re using a XML [2]-like da
MySQL AB :: Managing Hierarchical Data in MySQL
Most users at one time or another have dealt with hierarchical data in a SQL database and no doubt learned that the management of hierarchical data is not what a relational database is intended for. The tables of a relational database are not hierarchical
June 2006
1
(10 marks)
