Learned indexes can answer lookups faster than B-trees but handle updates poorly. We worked on learned index structures that support concurrent inserts and deletes.
Research Goal
Concurrent updates for learned indexes
Learned indexes can answer lookups faster than B-trees but handle updates poorly. We worked on learned index structures that support concurrent inserts and deletes.
Concurrent updates for learned indexes
