stroom
stroom copied to clipboard
Improve search memory usage
-
[x] Add a bytebuffer pool to improve performance and allow bounding of total active bytebuffers to constrain total memory usage.
-
[ ] Eliminate unnecessary storage of primitive reference values where they are only used to eval a parent function, e.g. substring.
-
[ ] Make countDistinct use HyperLogLog by default so there is no longer a need to store all values. It should be possible to force exact counts but perhaps limit how many items can be counted exactly. Exact counts could still use hashes if we think they are likely to be unique enough.