pg.ddx.io  pgsql-hackers@postgresql.org mailing list archive  
help / color / mirror / Atom feed
From: Heikki Linnakangas <heikki@enterprisedb.com>
To: Tom Lane <tgl@sss.pgh.pa.us>
Cc: Jan UrbaƄski <j.urbanski@students.mimuw.edu.pl>
Cc: Postgres - Hackers <pgsql-hackers@postgresql.org>
Subject: Re: gsoc, text search selectivity and dllist enhancments
Date: Fri, 04 Jul 2008 10:32:32 +0300
Message-ID: <486DD210.9030400@enterprisedb.com> (raw)
In-Reply-To: <6233.1215113144@sss.pgh.pa.us>
References: <48649261.5040703@students.mimuw.edu.pl>
	<6233.1215113144@sss.pgh.pa.us>

Tom Lane wrote:
> The data structure I'd suggest is a simple array of pointers
> to the underlying hash table entries.  Since you have a predetermined
> maximum number of lexemes to track, you can just palloc the array once
> --- you don't need the expansibility properties of a list. 

The number of lexemes isn't predetermined. It's 2 * (longest tsvector 
seen so far), and we don't know beforehand how long the longest tsvector is.

repalloc()ing shouldn't be a problem, though.

-- 
   Heikki Linnakangas
   EnterpriseDB   http://www.enterprisedb.com



view thread (33+ messages)  latest in thread

Message-ID: <486DD210.9030400@enterprisedb.com>
Permalink:  ../486DD210.9030400@enterprisedb.com/
Also on:    postgresql.org/message-id/486DD210.9030400@enterprisedb.com

 · 

reply

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Reply to all the recipients using the --to and --cc options:
  reply via email

  To: pgsql-hackers@postgresql.org
  Cc: heikki@enterprisedb.com, tgl@sss.pgh.pa.us, j.urbanski@students.mimuw.edu.pl
  Subject: Re: gsoc, text search selectivity and dllist enhancments
  In-Reply-To: <486DD210.9030400@enterprisedb.com>

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox