Jackie-Jiang commented on issue #8837: URL: https://github.com/apache/pinot/issues/8837#issuecomment-1147742796
We will maintain a priority queue of size 10, and insert all the matching docs (instead of up to 10k) to the priority queue. For the first case, the new inserted value is always the top value, we we need to heapify the heap for every insert. We should optimize the engine so that when we order by a sorted column (either DESC or ASC), we do not insert all the matching docs, but only the first N or last N based on the sorting order. One challenge here is that we don't support iterating the matching docs in the reverse order currently. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: commits-unsubscr...@pinot.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: commits-unsubscr...@pinot.apache.org For additional commands, e-mail: commits-h...@pinot.apache.org
