kishoreg commented on PR #11557: URL: https://github.com/apache/pinot/pull/11557#issuecomment-1713175259
can we comment on the performance of this depending on the number of hits for example sorted values length (m) = 1000 dictionary length (n) = 1M What is the performance for each of the following strategy when we vary the hits from 0% match to 100% match. - linear search (mlogn) - merge sort o(m+n) - this PR's divide and conquer o(m) to o(mlogn) -- 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
