Details
-
Improvement
-
Status: Resolved
-
Low
-
Resolution: Duplicate
-
None
-
None
-
None
Description
Follow up to CASSANDRA-8099.
We use TreeSet in a lot of places unnecessarily. This is especially a concern now that we store the set of rows we're searching for in both forward and (potentially) reverse order, which we have to construct twice. A very simple wrapper around BTree (which we had previously, but did not employ) would permit us to reverse this collection without any extra work, can be built more cheaply, consumes less memory, and supports the SearchIterator interface, so can be iterated more efficiently.
Attachments
Issue Links
- depends upon
-
CASSANDRA-8099 Refactor and modernize the storage engine
- Resolved