From: | Ed Loehr <eloehr(at)austin(dot)rr(dot)com> |
---|---|
To: | Vincenzo Passoli <maweb(at)hotmail(dot)com>, pgsql-sql(at)postgresql(dot)org |
Subject: | Re: how to know when a table is altered |
Date: | 2000-06-07 16:49:55 |
Message-ID: | 393E7D33.FA2F5FC2@austin.rr.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
Ed Loehr wrote:
>
> Vincenzo Passoli wrote:
> >
> > i'm developing a framework (mod_perl+apache) that reads the db-schema and
> > explode html forms.
> >
> > now i read the schema and cache it into perl-hashes to speedup things.
> >
> > my problem is to recognise when a table is altered so that the framework can
> > update the related forms connected to the db tables.
> > i don't want to read the schema every time.
> >
> > How can i implement this ?
>
> My sub-optimal approach was to cache all of the generally static tables
> (requiring a restart to reload them if they changed), and query the
> rest. You can avoid a lot of joins by querying the db for the foreign
> keys to static tables and then looking them up only in the app cache.
> But caching query results and invalidating them when the underlying
> tables changed would greatly simplify my app and speed things up, so I'd
> love to hear if others have a better/faster solution here.
I was thinking about another possible approach (and definitely
half-baked). I'd call it "table-based caching". Suppose you created a
table specifically for tracking how recently a table had been updated,
e.g.,
create table table_status (
tablename varchar not null unique,
last_change timestamp not null
);
Then create triggers for every table that updated
table_status.last_change = now() on every UPDATE/DELETE/INSERT. Then, to
determine when you need to invalidate the application cache, you'd load
this table at the beginning of the request and invalidate cache entries
involving tables with table_status.last_change more recent than when the
query results were cached.
If, like most DBs yours is mostly reads, you'd suffer one pretty light DB
query in order to validate your cache on each request. Then, each That
would be a significant hit on big changes involving many records. But
where that's unusual, it might be a big win. There are a lot of gotchas
with this approach (figuring out the query-table dependencies, etc.), but
it seems possible.
BTW, I thinking server-side caching is the optimal solution here. I
previously lobbied -hackers for implementing a server-side result-set
cache in which entire query result sets could be cached (up to a
configurable limit) and returned immediately when none of the underlying
tables had changed
(http://www.deja.com/viewthread.xp?AN=602084610&search=thread) I still
think that would be a huge performance win in the vast majority of
systems (including mine), but it is not supposedly not trivial. The idea
won absolutely no fans among the developers/hackers. There was some talk
about caching the query plans, but I think that ultimately got dismissed
as well. I wish I had time to work on this one.
Regards,
Ed Loehr
From | Date | Subject | |
---|---|---|---|
Next Message | Steffers | 2000-06-07 16:54:54 | |
Previous Message | Tom Lane | 2000-06-07 15:48:38 | Re: Problem with subquery in CHECK constraint. |