Brendan Jurd wrote:
But I also agree with Josh Drake's comment about a single point of
entry. If patch authors are updating the wiki, and reviewers are
using the wiki to guide their efforts, what purpose does the -patches
mailing list serve? Does sending an email to -patches on top of
Hello all,
I have a custom code written inside postgres in an application we use.
The snippet is as below :
Here inner plan is an index scan.
scandesc = ((IndexScanState *)innerPlan)-iss_ScanDesc;
flag=index_getmulti(scandesc, tidelm-tid, 1, ret_tids);
Now consider a query like
explain
Added to TODO:
* Consider a function-based API for '@@' full text searches
http://archives.postgresql.org/pgsql-hackers/2007-11/msg00511.php
---
Simon Riggs wrote:
Something Tom Dunstan just mentioned has made me ask
Oleg Bartunov wrote:
Jan,
the problem is known and well requested. From your promotion it's not
clear what's an idea ?
Tom Lane wrote:
=?UTF-8?B?SmFuIFVyYmHFhHNraQ==?= [EMAIL PROTECTED]
writes:
2. Implement better selectivity estimates for FTS.
OK, after reading through the some of the
On Sat, 8 Mar 2008, Jan Urbaski wrote:
Oleg Bartunov wrote:
Jan,
the problem is known and well requested. From your promotion it's not
clear what's an idea ?
Tom Lane wrote:
=?UTF-8?B?SmFuIFVyYmHFhHNraQ==?= [EMAIL PROTECTED]
writes:
2. Implement better selectivity estimates for FTS.
OK,
Oleg Bartunov [EMAIL PROTECTED] writes:
On Sat, 8 Mar 2008, Jan Urbaski wrote:
I have a feeling that in many cases identifying the top 50 to 300 lexemes
would be enough to talk about text search selectivity with a degree of
confidence. At least we wouldn't give overly low estimates for
Hello,
I would like to be able to add CONSTRAINT, or DEFAULT with out
affecting old rows. Yes, it sounds strange, but... Let's say I have
big table, I want to add new column, with DEFAULT and NOT NULL.
Normally it means long exclusive lock. So - right now I'm adding plain
new column, then
On 8-Mar-08, at 11:06 AM, Suresh wrote:
Hello all,
I have a custom code written inside postgres in an application we use.
The snippet is as below :
Here inner plan is an index scan.
scandesc = ((IndexScanState *)innerPlan)-iss_ScanDesc;
flag=index_getmulti(scandesc, tidelm-tid, 1,
Oleg Bartunov wrote:
On Sat, 8 Mar 2008, Jan Urbaski wrote:
OK, after reading through the some of the code the idea is to write a
custom typanalyze function for tsvector columns. It could look inside
such function already exists, it's ts_stat(). The problem with ts_stat() is
its
Gregory Stark [EMAIL PROTECTED] writes:
Gregory Stark [EMAIL PROTECTED] writes:
So I had a thought about how to soften the controversial hard cutoff of 100
for the use of the histogram selectivity. Instead of switching 100% one way
or
the other between the two heuristics why not calculate
On Sat, 8 Mar 2008, Tom Lane wrote:
Oleg Bartunov [EMAIL PROTECTED] writes:
On Sat, 8 Mar 2008, Jan Urbaski wrote:
I have a feeling that in many cases identifying the top 50 to 300 lexemes
would be enough to talk about text search selectivity with a degree of
confidence. At least we wouldn't
On Sat, 8 Mar 2008, Jan Urbaski wrote:
Unfortunately, selectivity estimation for query is much difficult than just
estimate frequency of individual word.
Sure, given something like 'cats dogs'::tsquery the frequency of 'cat' and
'dog' won't suffice. But at least it's a starting point and
12 matches
Mail list logo
