-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 12/15/06 07:50, Martijn van Oosterhout wrote:
> On Fri, Dec 15, 2006 at 07:44:16AM -0600, Ron Johnson wrote:
>>> The difference in performence will be determined by the cost of
>>> comparison. The cost of comparing strings is much higher than for
>>
On Fri, Dec 15, 2006 at 07:44:16AM -0600, Ron Johnson wrote:
> > The difference in performence will be determined by the cost of
> > comparison. The cost of comparing strings is much higher than for
> > integers, so it will be slower.
>
> And comparing INT8 is more expensive on a 32-bit system.
T
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 12/15/06 05:41, Martijn van Oosterhout wrote:
> On Fri, Dec 15, 2006 at 01:13:00PM +0200, Yonatan Ben-Nes wrote:
>> Hi all,
>>
>> I was wondering does the b-tree index performance change when it's
>> implemented on different data types fields? is it
On Fri, Dec 15, 2006 at 01:13:00PM +0200, Yonatan Ben-Nes wrote:
> Hi all,
>
> I was wondering does the b-tree index performance change when it's
> implemented on different data types fields? is it better to use one of them
> instead of the other for (=) comparisons?
> I'm especially interested be
Hi all,
I was wondering does the b-tree index performance change when it's
implemented on different data types fields? is it better to use one of them
instead of the other for (=) comparisons?
I'm especially interested between INT8 and TEXT data types.
Thanks a lot in advance,
Ben-Nes Yonatan
