[
https://issues.apache.org/jira/browse/IGNITE-27198?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Ivan Bessonov updated IGNITE-27198:
-----------------------------------
Reviewer: Aleksandr Polovtsev
> Optimize double PK index lookup
> -------------------------------
>
> Key: IGNITE-27198
> URL: https://issues.apache.org/jira/browse/IGNITE-27198
> Project: Ignite
> Issue Type: Bug
> Reporter: Ivan Bessonov
> Assignee: Ivan Bessonov
> Priority: Major
> Labels: ignite-3
> Time Spent: 10m
> Remaining Estimate: 0h
>
> Currently we use a {{PeekCursor}} for calling "get" from hash index storage.
> This means that in best case scenario we do two lookups to the index tree:
> * Read {{{}RowId{}}}.
> * Make sure that the next element is {{{}null{}}}.
> This is problematic, because a simple implicit get only requires two actions:
> resolve {{PK}} and resolve {{{}RowId{}}}. Currently it is 3 lookups to the
> B+Tree that could be reduced to 2, which is substantial.
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
