Details
-
Improvement
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
None
Description
The current implementation of WindowKeySchema / SessionKeySchema upperRange and lowerRange does not make any assumptions with respect to the other key bound (e.g. the upper byte bound does not depends on lower key bound).
It should be possible to optimize the byte range somewhat further using the information provided by the lower bound.
More specifically, by incorporating that information, we should be able to eliminate the corresponding upperRangeFixedSize and lowerRangeFixedSize, since the result should be the same if we implement that optimization.
Attachments
Issue Links
- incorporates
-
KAFKA-4608 RocksDBWindowStore.fetch() is inefficient for large ranges
- Open
- relates to
-
KAFKA-12314 Leverage custom comparator for optimized range scans on RocksDB
- Open
- links to