Re: Returning nbtree posting list TIDs in DESC order during backwards scans

From: Mircea Cadariu <cadariu(dot)mircea(at)gmail(dot)com>
To: Peter Geoghegan <pg(at)bowt(dot)ie>, PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: Re: Returning nbtree posting list TIDs in DESC order during backwards scans
Date: 2025-07-16 21:27:56
Message-ID: c80edb72-709d-4b30-8a78-ef59a9287d77@gmail.com
Views: Whole Thread | Raw Message | Download mbox | Resend email
Thread:
Lists: 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

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Andres Freund 2025-07-16 21:34:31 Re: libpq: Process buffered SSL read bytes to support records >8kB on async API
Previous Message Peter Geoghegan 2025-07-16 21:27:23 Re: index prefetching