Index - Learned index (Index as Model)

Data System Architecture


A B-Tree can be considered as a model which takes a key as an input and predicts the position of a data record. A Bloom-Filter is a binary classifier, which based on a key predicts if a key exists in a set or not. Obviously, there exists subtle but important differences. For example, a Bloom-Filter can have false positives but not false negative

Documentation / Reference

Share this page:
Follow us:
Task Runner