Re: [HACKERS] [PATCHES] 2WRS [WIP]

For the joy of all of you: that's the correct WIP patch. At the moment it only tries to create runs uding two heaps. Hope you can help me with writing those runs on tapes. I'd be very pleased to give you more details. Thenks for your time. Regards, Manolo.

[HACKERS] Run positions on Tape

Hi gurus. I'm working on runs formation [ tuplesort.ctuplestore.c ] Is there a way to know and store the address of the first and the last position of a run on a tape? I would store the location of the first tuple while arranging the current run on the current destination tape. On the

[HACKERS] Backward reading

PostgreSQL allows backward reading tuples writing the tuple's length after and before the tuple proper, in case a 'randomAccess' is requested. Is there any example of backward reading tuples into PostgreSQL code? Thanks.

Re: [HACKERS] Polyphase Merge

-- From: Tom Lane [EMAIL PROTECTED] Sent: Monday, January 21, 2008 10:13 PM To: Sam Mason [EMAIL PROTECTED] Cc: pgsql-hackers@postgresql.org Subject: Re: [HACKERS] Polyphase Merge I agree --- having to read the run back from external storage,

[HACKERS] Polyphase Merge

I'm trying to refine the sorting module of tuplesort.c During run creations I use two heaps instead of just one (yeah, it's still me... the one of the two heaps still trying to get some answer/help from -hackers) Those two runs are built in a way such that if we would concatenate one of them

[HACKERS] Using tapes on tuplesort.c

Hi to all. It seems that the current PostgreSQL implementation of the Replacement Selection (RS) algorithm [Knuth] changes a logical tape for each run built. I'm trying to implement that refinement to RS using 2 heaps instead of just one (2Way RS). Recall each heap is aimed at building its

Re: [HACKERS] Implementing Sorting Refinements

Well, sorry for hijacking... ummm how did I do that? Anyway I'll thank you for giving a sign of life when I was almost loosing my hopes to get any kind of answer from -hackers. I suppose the lack of answers was due to the way I wrote my mail. At that moment I supposed that at least someone

Re: [HACKERS] compiling postgres in winxp

Any Code::Blocks user? http://www.codeblocks.org/ Cannot compile PG-8.2.5 with WinXP SP2 using Code::Blocks. I created a new project including ALL the files decompressed from postgresql-8.2.5.tar.gz and then just clicked on build. What's wrong? Alternative ways to complie it with other IDE

Re: [HACKERS] Replacement Selection

in puttuple_common(), the transition from an internal to external sort is performed at the bottom of the TSS_INITIAL case in the main switch statement. The transition? Do we internal sort somewhere else and then external sort here in tuplesort.c? The function dumptuples() heapifies the

Re: [HACKERS] Replacement Selection

Hi to all. It seems a previous mail of mine with following body hasn't been sent. Sorry for possibly getting it twice. Actually I have now modified that body, so it's worth to read it once again. Thanks for your attention. Regards. PREVIOUS MAIL-- Well,

Re: [HACKERS] Replacement Selection

Any comment about Two Ways Replacement Selection (two heaps instead of just one) ? -- From: Simon Riggs [EMAIL PROTECTED] Sent: Tuesday, November 27, 2007 1:03 PM To: [EMAIL PROTECTED] Cc: pgsql-hackers@postgresql.org Subject: Re: [HACKERS]

[HACKERS] Replacement Selection

Hi to all. I'm new. I'd like to integrate my code into PostgreSQL. It's the implementation of some refinements of Replacement Selection algorithm used for External Sorting. I have got some issue and preferibly I'd like to be supported by some developers that have something to do with it.

Re: [HACKERS] Replacement Selection

Thanks for your support. I downloaded the source code of the last stable version of PostgreSQL. Where can I find the part related to the External Sorting algorithm (supposed to be Replacement Selection)? I mean, which is the file to be studied and/or modified and/or substituted? Thanks for

Re: [HACKERS] Replacement Selection

Ok guys! Thanks for your help. Unfortunately I'm lost into the code... any good soul helping me to understand what should be the precise part to be modified? Thanks for your time! -- From: Heikki Linnakangas [EMAIL PROTECTED] Sent: Monday,

Fw: [HACKERS] Replacement Selection

Thanks for your advice. The developement of this integration is part of my final project. And fo course my initial bibliografy includes the Knuth reference as you can see 1. Vladimir Estivill-Castro and Derick Wood. A survey of adaptive sorting algorithms. ACM Computing Surveys, 24(4):441{476,

Re: [HACKERS] Replacement Selection

Sorry. I'm trying to integrate my code into PostgreSQL. At the moment I have got my working code, with my own main() etc etc. The code is supposed to perform run generation during external sorting. That's all, my code won't do any mergesort. Just run generation. I'm studing the code and I

Re: [HACKERS] Replacement Selection

I must precise that it's not the improvement. Other more complex algorithms correspond to the refinements, but at the moment I just want to know which part of PostgreSQL code does what. I also implemented Replacement Selection (RS) so if I'm able to integrate my RS I hope I would be able to