On Fri, Nov 4, 2011 at 3:14 AM, Simon Riggs wrote:
> Next steps in refactoring are bigger steps, but not huge ones.
>
> I propose this
>
> * everything to do with XLOG rmgr into a file called xlogrmgr.c
> Thats xlog_redo() and most everything to do with checkpoints
>
> * everything to do with read
On Fri, Nov 4, 2011 at 8:06 AM, Josh Berkus wrote:
> On 10/25/11 5:03 AM, Magnus Hagander wrote:
>> If we want something to go in early, that could be as simple as a
>> version of pg_basebackup that runs against the slave but only if
>> full_page_writes=on on the master. If it's not, it throws an
On Thu, Nov 3, 2011 at 2:52 AM, Simon Riggs wrote:
> On Wed, Nov 2, 2011 at 5:20 PM, Tom Lane wrote:
>> Dimitri Fontaine writes:
>>> The only part of your proposal that I don't like is the process name,
>>> that "deArchiver" thing. "wal restore process" or something like that
>>> would be bette
On Thu, Nov 3, 2011 at 3:18 AM, Scott Mead wrote:
> ISTM that we're all for:
> creating a new column: state
> renaming current_query => query
> State will display , , in transaction, etc...
> query will display the last query that was executed.
The greater/less-than-sign is still req
On Nov 2, 2011, at 11:27 AM, Robert Haas wrote:
> The following comment - or at least the last sentence thereof -
> appears to be out of date.
>
>/*
> * XXX Should we update the FSM information of this page ?
> *
> * There are two schools of thought here. We may not
On 09/24/2011 04:49 PM, Joshua Berkus wrote:
Well, we *did* actually come up with a reasonable way, but it died
under an avalanche of bikeshedding and
"we-must-do-everything-the-way-we-always-have-done". I refer, of
course, to the "configuration directory" patch, which was a fine
solution, and
I wrote:
> (Just offhand, it rather looks like dict_int and dict_xsyn are both
> assuming that palloc will give back zeroed space, which is bogus...)
Yeah, this is definitely broken. Patches committed; thanks for the
report.
http://git.postgresql.org/gitweb/?p=postgresql.git;a=commitdiff;h=e3e308
Hackers,
Andrew produced a version for this patch which builds against 9.0. I've
tested that version on a production installation of PostgreSQL, including:
* dumping and reloading a production database with over 200 objects,
500GB of data and complex dependancies, 4 times so far
* excluding diff
On 10/25/11 5:03 AM, Magnus Hagander wrote:
> If we want something to go in early, that could be as simple as a
> version of pg_basebackup that runs against the slave but only if
> full_page_writes=on on the master. If it's not, it throws an error.
> Then we can improve upon that by adding handling
On Thu, Nov 3, 2011 at 6:12 PM, Pavan Deolasee wrote:
> When PGPROC array is allocated, we also allocate another array of
> PGPROC_MINIMAL structures of the same size. While accessing the
> ProcArray, a simple pointer mathematic can get us the corresponding
> PGPROC_MINIMAL structure. The only ex
Just noticed that I broke the buildfarm with that isolationtester commit
I did earlier today. I'm out for dinner now but I'll try to fix it
when I'm back .. sorry.
--
Álvaro Herrera
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
h
Rodrigo Hjort writes:
> I created a *custom dictionary* (based on dict_int) and a search
> configuration and a strange behavior happens on *PostgreSQL 8.4.9*.
> ...
> Therefore, when I use *@@ operator* over a *tsvector* column in my table
> the result set is not always the same.
This almost cert
Hello PG hackers,
I created a *custom dictionary* (based on dict_int) and a search
configuration and a strange behavior happens on *PostgreSQL 8.4.9*.
When I invoke the following instruction several times,*
to_tsquery()*returns distinct results:
catalog=> SELECT to_tsquery('custom', 'pi');
to_t
On 06/04/2011 04:51 PM, Oleg Bartunov wrote:
Well, there are several functions available around tsearch2. so I suggest
somebody to collect all of them and create one extension - ts_addon.
For example, these are what I remember:
1. tsvector2array
2. noccurences(tsvector, tsquery) - like your ts_
On Thu, Nov 3, 2011 at 3:59 PM, Heikki Linnakangas <
heikki.linnakan...@enterprisedb.com> wrote:
> I've committed this now, after some more cleanup. I removed the
> selectivity estimation functions from operators where they were bogus, so
> writing those is a clear TODO. But that can well be done
"Kevin Grittner" wrote:
> Untested patch attached for purposes of discussion.
I got in a little testing on it -- not only does this patch
eliminate the compile-time warning, but if you try to run pg_upgrade
when another session has removed your current working directory, you
get a reasonable m
On Thu, Nov 3, 2011 at 11:01 PM, Tom Lane wrote:
> Yoann Moreau writes:
> > I'm using a GIN index for a text column on a big table. I use it to rank
> > the rows, but I also need to get the term positions for each document of
> a
> > subset of documents for one or more terms. I suppose these pos
On Thu, Nov 3, 2011 at 4:52 PM, Yoann Moreau
wrote:
> I'd need a function like this :
> select term_positions(text, 'get') from docs;
> id_doc | positions
> +---
> 1 | {2,6}
> 2 | {3}
>
check this out:
http://www.postgresql.org/docs/current/static/textsearch-d
Yoann Moreau writes:
> I'm using a GIN index for a text column on a big table. I use it to rank
> the rows, but I also need to get the term positions for each document of a
> subset of documents for one or more terms. I suppose these positions are
> stored
> in the index as the to_tsvector shows
On Nov3, 2011, at 18:54 , David E. Wheeler wrote:
> On Nov 3, 2011, at 4:59 AM, Heikki Linnakangas wrote:
>> I've committed this now, after some more cleanup. I removed the selectivity
>> estimation functions from operators where they were bogus, so writing those
>> is a clear TODO. But that can
Next steps in refactoring are bigger steps, but not huge ones.
I propose this
* everything to do with XLOG rmgr into a file called xlogrmgr.c
Thats xlog_redo() and most everything to do with checkpoints
* everything to do with reading WAL files into a file called xlogread.c
That will allow us to
On Nov3, 2011, at 16:52 , Yoann Moreau wrote:
> I'm using a GIN index for a text column on a big table. I use it to rank
> the rows, but I also need to get the term positions for each document of a
> subset of documents for one or more terms. I suppose these positions are
> stored
> in the index a
Hi All,
While working on some of the performance issues on HP-UX, I noticed a
significant data cache misses for accessing PGPROC members. On a close
inspection, it was quite evident that for large number (even few 10s)
of clients, the loop inside GetSnapshotData will cause data cache miss
for almo
Bruce Momjian wrote:
> I fixed this a different way. I originally thought I could skip over
> the 'postgres' database in the new cluster if it didn't exist in the old
> cluster, but we have do things like check it is empty, so that was going
> to be awkward.
>
> It turns out there was only one
On Nov 3, 2011, at 4:59 AM, Heikki Linnakangas wrote:
> I've committed this now, after some more cleanup. I removed the selectivity
> estimation functions from operators where they were bogus, so writing those
> is a clear TODO. But that can well be done as a separate patch.
>
> Thanks!
Woo! C
Patch strips out all user visible functions into a new xlogfuncs.c file.
--
Simon Riggs http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training & Services
refactor_xlog_funcs.v1.patch
Description: Binary data
--
Sent via pgsql-hackers mailing list (pgsql
Yoann Moreau wrote:
> I'd need a function like this :
> select term_positions(text, 'get') from docs;
> id_doc | positions
> +---
>1 | {2,6}
>2 | {3}
>
> I'd like to add this function in my database, for experimental
> purpose. I got a look at the sou
On Thu, Nov 3, 2011 at 2:22 PM, Robert Haas wrote:
> On Thu, Nov 3, 2011 at 9:52 AM, Simon Riggs wrote:
>> On Thu, Nov 3, 2011 at 1:26 PM, Robert Haas wrote:
>>
>>> I think that should be OK, but:
>>>
>>> - It looks to me like you haven't done anything about the second heap
>>> pass. That shoul
Hello,
I'm using a GIN index for a text column on a big table. I use it to rank
the rows, but I also need to get the term positions for each document of a
subset of documents for one or more terms. I suppose these positions are stored
in the index as the to_tsvector shows them : 'lexeme':{position
On Tue, Nov 1, 2011 at 05:53, Fujii Masao wrote:
> On Tue, Nov 1, 2011 at 3:08 AM, Magnus Hagander wrote:
>> On Fri, Oct 28, 2011 at 08:46, Fujii Masao wrote:
>>> On Thu, Oct 27, 2011 at 11:14 PM, Magnus Hagander
>>> wrote:
Here's a version that does this. Turns out this requires a lot le
On Thu, Nov 3, 2011 at 9:52 AM, Simon Riggs wrote:
> On Thu, Nov 3, 2011 at 1:26 PM, Robert Haas wrote:
>
>> I think that should be OK, but:
>>
>> - It looks to me like you haven't done anything about the second heap
>> pass. That should probably get a similar fix.
>
> I was assuming this worked
Robert Haas writes:
> Hmm, I was kind of expecting that to be wrong at least in some minor way.
> +/* contrib/hstore/hstore-1.0-1.1.sql */
> +
> +-- complain if script is sourced in psql, rather than via CREATE EXTENSION
> +\echo Use "ALTER EXTENSION hstore" to load this file. \quit
You could me
On Thu, Nov 3, 2011 at 1:26 PM, Robert Haas wrote:
> I think that should be OK, but:
>
> - It looks to me like you haven't done anything about the second heap
> pass. That should probably get a similar fix.
I was assuming this worked with Pavan's patch to remove second pass.
Not in any rush to
On Thu, Nov 3, 2011 at 7:15 AM, Simon Riggs wrote:
>> A while
>> back, someone (Greg Stark? me?) floated the idea of not waiting for
>> the cleanup lock. If we can't get it immediately, or within some
>> short period of time, then we just skip the page and continue on.
>
> Separately, that sounds
On 03.11.2011 10:42, Jeff Davis wrote:
On Wed, 2011-11-02 at 22:59 +0200, Heikki Linnakangas wrote:
This seems to be coming from the selectivity estimation function. The
selectivity function for<@ is scalargtsel, which is usually used for
scalar> and>=. That doesn't seem right. But what do we s
On Wed, Nov 2, 2011 at 8:21 PM, Greg Smith wrote:
> In cases where there are little or no writes to the WAL, checkpoints will be
> skipped even if checkpoint_timeout has passed. At least one new WAL segment
> must have been created before an automatic checkpoint occurs. The time
> between checkp
On Sun, Jun 5, 2011 at 4:03 AM, Robert Haas wrote:
> We've occasionally seen problems with VACUUM getting stuck for failure
> to acquire a cleanup lock due to, for example, a cursor holding a pin
> on the buffer page. In the worst case, this can cause an undetected
> deadlock, if the backend hol
On Thu, Nov 3, 2011 at 12:21 AM, Greg Smith wrote:
> With some trivial checkpoints containing a small amount of data skipped now,
> aren't there some cases where less WAL data will be written than before? In
> that case, the user visible behavior here would be different. I'd be most
> concerned
Robert Haas wrote:
> On Wed, Nov 2, 2011 at 8:31 PM, Bruce Momjian wrote:
> > Robert Haas wrote:
> >> >> > If nobody objects, I'll go do that. ?Hopefully that should be enough
> >> >> > to put this problem to bed more or less permanently.
> >> >>
> >> >> All right, I've worked up a (rather boring
On 17.10.2011 01:09, Jeff Davis wrote:
On Sat, 2011-10-15 at 01:46 +0300, Heikki Linnakangas wrote:
* Do we really need non_empty(anyrange) ? You can just do "NOT empty(x)"
To make it a searchable (via GiST) condition, I need an operator. I
could either remove that operator (as it's not amazin
On Mon, Oct 31, 2011 at 7:09 PM, Tom Lane wrote:
> Heikki Linnakangas writes:
>> On 31.10.2011 17:44, Mark Hills wrote:
>>> Could libpq be reasonably modified to allow this?
>
>> I believe it's doable in theory, no-one has just gotten around to it.
>> Patches are welcome.
>
> Can't you do that to
On 2 November 2011 16:35, Brar Piening wrote:
> See http://de.wikipedia.org/wiki/Unendlichkeit#Analysis
> (Sorry for linking the german wikipedia - the english text is ways less
> verbose on this.)
Google Translate has come a very long way.
I can read that whole section easily with my brain auto
42 matches
Mail list logo
