Explore the potential of learned index structures in this Stanford University seminar featuring Google researchers Alex Beutel and Ed Chi. Delve into the concept of viewing traditional database index structures as models and learn how they can be replaced with machine learning models for improved performance. Discover the theoretical analysis behind learned indexes, their challenges, and initial results showing up to 70% speed improvement over cache-optimized B-Trees while significantly reducing memory usage. Gain insights into the broader implications of learned indexes on database design and future research directions in machine learning for database systems. The speakers, both accomplished researchers in machine learning and user behavior modeling, share their expertise on neural recommendation, fairness in machine learning, and ML for systems. Covering topics from introduction to machine learning, B-trees, accuracy trade-offs, results, inserts, hashmaps, benchmarks, Bloom filters, and controversies, this comprehensive seminar provides a deep dive into the cutting-edge intersection of machine learning and database systems.
Overview
Syllabus
Introduction
Machine Learning
Btrees
ML
Accuracy
Tradeoffs
Results
Inserts
Hashmaps
Bench benchmark
Hash maps
Controversy
Bloom Filters as Models
Bloom Filter Results
Michael Mitchell Mocker
Conclusion
Taught by
Stanford Online