iverase opened a new issue, #14382: URL: https://github.com/apache/lucene/issues/14382
When building BKD trees, we hold two arrays in memory which sizes grows linearly with the number of leaf nodes. One of the array contains the pointer to the start of a leaf node, and the other containing the split value. The number of leaf nodes does not grow with the number of documents but with the number of values, therefore in the case of multi-values, those arrays can grow quite big. The situation is particularly inefficient for the `OneDimensionBKDWriter` where we are using a List to hold the split values. I wonder if we can use more efficient data structures to lower the heapusage. For example, maybe we can use the `FixedLengthBytesRefArray` to hold split values or used some packing algorithm to hold the leaf pointers. -- 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-unsubscr...@lucene.apache.org.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
