โครงสร้างข้อมูลของรีดิสสำหรับแคช

Redis isn't just a simple key-value store! It offers a variety of powerful data structures, each optimized for different types of data and caching scenarios.

Understanding these structures is key to designing efficient and flexible caching solutions. You'll learn when to use strings, hashes, and sorted sets to store your application's data.

The simplest Redis data type is a String. It's perfect for caching basic key-value pairs, like a user's session token, a page's HTML content, or a simple counter.

Think of it as a dictionary where keys map directly to a single value. It's fast and straightforward for common caching needs.

• SET key value: Stores a string value.
• GET key: Retrieves a string value.
• DEL key: Removes a key and its value.

Here's how you might cache a user's last login timestamp using a Redis string. Run this code to see it in action!

When you need to cache structured data, like an entire user profile or product details, Hashes are ideal. They let you store multiple field-value pairs under a single key.

This is more efficient than using separate string keys for each attribute of an object, as it groups related data logically together.

• HSET key field value [field value ...]: Sets multiple fields and values in a hash.
• HGETALL key: Retrieves all fields and values from a hash.
• HGET key field: Retrieves a specific field's value.

Let's cache details for a product, like its name, price, and stock count. Run this code to see how hashes store structured data.

Sorted Sets are unique because each member has an associated score, allowing Redis to keep the elements sorted. This is perfect for caching leaderboards, recently viewed items (by timestamp), or items ranked by popularity.

They combine the uniqueness of Sets with the ability to order elements. You can retrieve ranges of items by score or rank.

• ZADD key score member [score member ...]: Adds members with scores.
• ZRANGE key start stop [WITHSCORES]: Retrieves members by index (rank).
• ZRANGEBYSCORE key min max [WITHSCORES]: Retrieves members by score range.

Imagine caching a game's top scores. Sorted sets make this easy! The 'score' for each member determines its rank. Run the example.

For any cached data, setting an expiration time (Time To Live - TTL) is crucial. This prevents stale data and manages memory usage.

Redis automatically removes keys once their TTL expires, ensuring your cache stays fresh and doesn't grow indefinitely.

• EXPIRE key seconds: Sets a TTL for an existing key.
• SETEX key seconds value: Sets a key with a value and a TTL in one command.
• TTL key: Checks remaining TTL.

Choosing the right data structure depends on your caching needs:

• Strings: For simple, atomic key-value pairs (e.g., individual values, counters, rendered HTML snippets).
• Hashes: For caching entire objects or records with multiple fields (e.g., user profiles, product attributes).
• Sorted Sets: For ordered lists, rankings, leaderboards, or time-series data where elements need scores for sorting.

Always consider how you'll access and manage the data.

You need to cache the following two types of data for a social media application:

1. The current number of likes on a specific post.
2. A list of the 10 most recent comments on that post, ordered by timestamp.

Which Redis data structures would be most appropriate for each, respectively?

Great job! You've explored the core Redis data structures and their applications in caching:

• Strings for simple key-value pairs.
• Hashes for structured objects.
• Sorted Sets for ordered, scored lists.

You also learned the importance of TTL for managing cache freshness.

In the next lesson, we'll dive into basic Redis cache operations, putting these structures to practical use!