Re: [HACKERS] more than one index in a single heap pass?

2009-07-14 Thread Glen Parker
Andrew Dunstan wrote: Well, yes, it's some of it, and in theory Tom's late addition of a queue that gets all the dependencies of a table as soon as the table data is restored should make that work better. But of course, that's not the only time indexes are created, and each index creation comm

Re: [HACKERS] Proposal for Implenting read-only queries during wal replay (SoC 2007)

2007-02-23 Thread Glen Parker
I'll throw in my vote, I would find this quite useful. -Glen Florian G. Pflug wrote: I plan to submit a proposal for implementing support for read-only queries during wal replay as a "Google Summer of Code 2007" project. I've been browsing the postgres source-code for the last few days, and c

Re: [HACKERS] Point in Time Recovery

2004-07-15 Thread Glen Parker
> Simon Riggs wrote: > > > On Thu, 2004-07-15 at 23:18, Devrim GUNDUZ wrote: > > > > Thanks for the vote of confidence, on or off list. > > > > > too many people spend a lot of > > > money for proprietary databases, just for some missing features in > > > PostgreSQL > > > > Agreed - PITR isn't ai

Re: [HACKERS] Why frequently updated tables are an issue

2004-06-10 Thread Glen Parker
ootprint seems to be a tough sell. And rightly so, IMO. Glen Parker ---(end of broadcast)--- TIP 6: Have you searched our list archives? http://archives.postgresql.org

Re: [HACKERS] proposal: be smarter about i/o patterns in index scan

2004-05-19 Thread Glen Parker
> -Original Message- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] Behalf Of Tom Lane > > Or: > > 2. Sort AND COPY TID's into physical order. > > 3. Read heap in phy. order, match results to un-sorted TID list. > > That sounds quite cheap. > > No, it sounds like handwaving. Wh

Re: [HACKERS] proposal: be smarter about i/o patterns in index scan

2004-05-19 Thread Glen Parker
> -Original Message- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] Behalf Of Tom Lane > Sent: Wednesday, May 19, 2004 11:56 AM > Not unless you add yet another sort step after the fetch step, that is > the idea becomes > 1. read index to get candidate TIDs > 2. sort TID

Re: [HACKERS] proposal: be smarter about i/o patterns in index scan

2004-05-19 Thread Glen Parker
ly, the index would still have to be scanned in sort order. Only the fetch order for heap tuples would be sorted differently. Glen Parker ---(end of broadcast)--- TIP 9: the planner will ignore your desire to choose an index scan if your joining column's datatypes do not match

Re: [HACKERS] proposal: be smarter about i/o patterns in index scan

2004-05-18 Thread Glen Parker
s of large expected result sets, and again, with enough sort space to play with, the performance could approach that of C. I would think that you could also sort the index on index order (during vacuum) to improve index scan performance. This could be a completely seperate implementation task. W

Re: [HACKERS] PITR Phase 1 - Test results

2004-04-26 Thread Glen Parker
> I want to come hug you --- where do you live? !!! You're not the only one. But we don't want to smother the poor guy, at least not before he completes his work :-) ---(end of broadcast)--- TIP 9: the planner will ignore your desire to choose an

FW: [HACKERS] Do we prefer software that works or software that looks good?

2004-04-26 Thread Glen Parker
s closely as possible, even when we all hate it with a passion. Just my $.02 Glen Parker ---(end of broadcast)--- TIP 3: if posting/reading through Usenet, please send an appropriate subscribe-nomail command to [EMAIL PROTECTED] so that your message can get through to the mailing list cleanly

[HACKERS] Index scan ordering (performance)

2004-02-18 Thread Glen Parker
does not effect SQL compliance). Any ideas what status is on this stuff? Should I dive in and try to do it myself? Glen Parker [EMAIL PROTECTED] ---(end of broadcast)--- TIP 3: if posting/reading through Usenet, please send an appropriate subs