Postgres Pro
Downloads
Home   >   mailing lists

Is this the most efficent way to child nodes off a N-ary node database? - Mailing list pgsql-sql

From Christian Brink
Subject Is this the most efficent way to child nodes off a N-ary node database?
Date
Msg-id a4h183$1ud8$1@jupiter.hub.org
Whole thread Raw
Responses Re: Is this the most efficent way to child nodes off a N-ary  (Oleg Bartunov <oleg@sai.msu.su>)
List pgsql-sql
Tree view 
I have created this SQL statment, used to pull the child/leaf nodes off of a
N-ary node structure in PostgreSQL.

Is my premise all wrong?

Is this efficent as a SQL select?

Should this be done in my code (something I try to avoid for abstraction
reasons)?
"SELECT DISTINCT t1.node_id FROM node t1 WHERE NOT EXISTS (SELECT
t1.node_id FROM node t2 WHERE t1.node_id = t2.parent_id);"

pgsql-sql by date:

Previous
From: "Ross J. Reedstrom"
Date:
Subject: Re: How long does it take?
Next
From: Oleg Bartunov
Date:
Subject: pre-alpha release of OpenFTS (perl version) is available for testing