On the performance of learned data structures

DOI10.1016/j.tcs.2021.04.015zbMath1503.68050OpenAlexW3158552329MaRDI QIDQ2031054

Giorgio Vinciguerra, Fabrizio Lillo, Paolo Ferragina

Publication date: 8 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.015

zbMATH Keywords

data structurespredecessor searchB-treeslearned indexes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Related Items (1)

Machine learning advised algorithms for the ski rental problem with a discount

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating points by a piecewise linear function
• A Guide to First-Passage Processes
• An on-line algorithm for fitting straight lines between data ranges
• A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
• Handbook of stochastic methods for physics, chemistry and natural sciences.

This page was built for publication: On the performance of learned data structures