![\"Feature](\"https:\/\/www.kdnuggets.com\/wp-content\/uploads\/Rosidi-Feature-Stores-Minimal-Implementation-2-scaled.png\"\/)
\u00a0<\/p>\n
#\u00a0<\/span>Introduction<\/h2>\n\u00a0Most groups uncover they want a characteristic retailer the exhausting approach. A fraud mannequin works within the pocket book and quietly breaks in manufacturing. A help agent offers a generic reply as a result of it has no thought who the person is. A recommender pipeline duplicates the identical “30-day spend” calculation throughout three jobs, and two of them disagree.<\/p>\n
A characteristic retailer is the piece of infrastructure that fixes these issues. It defines options as soon as, shops them in two shapes (one for coaching, one for serving), and retains each in sync. We’re going to construct a minimal one from scratch in Python, utilizing DuckDB, Parquet, Redis, and FastAPI. Then we’ll take a look at how AI functions change what we really use it for.<\/p>\n
The total code is brief sufficient that we are going to stroll by each element.<\/p>\n
\u00a0![\"Feature](\"https:\/\/www.kdnuggets.com\/wp-content\/uploads\/Rosidi-Feature-Stores-Minimal-Implementation-3.png\"\/)
\u00a0<\/p>\n
#\u00a0<\/span>What a Function Retailer Truly Solves<\/h2>\n\u00a0The traditional pitch is training-serving skew: the SQL that constructed your coaching set shouldn’t be the identical code path that runs at inference, so the values drift. That downside is actual, and the offline plus on-line break up is the usual repair.<\/p>\n
The trendy pitch is broader. Giant language mannequin (LLM) brokers and retrieval-augmented technology (RAG) pipelines want structured person context at inference time, on each request, in underneath 10ms. An LLM has no reminiscence of who the person is. If we wish personalised output, we’ve got to inject the person’s plan tier, current exercise, and account state into the immediate, and we’d like a system that may return these values quick and persistently. That’s precisely what a characteristic retailer’s on-line retailer and retrieval API give us.<\/p>\n
So we construct for each. The identical 5 parts deal with the predictive machine studying use case and the LLM context use case.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The 5 Parts<\/h2>\n\u00a0<\/p>\n
A characteristic registry that defines options as code.
\nAn offline retailer on Parquet, queried with DuckDB, for coaching and backfills.
\nA web based retailer on Redis for low-latency lookups at inference.
\nA materialization pipeline that pushes the most recent values from offline to on-line.
\nA FastAPI service that exposes a typed retrieval API.<\/p>\n
\u00a0![\"Feature](\"https:\/\/www.kdnuggets.com\/wp-content\/uploads\/Rosidi-Feature-Stores-Minimal-Implementation-4.png\"\/)
\u00a0<\/p>\n
#\u00a0<\/span>Working Instance: A Customized LLM Recommender<\/h2>\n\u00a0We’re working a streaming service. When a person opens the app, an LLM generates a brief, personalised “what to look at subsequent” message. The LLM wants three issues in regards to the person:<\/p>\n
\u00a0<\/p>\n
Function
\nKind
\nFreshness<\/p>\n
user_segment
\nstring
\nevery day<\/p>\n
watch_count_30d
\nint
\nhourly<\/p>\n
last_genre
\nstring
\nper-event<\/p>\n
\u00a0<\/p>\n
The entity is user_id. We are going to register these three options, materialize them, and serve them to the LLM at request time.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>1. Defining the Function Registry<\/h4>\nA registry is only a place the place options are declared as soon as, with their entity, dtype, and supply. We use a dataclass.<\/p>\n
\nfrom dataclasses import dataclass
\nfrom typing import Literal
\n
\n@dataclass(frozen=True)
\nclass Function:
\n identify: str
\n entity: str
\n dtype: Literal[“int”, “float”, “str”]
\n supply: str # path to a Parquet file or a SQL view
\n
\nREGISTRY: dict[str, Feature] = {
\n “user_segment”: Function(“user_segment”, “user_id”, “str”, “knowledge\/user_segment.parquet”),
\n “watch_count_30d”: Function(“watch_count_30d”, “user_id”, “int”, “knowledge\/watch_count_30d.parquet”),
\n “last_genre”: Function(“last_genre”, “user_id”, “str”, “knowledge\/last_genre.parquet”),
\n}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nRegistered options:
\nuser_segment entity=user_id dtype=str supply=knowledge\/user_segment.parquet
\nwatch_count_30d entity=user_id dtype=int supply=knowledge\/watch_count_30d.parquet
\nlast_genre entity=user_id dtype=str supply=knowledge\/last_genre.parquet\n<\/div>\n\u00a0<\/p>\n
That is the contract. Each different element reads from REGISTRY, so renaming a characteristic, altering its dtype, or pointing it at a brand new supply occurs in a single place. In manufacturing programs, this might be YAML or a Python module checked right into a Git repo, with code evaluation on each change.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>2. Constructing the Offline Retailer with DuckDB and Parquet<\/h4>\nThe offline retailer holds the total historical past of each characteristic worth. We use Parquet recordsdata because the storage layer and DuckDB because the question engine. DuckDB reads Parquet immediately, which implies no separate database to run.<\/p>\n
Here’s a pattern of the code:<\/p>\n
\nimport duckdb
\nimport pandas as pd
\n
\ndef get_historical_features(
\n entity_df: pd.DataFrame, options: checklist[str]
\n) -> pd.DataFrame:
\n con = duckdb.join()
\n con.register(“entities”, entity_df)
\n base = “SELECT * FROM entities”
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n con.execute(f”CREATE VIEW {fname}_src AS SELECT * FROM ‘{src}'”)
\n base = f”””
\n SELECT t.*, s.{fname}
\n FROM ({base}) t
\n ASOF LEFT JOIN {fname}_src s
\n ON t.user_id = s.user_id
\n AND t.event_timestamp >= s.event_timestamp
\n “””
\n return con.execute(base).df()\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\u00a0<\/p>\n
user_id
\nevent_timestamp
\nuser_segment
\nwatch_count_30d
\nlast_genre<\/p>\n
8a2f
\n2026-05-05 12:00:00
\ninformal
\n22
\nNaN<\/p>\n
b13c
\n2026-05-07 20:00:00
\ninformal
\n5
\nthriller<\/p>\n
8a2f
\n2026-05-07 22:00:00
\npower_user
\n47
\ndocumentary<\/p>\n
\u00a0<\/p>\n
The AsOf be part of is the point-in-time be part of. For each entity row, it picks the latest characteristic worth the place the characteristic’s timestamp is at or earlier than the occasion timestamp. That’s what prevents leakage \u2014 the place a coaching row is constructed with a characteristic worth that didn’t exist but in the intervening time we’re predicting for.<\/p>\n
Level-in-time joins are nonetheless the correct reply for any mannequin we plan to coach or fine-tune. For a pure inference-time LLM use case, we might by no means name this operate. We nonetheless need the offline retailer, since it’s the place backfills, analysis datasets, and audits come from.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>3. Setting Up the On-line Retailer on Redis<\/h4>\nThe web retailer retains solely the most recent worth per entity. Redis is the usual alternative as a result of hash lookups are sub-millisecond.<\/p>\n
\nimport json
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nread_online -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nlacking key -> {‘user_segment’: None}\n<\/div>\n\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0![\"Feature](\"https:\/\/www.kdnuggets.com\/wp-content\/uploads\/Rosidi-Feature-Stores-Minimal-Implementation-5.png\"\/)
\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0![\"Feature](\"https:\/\/www.kdnuggets.com\/wp-content\/uploads\/Rosidi-Feature-Stores-Minimal-Implementation-6.png\"\/)
\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\u00a0<\/p>\n\u00a0The traditional pitch is training-serving skew: the SQL that constructed your coaching set shouldn’t be the identical code path that runs at inference, so the values drift. That downside is actual, and the offline plus on-line break up is the usual repair.<\/p>\n
The trendy pitch is broader. Giant language mannequin (LLM) brokers and retrieval-augmented technology (RAG) pipelines want structured person context at inference time, on each request, in underneath 10ms. An LLM has no reminiscence of who the person is. If we wish personalised output, we’ve got to inject the person’s plan tier, current exercise, and account state into the immediate, and we’d like a system that may return these values quick and persistently. That’s precisely what a characteristic retailer’s on-line retailer and retrieval API give us.<\/p>\n
So we construct for each. The identical 5 parts deal with the predictive machine studying use case and the LLM context use case.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The 5 Parts<\/h2>\n\u00a0<\/p>\n
A characteristic registry that defines options as code.
\nAn offline retailer on Parquet, queried with DuckDB, for coaching and backfills.
\nA web based retailer on Redis for low-latency lookups at inference.
\nA materialization pipeline that pushes the most recent values from offline to on-line.
\nA FastAPI service that exposes a typed retrieval API.<\/p>\n
\u00a0\u00a0<\/p>\n
#\u00a0<\/span>Working Instance: A Customized LLM Recommender<\/h2>\n\u00a0We’re working a streaming service. When a person opens the app, an LLM generates a brief, personalised “what to look at subsequent” message. The LLM wants three issues in regards to the person:<\/p>\n
\u00a0<\/p>\n
Function
\nKind
\nFreshness<\/p>\n
user_segment
\nstring
\nevery day<\/p>\n
watch_count_30d
\nint
\nhourly<\/p>\n
last_genre
\nstring
\nper-event<\/p>\n
\u00a0<\/p>\n
The entity is user_id. We are going to register these three options, materialize them, and serve them to the LLM at request time.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>1. Defining the Function Registry<\/h4>\nA registry is only a place the place options are declared as soon as, with their entity, dtype, and supply. We use a dataclass.<\/p>\n
\nfrom dataclasses import dataclass
\nfrom typing import Literal
\n
\n@dataclass(frozen=True)
\nclass Function:
\n identify: str
\n entity: str
\n dtype: Literal[“int”, “float”, “str”]
\n supply: str # path to a Parquet file or a SQL view
\n
\nREGISTRY: dict[str, Feature] = {
\n “user_segment”: Function(“user_segment”, “user_id”, “str”, “knowledge\/user_segment.parquet”),
\n “watch_count_30d”: Function(“watch_count_30d”, “user_id”, “int”, “knowledge\/watch_count_30d.parquet”),
\n “last_genre”: Function(“last_genre”, “user_id”, “str”, “knowledge\/last_genre.parquet”),
\n}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nRegistered options:
\nuser_segment entity=user_id dtype=str supply=knowledge\/user_segment.parquet
\nwatch_count_30d entity=user_id dtype=int supply=knowledge\/watch_count_30d.parquet
\nlast_genre entity=user_id dtype=str supply=knowledge\/last_genre.parquet\n<\/div>\n\u00a0<\/p>\n
That is the contract. Each different element reads from REGISTRY, so renaming a characteristic, altering its dtype, or pointing it at a brand new supply occurs in a single place. In manufacturing programs, this might be YAML or a Python module checked right into a Git repo, with code evaluation on each change.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>2. Constructing the Offline Retailer with DuckDB and Parquet<\/h4>\nThe offline retailer holds the total historical past of each characteristic worth. We use Parquet recordsdata because the storage layer and DuckDB because the question engine. DuckDB reads Parquet immediately, which implies no separate database to run.<\/p>\n
Here’s a pattern of the code:<\/p>\n
\nimport duckdb
\nimport pandas as pd
\n
\ndef get_historical_features(
\n entity_df: pd.DataFrame, options: checklist[str]
\n) -> pd.DataFrame:
\n con = duckdb.join()
\n con.register(“entities”, entity_df)
\n base = “SELECT * FROM entities”
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n con.execute(f”CREATE VIEW {fname}_src AS SELECT * FROM ‘{src}'”)
\n base = f”””
\n SELECT t.*, s.{fname}
\n FROM ({base}) t
\n ASOF LEFT JOIN {fname}_src s
\n ON t.user_id = s.user_id
\n AND t.event_timestamp >= s.event_timestamp
\n “””
\n return con.execute(base).df()\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\u00a0<\/p>\n
user_id
\nevent_timestamp
\nuser_segment
\nwatch_count_30d
\nlast_genre<\/p>\n
8a2f
\n2026-05-05 12:00:00
\ninformal
\n22
\nNaN<\/p>\n
b13c
\n2026-05-07 20:00:00
\ninformal
\n5
\nthriller<\/p>\n
8a2f
\n2026-05-07 22:00:00
\npower_user
\n47
\ndocumentary<\/p>\n
\u00a0<\/p>\n
The AsOf be part of is the point-in-time be part of. For each entity row, it picks the latest characteristic worth the place the characteristic’s timestamp is at or earlier than the occasion timestamp. That’s what prevents leakage \u2014 the place a coaching row is constructed with a characteristic worth that didn’t exist but in the intervening time we’re predicting for.<\/p>\n
Level-in-time joins are nonetheless the correct reply for any mannequin we plan to coach or fine-tune. For a pure inference-time LLM use case, we might by no means name this operate. We nonetheless need the offline retailer, since it’s the place backfills, analysis datasets, and audits come from.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>3. Setting Up the On-line Retailer on Redis<\/h4>\nThe web retailer retains solely the most recent worth per entity. Redis is the usual alternative as a result of hash lookups are sub-millisecond.<\/p>\n
\nimport json
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nread_online -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nlacking key -> {‘user_segment’: None}\n<\/div>\n\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\nAn offline retailer on Parquet, queried with DuckDB, for coaching and backfills.
\nA web based retailer on Redis for low-latency lookups at inference.
\nA materialization pipeline that pushes the most recent values from offline to on-line.
\nA FastAPI service that exposes a typed retrieval API.<\/p>\n
\u00a0<\/p>\n\u00a0We’re working a streaming service. When a person opens the app, an LLM generates a brief, personalised “what to look at subsequent” message. The LLM wants three issues in regards to the person:<\/p>\n
\u00a0<\/p>\n
Function
\nKind
\nFreshness<\/p>\n
user_segment
\nstring
\nevery day<\/p>\n
watch_count_30d
\nint
\nhourly<\/p>\n
last_genre
\nstring
\nper-event<\/p>\n
\u00a0<\/p>\n
The entity is user_id. We are going to register these three options, materialize them, and serve them to the LLM at request time.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>1. Defining the Function Registry<\/h4>\nA registry is only a place the place options are declared as soon as, with their entity, dtype, and supply. We use a dataclass.<\/p>\n
\nfrom dataclasses import dataclass
\nfrom typing import Literal
\n
\n@dataclass(frozen=True)
\nclass Function:
\n identify: str
\n entity: str
\n dtype: Literal[“int”, “float”, “str”]
\n supply: str # path to a Parquet file or a SQL view
\n
\nREGISTRY: dict[str, Feature] = {
\n “user_segment”: Function(“user_segment”, “user_id”, “str”, “knowledge\/user_segment.parquet”),
\n “watch_count_30d”: Function(“watch_count_30d”, “user_id”, “int”, “knowledge\/watch_count_30d.parquet”),
\n “last_genre”: Function(“last_genre”, “user_id”, “str”, “knowledge\/last_genre.parquet”),
\n}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nRegistered options:
\nuser_segment entity=user_id dtype=str supply=knowledge\/user_segment.parquet
\nwatch_count_30d entity=user_id dtype=int supply=knowledge\/watch_count_30d.parquet
\nlast_genre entity=user_id dtype=str supply=knowledge\/last_genre.parquet\n<\/div>\n\u00a0<\/p>\n
That is the contract. Each different element reads from REGISTRY, so renaming a characteristic, altering its dtype, or pointing it at a brand new supply occurs in a single place. In manufacturing programs, this might be YAML or a Python module checked right into a Git repo, with code evaluation on each change.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>2. Constructing the Offline Retailer with DuckDB and Parquet<\/h4>\nThe offline retailer holds the total historical past of each characteristic worth. We use Parquet recordsdata because the storage layer and DuckDB because the question engine. DuckDB reads Parquet immediately, which implies no separate database to run.<\/p>\n
Here’s a pattern of the code:<\/p>\n
\nimport duckdb
\nimport pandas as pd
\n
\ndef get_historical_features(
\n entity_df: pd.DataFrame, options: checklist[str]
\n) -> pd.DataFrame:
\n con = duckdb.join()
\n con.register(“entities”, entity_df)
\n base = “SELECT * FROM entities”
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n con.execute(f”CREATE VIEW {fname}_src AS SELECT * FROM ‘{src}'”)
\n base = f”””
\n SELECT t.*, s.{fname}
\n FROM ({base}) t
\n ASOF LEFT JOIN {fname}_src s
\n ON t.user_id = s.user_id
\n AND t.event_timestamp >= s.event_timestamp
\n “””
\n return con.execute(base).df()\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\u00a0<\/p>\n
user_id
\nevent_timestamp
\nuser_segment
\nwatch_count_30d
\nlast_genre<\/p>\n
8a2f
\n2026-05-05 12:00:00
\ninformal
\n22
\nNaN<\/p>\n
b13c
\n2026-05-07 20:00:00
\ninformal
\n5
\nthriller<\/p>\n
8a2f
\n2026-05-07 22:00:00
\npower_user
\n47
\ndocumentary<\/p>\n
\u00a0<\/p>\n
The AsOf be part of is the point-in-time be part of. For each entity row, it picks the latest characteristic worth the place the characteristic’s timestamp is at or earlier than the occasion timestamp. That’s what prevents leakage \u2014 the place a coaching row is constructed with a characteristic worth that didn’t exist but in the intervening time we’re predicting for.<\/p>\n
Level-in-time joins are nonetheless the correct reply for any mannequin we plan to coach or fine-tune. For a pure inference-time LLM use case, we might by no means name this operate. We nonetheless need the offline retailer, since it’s the place backfills, analysis datasets, and audits come from.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>3. Setting Up the On-line Retailer on Redis<\/h4>\nThe web retailer retains solely the most recent worth per entity. Redis is the usual alternative as a result of hash lookups are sub-millisecond.<\/p>\n
\nimport json
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nread_online -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nlacking key -> {‘user_segment’: None}\n<\/div>\n\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\nfrom typing import Literal
\n
\n@dataclass(frozen=True)
\nclass Function:
\n identify: str
\n entity: str
\n dtype: Literal[“int”, “float”, “str”]
\n supply: str # path to a Parquet file or a SQL view
\n
\nREGISTRY: dict[str, Feature] = {
\n “user_segment”: Function(“user_segment”, “user_id”, “str”, “knowledge\/user_segment.parquet”),
\n “watch_count_30d”: Function(“watch_count_30d”, “user_id”, “int”, “knowledge\/watch_count_30d.parquet”),
\n “last_genre”: Function(“last_genre”, “user_id”, “str”, “knowledge\/last_genre.parquet”),
\n}\n<\/div>\n
\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_segment entity=user_id dtype=str supply=knowledge\/user_segment.parquet
\nwatch_count_30d entity=user_id dtype=int supply=knowledge\/watch_count_30d.parquet
\nlast_genre entity=user_id dtype=str supply=knowledge\/last_genre.parquet\n<\/div>\n
\u00a0<\/p>\n
That is the contract. Each different element reads from REGISTRY, so renaming a characteristic, altering its dtype, or pointing it at a brand new supply occurs in a single place. In manufacturing programs, this might be YAML or a Python module checked right into a Git repo, with code evaluation on each change.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>2. Constructing the Offline Retailer with DuckDB and Parquet<\/h4>\nThe offline retailer holds the total historical past of each characteristic worth. We use Parquet recordsdata because the storage layer and DuckDB because the question engine. DuckDB reads Parquet immediately, which implies no separate database to run.<\/p>\n
Here’s a pattern of the code:<\/p>\n
\nimport duckdb
\nimport pandas as pd
\n
\ndef get_historical_features(
\n entity_df: pd.DataFrame, options: checklist[str]
\n) -> pd.DataFrame:
\n con = duckdb.join()
\n con.register(“entities”, entity_df)
\n base = “SELECT * FROM entities”
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n con.execute(f”CREATE VIEW {fname}_src AS SELECT * FROM ‘{src}'”)
\n base = f”””
\n SELECT t.*, s.{fname}
\n FROM ({base}) t
\n ASOF LEFT JOIN {fname}_src s
\n ON t.user_id = s.user_id
\n AND t.event_timestamp >= s.event_timestamp
\n “””
\n return con.execute(base).df()\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\u00a0<\/p>\n
user_id
\nevent_timestamp
\nuser_segment
\nwatch_count_30d
\nlast_genre<\/p>\n
8a2f
\n2026-05-05 12:00:00
\ninformal
\n22
\nNaN<\/p>\n
b13c
\n2026-05-07 20:00:00
\ninformal
\n5
\nthriller<\/p>\n
8a2f
\n2026-05-07 22:00:00
\npower_user
\n47
\ndocumentary<\/p>\n
\u00a0<\/p>\n
The AsOf be part of is the point-in-time be part of. For each entity row, it picks the latest characteristic worth the place the characteristic’s timestamp is at or earlier than the occasion timestamp. That’s what prevents leakage \u2014 the place a coaching row is constructed with a characteristic worth that didn’t exist but in the intervening time we’re predicting for.<\/p>\n
Level-in-time joins are nonetheless the correct reply for any mannequin we plan to coach or fine-tune. For a pure inference-time LLM use case, we might by no means name this operate. We nonetheless need the offline retailer, since it’s the place backfills, analysis datasets, and audits come from.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>3. Setting Up the On-line Retailer on Redis<\/h4>\nThe web retailer retains solely the most recent worth per entity. Redis is the usual alternative as a result of hash lookups are sub-millisecond.<\/p>\n
\nimport json
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nread_online -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nlacking key -> {‘user_segment’: None}\n<\/div>\n\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\nimport pandas as pd
\n
\ndef get_historical_features(
\n entity_df: pd.DataFrame, options: checklist[str]
\n) -> pd.DataFrame:
\n con = duckdb.join()
\n con.register(“entities”, entity_df)
\n base = “SELECT * FROM entities”
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n con.execute(f”CREATE VIEW {fname}_src AS SELECT * FROM ‘{src}'”)
\n base = f”””
\n SELECT t.*, s.{fname}
\n FROM ({base}) t
\n ASOF LEFT JOIN {fname}_src s
\n ON t.user_id = s.user_id
\n AND t.event_timestamp >= s.event_timestamp
\n “””
\n return con.execute(base).df()\n<\/div>\n
\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\u00a0<\/p>\n
user_id
\nevent_timestamp
\nuser_segment
\nwatch_count_30d
\nlast_genre<\/p>\n
8a2f
\n2026-05-05 12:00:00
\ninformal
\n22
\nNaN<\/p>\n
b13c
\n2026-05-07 20:00:00
\ninformal
\n5
\nthriller<\/p>\n
8a2f
\n2026-05-07 22:00:00
\npower_user
\n47
\ndocumentary<\/p>\n
\u00a0<\/p>\n
The AsOf be part of is the point-in-time be part of. For each entity row, it picks the latest characteristic worth the place the characteristic’s timestamp is at or earlier than the occasion timestamp. That’s what prevents leakage \u2014 the place a coaching row is constructed with a characteristic worth that didn’t exist but in the intervening time we’re predicting for.<\/p>\n
Level-in-time joins are nonetheless the correct reply for any mannequin we plan to coach or fine-tune. For a pure inference-time LLM use case, we might by no means name this operate. We nonetheless need the offline retailer, since it’s the place backfills, analysis datasets, and audits come from.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>3. Setting Up the On-line Retailer on Redis<\/h4>\nThe web retailer retains solely the most recent worth per entity. Redis is the usual alternative as a result of hash lookups are sub-millisecond.<\/p>\n
\nimport json
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nread_online -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nlacking key -> {‘user_segment’: None}\n<\/div>\n\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\nimport fakeredis # use redis.Redis() towards an actual server in manufacturing
\n
\nr = fakeredis.FakeRedis(decode_responses=True)
\n
\ndef write_online(entity: str, entity_id: str, values: dict) -> None:
\n r.hset(
\n f”{entity}:{entity_id}”,
\n mapping={ok: json.dumps(v) for ok, v in values.gadgets()},
\n )
\n
\ndef read_online(entity: str, entity_id: str, options: checklist[str]) -> dict:
\n uncooked = r.hmget(f”{entity}:{entity_id}”, options)
\n return {f: json.masses(v) if v else None for f, v in zip(options, uncooked)}\n<\/div>\n
\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nlacking key -> {‘user_segment’: None}\n<\/div>\n
\u00a0<\/p>\n
The important thing form is entity:entity_id. The worth is a hash with one discipline per characteristic. A single HMGET returns all of the options we requested for in a single spherical journey. On an area Redis occasion with three options, this finishes in effectively underneath 1ms.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>4. Working the Materialization Pipeline<\/h4>\nMaterialization strikes values from offline to on-line. In an actual system this runs on a schedule (Airflow, cron, a streaming job). Right here it’s a operate.<\/p>\n
\ndef materialize(options: checklist[str]) -> None:
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:8a2f -> {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\n by_entity: dict[str, dict] = {}
\n for fname in options:
\n f = REGISTRY[fname]
\n src = f.supply.exchange(“‘”, “””)
\n df = duckdb.sql(f”””
\n SELECT {f.entity}, {fname}
\n FROM ‘{src}’
\n QUALIFY ROW_NUMBER() OVER (
\n PARTITION BY {f.entity}
\n ORDER BY event_timestamp DESC
\n ) = 1
\n “””).df()
\n for _, row in df.iterrows():
\n by_entity.setdefault(row[f.entity], {})[fname] = row[fname]
\n for entity_id, values in by_entity.gadgets():
\n write_online(“user_id”, entity_id, values)\n<\/div>\n
\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nuser_id:b13c -> {‘user_segment’: ‘informal’, ‘watch_count_30d’: 5, ‘last_genre’: ‘thriller’}\n<\/div>\n
\u00a0<\/p>\n
The QUALIFY clause retains the most recent row per entity. We group all options for a similar person into one Redis write to chop spherical journeys. Run this on the cadence every characteristic wants: hourly for watch_count_30d, near-real-time for last_genre, every day for user_segment. The registry is the correct place to encode that cadence in an actual implementation.<\/p>\n
\u00a0<\/p>\n
\/\/\u00a0<\/span>5. Exposing the FastAPI Retrieval Service<\/h4>\nThe retrieval service is the manufacturing floor. It’s what the LLM utility calls.<\/p>\n
\nf = resp.json()[“features”]
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nPOST \/get-online-features -> 200
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\nprint(“nPrompt the LLM would obtain:”)
\nprint(
\n f” System: You advocate exhibits for a streaming service.n”
\n f” Consumer context: phase={f[‘user_segment’]}, “
\n f”watched {f[‘watch_count_30d’]} titles in final 30 days, “
\n f”final style watched: {f[‘last_genre’]}.n”
\n f” Activity: counsel 3 titles in a pleasant, quick message.”
\n)\n<\/div>\n
\u00a0<\/p>\n
The total code might be discovered right here.<\/p>\n
If you run it, the output exhibits:<\/p>\n
\nphysique: {‘user_id’: ‘8a2f’, ‘options’: {‘user_segment’: ‘power_user’, ‘watch_count_30d’: 47, ‘last_genre’: ‘documentary’}}
\nImmediate the LLM would obtain:
\n System: You advocate exhibits for a streaming service.
\n Consumer context: phase=power_user, watched 47 titles in final 30 days, final style watched: documentary.
\n Activity: counsel 3 titles in a pleasant, quick message.\n<\/div>\n
\u00a0<\/p>\n
The characteristic retailer is the piece that turns “person 8a2f” right into a structured context the LLM can use.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>The place the Function Retailer Ends and the Vector Database Begins<\/h2>\n\u00a0A vector database (Pinecone, Weaviate, pgvector) shouldn’t be a characteristic retailer, despite the fact that each sit in entrance of a mannequin at inference. They clear up totally different retrieval issues.<\/p>\n
\u00a0\u00a0<\/p>\n
An actual LLM stack makes use of each. The vector database returns the three most related previous viewing periods. The characteristic retailer returns the person’s phase and up to date counts. The immediate combines them.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Widespread Anti-Patterns<\/h2>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\u00a0<\/p>\n\u00a0Just a few patterns that we hold seeing fail:<\/p>\n
Computing options contained in the mannequin service. The identical logic leads to the coaching pocket book and the API, and the 2 definitions drift inside 1 \/ 4.
\nTreating the web retailer because the supply of fact. Redis loses knowledge on a foul restart. The offline retailer is canonical; the web retailer is a cache.
\nSkipping the registry. Three groups independently outline active_user and the dashboards cease matching the mannequin.
\nCalling a vector database a characteristic retailer. It can’t do entity-keyed structured lookups, and a immediate that wants each will find yourself wired to 2 programs anyway.
\nBackfilling with out point-in-time joins. The coaching set seems to be nice, the manufacturing mannequin seems to be damaged, and the hole is the leakage.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Evaluating This to Feast, Tecton, and Databricks<\/h2>\n\u00a0Our ~200 strains do the identical job in miniature.<\/p>\n
\u00a0\u00a0<\/p>\n
Feast is the closest comparability if we wish to go additional on the identical sample, self-hosted. Tecton and Databricks are the managed paths and have specific LLM options (Tecton’s Function Retrieval API for LLMs, Databricks Function Serving for compound generative AI programs). Selecting between them is generally a query of how a lot we wish to function ourselves and whether or not the remainder of our stack already lives in Databricks.<\/p>\n
\u00a0<\/p>\n
#\u00a0<\/span>Conclusion<\/h2>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n
\u00a0<\/p>\n\u00a0A working characteristic retailer matches in 5 parts: a registry, an offline retailer, an internet retailer, a materialization step, and a retrieval API. Constructing it as soon as teaches us why the manufacturing programs look the best way they do. It additionally exhibits the place the design modifications for AI: the web retrieval path is the floor the LLM hits, point-in-time joins matter after we prepare or consider, and the vector database sits subsequent to the characteristic retailer, not inside it.<\/p>\n
As soon as we’ve got these items, swapping our minimal model for Feast, Tecton, or Databricks is generally a migration of the registry. The form of the system stays the identical.\u00a0\u00a0<\/p>\n
Nate Rosidi is an information scientist and in product technique. He is additionally an adjunct professor educating analytics, and is the founding father of StrataScratch, a platform serving to knowledge scientists put together for his or her interviews with actual interview questions from prime firms. Nate writes on the most recent developments within the profession market, offers interview recommendation, shares knowledge science tasks, and covers every thing SQL.<\/p>\n<\/p><\/div>\n