[GitHub] [lucene] vsop-479 commented on pull request #11722: Binary search the entries when all suffixes have the same length in a leaf block.

[GitBox <gi...@apache.org>]

vsop-479 commented on PR #11722:
URL: https://github.com/apache/lucene/pull/11722#issuecomment-1255837607

   @jpountz 
   Thanks for your review.
   I did a simple performance test, which indexed 1M random UUID's substring(2, 8), got 10 segments, and picked up 1K terms to search. Average Result of 4 times tests: 
   
   Method took:
   baseline(scanToTermLeaf)ns | candidate(binarySearchTermLeaf)ns | speedup
   -- | -- |--
   5,757,121.5 | 4,761,325.5 | 20.9%
   
   Whole search took:
   baseline(scan)ns | candidate(binarySearch)ns | speedup
   -- | -- |--
   162,668,448 | 157,990,611 | 2.9%
   
   In my test case, scanToTerm only took 3.5% of the whole search execute time, so it could only got a small speedup.
   I may add this test case to BasePostingsFormatTestCase, or do you have any other idea on test?
   I willl update the comment, please have a review. 
   


-- 
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: issues-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org