Message-ID: <461366E8.90906@andromeiberica.com>
Date: Wed, 04 Apr 2007 10:50:48 +0200
From: Arnau <arnaulist@andromeiberica.com>
Reply-To: arnaulist@andromeiberica.com
User-Agent: Thunderbird 1.5.0.10 (Windows/20070221)
MIME-Version: 1.0
To: pgsql-performance@postgresql.org
Subject: Re: Equivalents in PostgreSQL of MySQL's "ENGINE=MEMORY"
	"MAX_ROWS=1000"
References: <4612A421.4060808@andromeiberica.com>
	<4612A57B.2030601@agliodbs.com>
In-Reply-To: <4612A57B.2030601@agliodbs.com>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit

Hi Josh,

Josh Berkus wrote:
> Arnau,
> 
>> Is there anything similar in PostgreSQL? The idea behind this is how I
>> can do in PostgreSQL to have tables where I can query on them very often
>> something like every few seconds and get results very fast without
>> overloading the postmaster.
> 
> If you're only querying the tables every few seconds, then you don't 
> really need to worry about performance.

Well, the idea behind this is to have events tables, and a monitoring 
system polls that table every few seconds.  I'd like to have a kind of 
FIFO stack. From "the events producer" point of view he'll be pushing 
rows into that table, when it's filled the oldest one will be removed to 
leave room to the newest one. From "the consumer" point of view he'll 
read all the contents of that table.

So I'll not only querying the tables, I'll need to also modify that tables.


-- 
Arnau