performance by allocating most of the memory to the buffer cache rather
than leaving it to the kernel file cache.
I'm actually fairly curious to see what the new buffer management scheme
will mean in terms of real world performance and parameter tuning.
-James Rogers
[EMAIL PROTECTED
, which I
will post to the pg-hackers list. It is all stuff previously determined
to be doable within the current PostgreSQL framework, and just requiring
some work that my company is willing to help pay for.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast
doing
this?
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 9: the planner will ignore your desire to choose an index scan if your
joining column's datatypes do not match
of this particular beast.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 3: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get
, it is the difference between middling performance in the
typical case and highly optimal in just about every case. A database kernel
lets you use an operating system in the way it likes to be used rather than
using an API that you just happen to support.
Cheers,
-James Rogers
[EMAIL PROTECTED
On 10/14/03 11:31 PM, James Rogers [EMAIL PROTECTED] wrote:
There is some abstraction in Postgres and the database is well-written, but
it isn't written in a manner that makes it easy to swap out operating system
or API models. It is written to be portable at all levels. A database
kernel
questions:
1) Does anyone object to me working on these two areas?
2) What version target should I realistically be shooting for?
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 7: don't forget to increase your free space
On 10/2/03 11:34 PM, Hannu Krosing [EMAIL PROTECTED] wrote:
James Rogers kirjutas N, 02.10.2003 kell 23:44:
Not exactly. What you are describing is more akin to partitioning or
hash-organized tables i.e. sorting insert/update tuples to various pages
according to some hash function.
What I
tool in the tool belt.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 8: explain analyze is your friend
of
time-series data stored in a table, with each series keyed to another
table. The the typical tuple distribution creates pathological
behaviors when buffer space becomes tight.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP
. You could
always markup the index that CLUSTER uses to keep track of good
candidates (plus some additional structures), but the more I think about
that, the more it looks like a nasty hack.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast
optimization), but I thought I would check with the people
currently hacking on the system first, to see if there was a showstopper or
if someone is already working on this.
Cheers,
-James Rogers
[EMAIL PROTECTED]
---(end of broadcast)---
TIP 4
12 matches
Mail list logo