Re: [GENERAL] storing a tree-like structure and selecting path from leaf to root

From: Herouth Maoz <herouth(at)oumail(dot)openu(dot)ac(dot)il>
To: Jan Vicherek <honza(at)ied(dot)com>, pgsql-general(at)postgreSQL(dot)org
Subject: Re: [GENERAL] storing a tree-like structure and selecting path from leaf to root
Date: 1999-08-15 11:19:24
Message-ID: l03130304b3dc51ffa3a1@[147.233.159.109]
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

At 09:44 +0300 on 15/08/1999, Jan Vicherek wrote:

> Q1: What is a good way to store this tree in ? (This is somewhat generic
> question, so it may be a good FAQ candidate.) I want SELECTs to be fast,
> and INSERTs/UPDATEs I don't care. Would making custom datatype help ? How?

About a year and a half ago, there was a book recommendation about this
issue. The book discusses advanced data structures representation with SQL.
Now that PostgreSQL has subqueries and unions, it becomes more relevant.
The book was:

Joe Celko's
SQL for Smarties
Advanced SQL Programming

The publisher:

Morgan Kaufmann Publishers, Inc
340 Pine St 6th Floor
San Francisco CA 94104-33205
USA
415-392-2665
mkp(at)mkp(dot)com
http://www.mkp.com

The original poster of this recommendation was Terry Harple, and it was on
the (now defunct) QUESTIONS list.

Herouth

--
Herouth Maoz, Internet developer.
Open University of Israel - Telem project
http://telem.openu.ac.il/~herutma

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Matteo Colombo 1999-08-15 16:44:26 Autoincremental
Previous Message Jan Vicherek 1999-08-15 06:44:40 storing a tree-like structure and selecting path from leaf to root