On the performance of learned data structures

DOI10.1016/J.TCS.2021.04.015MaRDI QIDQ2031054zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, Fabrizio Lillo, Giorgio Vinciguerra

Publication date 8 June 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• Static optimality and dynamic search-optimality in lists and trees
• Belga B-trees
• Belga B-trees
• scientific article; zbMATH DE number 1149453
• scientific article; zbMATH DE number 2119638

Cites work

• scientific article; zbMATH DE number 1026574 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• A guide to first-passage processes
• A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
• An on-line algorithm for fitting straight lines between data ranges
• Approximating points by a piecewise linear function
• Handbook of stochastic methods for physics, chemistry and natural sciences.

Cited in

(3)

• Efficient learning in adaptive processing of data structures
• On data and algorithms: Understanding inductive performance
• Machine learning advised algorithms for the ski rental problem with a discount

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031054)