Storing a chain

From: Johan Fredrik Øhman <johanfo(at)ohman(dot)no>
To: <pgsql-general(at)postgresql(dot)org>
Subject: Storing a chain
Date: 2003-11-19 15:08:47
Message-ID: E1AMTvX-0003VE-8s@mail-mx1.uio.no
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Hi,
I'm seeking some opinion on the following problem

For those familiar with "iptables/netfilter", I am actually storing firewall
rules in the database. The order of these rules is critical, so there has to
be some kind of system to how they are ordered. As I see it there are at
least 2 approaches.

1) Use a Sequence number in the table. This way it is possible to use ORDER
BY sequencenumber to retrive the correct list. This works, but you have to
do some massive updating when you what to insert a rule between i.e "12" and
"13".

CREATE TABLE FW_CHAIN (
FW_CHAIN_ID INT4 not null,
PARENT_ID INT4 null,
.... fields ..............
constraint PK_FW_CHAIN primary key (FW_CHAIN_ID)
);

2) Use a Parent_Id, as described intended in the table above. I feel that
this is a little prettier, even if it might be somewhat less efficient.
Unfortunately, I'm really not sure how to perform the queries. As I see it
some kind of recursive select statement is needed. Cursors ? Stored
Procedure?

If somebody has the time, I'd really appreciate some links to relevant
examples, documentation or advice on how to solve this.

--
Johan Fredrik Øhman

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Michael Meskes 2003-11-19 15:14:29 Re: Problem with exec sql include
Previous Message Josué Maldonado 2003-11-19 15:06:36 Re: Tunning postgresql