Algorithmic Complexity Attacks on Dynamic Learned Indexes

arXiv:2403.12433v1 Announce Type: cross
Abstract: Learned Index Structures (LIS) view a sorted index as a model that learns the data distribution, takes a data element key as input, and outputs the predicted position of the key. The original LIS can only handle lookup operations with no support for updates, rendering it impractical to use for typical workloads. To address this limitation, recent studies have focused on designing efficient dynamic learned indexes. ALEX, as the pioneering dynamic learned index structures, enables …

arxiv attacks can complexity cs.cr cs.db data distribution dynamic input key operations support the key updates