Re: Returning nbtree posting list TIDs in DESC order during backwards scans - Mailing list pgsql-hackers

From Mircea Cadariu
Subject Re: Returning nbtree posting list TIDs in DESC order during backwards scans
Date
Msg-id c80edb72-709d-4b30-8a78-ef59a9287d77@gmail.com
Whole thread Raw
In response to Returning nbtree posting list TIDs in DESC order during backwards scans  (Peter Geoghegan <pg@bowt.ie>)
Responses Re: Returning nbtree posting list TIDs in DESC order during backwards scans
List pgsql-hackers
Hi,


> -    for (int i = 0; i < numKilled; i++)
> +    for (int i = so->currPos.firstItem; i <= so->currPos.lastItem; i++)

Does the above change mean it will have to do more work in the loop? 
Whereas before it visited strictly killed, it now has to go through all 
of them?


Kind regards,

Mircea Cadariu




pgsql-hackers by date:

Previous
From: Peter Geoghegan
Date:
Subject: Re: index prefetching
Next
From: Andres Freund
Date:
Subject: Re: libpq: Process buffered SSL read bytes to support records >8kB on async API