[MDEV-33413] cache k-ANN graph in memory Created: 2024-02-07  Updated: 2024-02-07

Status: Open
Project: MariaDB Server
Component/s: None
Fix Version/s: None

Type: Task Priority: Major
Reporter: Sergei Golubchik Assignee: Unassigned
Resolution: Unresolved Votes: 0
Labels: None

Issue Links:
Blocks
is blocked by MDEV-33414 benchmark vector indexes Open
Relates
relates to MDEV-32887 k-ANN indexes for vectors In Progress

 Description   

Let's keep the graph in memory. Like, in TABLE_SHARE.
Add nodes there as they're read from the table, e.g. on searches.
Update on inserts.

When it'll grow beyond some (configurable) limit, start removing nodes that are close to each other. Or remove the bottom level in HNSW. The goal is to still keep enough in memory to find any row with no more than one table access.

Not clear how to do transaction isolation.
Generated at Thu Feb 08 10:38:43 UTC 2024 using Jira 8.20.16#820016-sha1:9d11dbea5f4be3d4cc21f03a88dd11d8c8687422.