Details
-
Task
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
-
None
Description
It is necessary to implement a hash index B+Tree, for simplicity, without inlining a BinaryTuple, but simply storing a link to it.
The key will be: hash and link of the BinaryTuple.
The value will be: RowId.
Attachments
Issue Links
- is a child of
-
IGNITE-17339 Implement B+Tree based hash index storage
- Resolved
- links to