rmuir commented on issue #16672:
URL: https://github.com/apache/lucene/issues/16672#issuecomment-5705115640

   Well otherwise, the short-string optimizations are usually a way to avoid 
heap allocations. 
   
   But for java, I'm just not seeing any benefits, and I worry about only 
resulting in more pointer-chasing and GC pressure, not less.
   
   For your listed use-case, I think binarydocvalues is the wrong thing to use 
at all. If you want to efficiently compare the strings then use 
sorted/sortedset?


-- 
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: [email protected]

For queries about this service, please contact Infrastructure at:
[email protected]


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to