Главная
Study mode:
on
1
Introduction
2
Machine Learning
3
Btrees
4
ML
5
Accuracy
6
Tradeoffs
7
Results
8
Inserts
9
Hashmaps
10
Bench benchmark
11
Hash maps
12
Controversy
13
Bloom Filters as Models
14
Bloom Filter Results
15
Michael Mitchell Mocker
16
Conclusion
Description:
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. Read more

The Case for Learned Index Structures

Stanford University
Add to list
0:00 / 0:00