[testing to see if -patches allows me to post yet. I send a patch last night
but haven't seen it come through]
--
Gregory Stark
EnterpriseDB http://www.enterprisedb.com
---(end of broadcast)---
TIP 1: if posting/reading through Usenet
On Wed, 2007-02-21 at 21:28 -0300, Alvaro Herrera wrote:
> Bruce Momjian wrote:
> > Alvaro Herrera wrote:
> > > Bruce Momjian wrote:
> > > >
> > > > I applied the optional VACUUM FULL version, but modified to code to say
> > > > 20% rather than a factor of 5, attached.
> > >
> > > String construc
From a previous discussion with Teodor, it would be better to store an
int in the index instead of a text (it takes less space and is
faster). I couldn't find any example so if anyone has an advice to fix
that, it's welcome (mostly how to pack the trigram into an int instead
of a text).
Somethi
On 2/22/07, Teodor Sigaev <[EMAIL PROTECTED]> wrote:
> From a previous discussion with Teodor, it would be better to store an
> int in the index instead of a text (it takes less space and is
> faster). I couldn't find any example so if anyone has an advice to fix
> that, it's welcome (mostly how
I didn't see any improvement in terms of size of the index (14 MB for
642 738 rows in the index in both cases) or speed.
Our dictionary table contains 78367 words and its size is 3 MB.
Did I miss something?
Comparing integers is cheaper than strings. Although it hasn't significant
matter for ind
On 2/22/07, Teodor Sigaev <[EMAIL PROTECTED]> wrote:
How long is average length of strings in table?
test=# SELECT MIN(length(word)), MAX(length(word)), AVG(length(word))
FROM lieu_mots_gin;
min | max |avg
-+-+
1 | 38 | 7.4615463141373282
(1 row)
I don't
On Thu, 22 Feb 2007, Guillaume Smet wrote:
On 2/22/07, Teodor Sigaev <[EMAIL PROTECTED]> wrote:
How long is average length of strings in table?
test=# SELECT MIN(length(word)), MAX(length(word)), AVG(length(word))
FROM lieu_mots_gin;
min | max |avg
-+-+
1
I think it can be interesting for other flavours of GIN usage. Is
there a way to add the number of entries of the considered indexed
item to the consistent prototype without adding too much overhead and
complexity?
We are thinking about adding extra value, but it's still only thinking.
---
I've tried repeatedly to send this patch but it doesn't seem to be getting
through. It's not in the archives or my inbox. Now that I look I realized that
none of the WIP versions of the patch that I sent arrived either. That's
fairly disappointing since I had made efforts to keep people apprised o
The attached patch implements lo_truncate for truncating large objects to
a given length. This is required for implementing Blob.truncate in the
JDBC driver[1] and rounds out filesystem like functionality for large
objects.
Kris Jurka
[1] http://java.sun.com/javase/6/docs/api/java/sql/Blob
On 2/22/07, Oleg Bartunov wrote:
You're right, it would be nice.
This is what we need for faster ranking in tsearch2, since currently we should
consult heap to get positional information, which slowdowns search.
We didn't investigate the possibility to keep additional information with
index, but
On Tue, 2007-02-20 at 14:38 -0300, Alvaro Herrera wrote:
> Cool. I noticed that the SGML seems broken here:
Corrected.
> You need to close the and opened in the COPY mention.
>
> > +
> > + static void
> > + heap_sync_relation(Relation rel)
> > + {
> > + if (!rel->rd_istemp)
>
> No comme
There's a fair amount of added work to be done when updating tuples.
Will it be possible to postpone some of that to the bgwriter in a later
version? I realize that sometimes you'll still want to do the work up
front, like if it means we can stay on the same page instead of going
cold...
On Tue, F
13 matches
Mail list logo
