.
Regards,
Radek
On Wed, 14 Sep 2011 17:58:58 +0200, Antonio Vieiro wrote:
Hi again,
Thanks for the tip. In fact I was thinking of creating an index on
the bitmask, so I could use:
... where t.bits = :mymask
directly, avoiding a full table scan. I assume this is possible
(indexing bit and
osław Smogura escribió:
On Wed, 14 Sep 2011 12:00:35 +0200, Antonio Vieiro wrote:
Hi all,
One of my entities 'E' may be 'tagged' with an arbitrary set of 256
tags 'T'.
A first approach could be to add a M:N relationship between 'E' and 'T'.
A secon
Hi all,
One of my entities 'E' may be 'tagged' with an arbitrary set of 256 tags 'T'.
A first approach could be to add a M:N relationship between 'E' and 'T'.
A second way to do this could be to add a BIT(256) datatype to 'E',
setting bits to '1' if the entity is tagged with each one of the 256
Hi all,
I now know it's somewhat an "academic exercise" of little practical
importance, thanks for the clarification!!
Cheers,
Antonio
2011/9/2 Tom Lane :
> Craig Ringer writes:
>> Even better, add a valgrind suppressions file for the warnings and
>> ignore them. They are "leaks" only in the se
Hi all,
I'm running one of my programs with valgrind to check for memory leaks
and I'm seeing something like this:
==13207== 4 bytes in 1 blocks are still reachable in loss record 1 of 256
==13207==at 0x4026864: malloc (vg_replace_malloc.c:236)
==13207==by 0x43343BD: ??? (in /lib/libcrypt
Hi all,
I'd like to use an integer number for my primary key. I need it to be
bigger than 32 bits.
As far as I understand I have two options:
a) use all the 64 bits of a 'bigint'
b) use the 52 mantissa bits of a 'double precision'
My question is, which would be faster for indexing? I assume the
Hi all,
Well, thanks for the ideas. I also prefer cleaning things up myself
before exiting.
I was expecting some small statistics from the library (connections
opened/closed, PGresults returned/freed, etc.) but I can do it myself,
before trying out more heavyweight tools such as valgrind.
Cheer
Hi all,
I'm building a small C application that uses libpq and I was wondering
if there's an easy way to detect memory leaks in my code.
I think I'm calling PQclear and friends correctly, but I'd like to
double-check it. I was wondering if there's a function in libpq to
check memory-use usage/int
