Learn Before
Case Study

Applying Key-Value Structure to a Retrieval System

Imagine you are designing a simple recipe retrieval system. The system's memory is structured as a collection of pairs, {(K, V)}, where each pair represents one recipe. When a user enters a query like 'spicy chicken pasta', the system compares the query to each K to find relevant recipes and then returns the corresponding V for the best matches. In this scenario, what would be the most logical choice for the content of K and the content of V?

0

1

Updated 2025-10-04

Contributors are:

Who are from:

Tags

Ch.2 Generative Models - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Application in Bloom's Taxonomy

Cognitive Psychology

Psychology

Social Science

Empirical Science

Science