Details
-
Task
-
Status: In Testing (View Workflow)
-
Critical
-
Resolution: Unresolved
-
None
-
None
Description
Use some real-life million-size dataset
Benchmark goals:
- Index creation time
- Index update time
- Index lookup for 1, 10, 100, 1000 entries for the same "query" vector repeated N times.
- This tests speed of graph lookup with hopefully most data in cache.
- Index lookup for million different query vectors (top 1, 10, 100, 1000) results, no repetition.
- This tests speed of graph lookup when data may not all fit in cache.
- Compute average recall of the algorithm for such queries.
Compare to papers using the same algorithm.
Attachments
Issue Links
- blocks
-
MDEV-33413 cache k-ANN graph in memory
-
- In Testing
-
-
MDEV-33415 graph index search: heuristical edge choice
-
- Closed
-
-
MDEV-33416 graph index: use smaller floating point numbers
-
- In Testing
-
-
MDEV-33418 graph index insert: stronger selection of neighbors
-
- In Testing
-
-
MDEV-33419 graph index insert: consider more neighbors
-
- Open
-
- is blocked by
-
MDEV-33406 basic optimizer support for k-NN searches
-
- In Testing
-
-
MDEV-33407 Parser support for vector indexes
-
- In Testing
-
-
MDEV-33408 HNSW for k-ANN vector searches
-
- In Testing
-
- relates to
-
MDEV-33404 Engine-independent indexes: subtable method
-
- In Testing
-
-
MDEV-33405 Engine-independent indexes: low-level API method
-
- Open
-
-
MDEV-32887 k-ANN indexes for vectors
-
- In Progress
-