Details
-
Task
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
-
None
Description
In order for us to work with many index B+Tree, we need to store their roots somewhere, a separate B+Tree is suitable for this, as done in 2.0, but instead of a key in the form of an index name, we need to use something more unique, for example, UUID.
Attachments
Issue Links
- is a child of
-
IGNITE-17320 Implement B+Tree based sorted index storage
- Resolved
- links to