Hi all,
in a large table (millions of rows) I am using
a variable-length user
defined type
to store relatively short field entries, i.e. the
length of certain
fields could be restricted to 2^16 or even
2^8 characters.
Now I wonder whether it would be possible
to save storage place, by
using
Sorry for the late reply - I've been away.
Merlin, I'd like to come back with a few more points!
>That's the whole point: memory is a limited resource. If pg is
>crawling, then the problem is simple: you need more memory.
My posting only relates to the scenario where RAM is not a limiting facto
Hello,
I have a request like SELECT ... WHERE x<=A<=y AND t<=B<=u AND z<=C<=w AND ..
5 columns are in BETWEEN clauses.
What is the best index I could use?
If I create btree index on all columns (A,B,C..), here is what explain
analyze gives me:
Hi all -
I've got a schema I'm working on modifying, nad I need some help getting
the best performance out. The orginal schema has a many to many linkage
between a couple tables, using a two column linkage table. This is used
to represent groups of people and their relationship to an object
(autho
"Ross J. Reedstrom" <[EMAIL PROTECTED]> writes:
> In the new schema, the same thing is:
>
> SELECT * from content where 42 = ANY (authors);
>
> Works fine, but for the life of me I can't find nor figure out how to
> build an index that will be used to speed this along. Any ideas?
Well that's b
