Push vs pull materialization for features.
mediumAnswer
- Push: compute feature eagerly, store in online store, serve reads from cache.
- Low serve latency, higher storage cost, potential staleness.
- Pull: compute on demand at request time.
- Always fresh, higher serve latency, no storage cost.
- Hybrid: precompute expensive aggregates (push), compute cheap derivations at request (pull).
- Choose by (feature update frequency, serve QPS, latency budget).
- Modern: caching layer sits between with TTL.
Check yourself — multiple choice
- Same
- Push: precompute + cache serve (low latency, higher cost, staleness); Pull: compute at request (fresh, higher latency, no storage); hybrid + caching layer common
- Random
- Not real
Push (precompute + cache) vs Pull (on-demand); tradeoff latency/freshness.
#features#infrastructure
Practise MLOps & Data Quality
215 interview questions in this topic.
Related questions
- Online vs offline feature store — architecture.
- How do you compute real-time features (streaming aggregates)?
- When is a feature store worth the operational cost?
- What problem does a feature store solve?
- How do you handle missing values in a production pipeline?
- How do you handle high-cardinality categorical features?