Details
-
Improvement
-
Status: Resolved
-
Normal
-
Resolution: Fixed
-
None
Description
currently j.o.a.c.io.sstable.indexsummary is implemented as ArrayList of KeyPosition (RowPosition key, long offset)i propose to change it to:
RowPosition keys[]
long offsets[]
and use standard binary search on it. This will lower number of java objects used per entry from 2 (KeyPosition + RowPosition) to 1 (RowPosition).
For building these arrays convenient ArrayList class can be used and then call to .toArray() on it.
This is very important because index sampling uses a lot of memory on nodes with billions rows