From: | Teodor Sigaev <teodor(at)sigaev(dot)ru> |
---|---|
To: | Teodor Sigaev <teodor(at)sigaev(dot)ru> |
Cc: | "Joshua D(dot) Drake" <jd(at)commandprompt(dot)com>, PgSQL General <pgsql-general(at)postgresql(dot)org> |
Subject: | Re: NOTICE: word is too long INSERT 0 3014 |
Date: | 2006-10-30 15:34:12 |
Message-ID: | 45461B74.1030704@sigaev.ru |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general pgsql-hackers |
For example, redefine by follow way:
typedef struct
{
uint32
haspos:1,
len:31;
uint32 pos;
} WordEntry;
/* <= 1Gb */
#define MAXSTRLEN ( 1<<30 )
#define MAXSTRPOS ( 1<<30 )
Teodor Sigaev wrote:
>> I am running into this limitation ALOT with Tsearch2. What are my
>> options to get around it. Do I have to compile PostgreSQL with a
>> different block size?
>>
>> If yes, what are the downsides to doing so (outside of not being able to
>> do straight upgrades)?
>
> If you really need that, your should play around WordEntry definition
> (tsvector.h). Sorry, right now I haven't possibility to look closer,
> just tomorrow.
> Limit for word is equal 2KB - I supposed that is long enough to store
> any meaningful words.
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Have you searched our list archives?
>
> http://archives.postgresql.org/
--
Teodor Sigaev E-mail: teodor(at)sigaev(dot)ru
WWW: http://www.sigaev.ru/
From | Date | Subject | |
---|---|---|---|
Next Message | Brad Nicholson | 2006-10-30 15:49:44 | Re: log_duration and JDBC V3 Preparded Statements |
Previous Message | Tom Lane | 2006-10-30 15:27:04 | Re: log_duration and JDBC V3 Preparded Statements |
From | Date | Subject | |
---|---|---|---|
Next Message | Alvaro Herrera | 2006-10-30 16:20:56 | Re: WAL logging freezing |
Previous Message | Heikki Linnakangas | 2006-10-30 14:08:37 | Re: WAL logging freezing |