Redis leaderboard with Java and Jedis
Implement a Redis leaderboard in Java with Jedis and sorted sets
This guide shows you how to implement a Redis-backed leaderboard in Java with the Jedis client library. It uses a sorted set to store rank order, Redis hashes to store per-user metadata, and a small local web server so you can explore the leaderboard interactively in your browser.
Overview
Leaderboards are a classic Redis pattern. A sorted set stores each member together with a numeric score, and Redis maintains the ranking order automatically.
That gives you:
- Fast score updates for existing users
- Simple top
nleaderboard queries - Efficient queries for entries around a specific rank position
- Straightforward trimming to a fixed leaderboard size
- A clean separation between rank data and richer user metadata
In this example, the leaderboard score data is stored in a sorted set called leaderboard:demo, and each user's metadata is stored in a hash such as leaderboard:demo:user:player-17.
How it works
The flow looks like this:
- Store each user ID in a sorted set with their score
- Store per-user metadata in a separate Redis hash keyed by user ID
- Fetch the highest-ranked users with a reverse range query
- Fetch users around a given rank by calculating a rank window
- Trim the leaderboard after updates so only the top configured entries remain
Separating rank data from metadata keeps leaderboard operations efficient while still letting the application render richer profile details.
Installation
Add the Jedis dependency to your project:
-
If you use Maven:
<dependency> <groupId>redis.clients</groupId> <artifactId>jedis</artifactId> <version>5.2.0</version> </dependency> -
If you use Gradle:
implementation 'redis.clients:jedis:5.2.0'
The Java leaderboard
The RedisLeaderboard class wraps common leaderboard operations
(source):
import java.util.Map;
import redis.clients.jedis.JedisPool;
public class Main {
public static void main(String[] args) {
JedisPool jedisPool = new JedisPool("localhost", 6379);
RedisLeaderboard board = new RedisLeaderboard(
jedisPool,
"leaderboard:demo",
100
);
board.upsertUser(
"player-1",
1200,
Map.of(
"name", "Ada",
"description", "Solves production incidents before breakfast."
)
);
board.incrementScore("player-1", 25, Map.of());
System.out.println(board.getTop(5));
}
}
Data model
The implementation uses two Redis structures:
leaderboard:demo
player-1 => 1225
player-2 => 1180
player-3 => 1105
leaderboard:demo:user:player-1
name = Ada
description = Solves production incidents before breakfast.
The score data lives in the sorted set, while the user details live in hashes keyed by the same user ID.
The implementation uses:
ZADDto add or update leaderboard scoresZRANGEwith theREVoption to fetch the highest-ranked membersZREVRANKto find a user's rank from the topZREMRANGEBYRANKto trim the lowest-ranked overflow entriesHSETandHGETALLto store and load user metadataDELto remove metadata for trimmed or deleted users
Leaderboard implementation
The upsertUser() method writes the score, updates metadata, and then trims the board if it exceeds the configured limit:
public LeaderboardEntry upsertUser(
String userId,
double score,
Map<String, String> metadata
) {
Map<String, String> payload = coerceMetadata(metadata);
try (Jedis jedis = jedisPool.getResource()) {
Transaction tx = jedis.multi();
tx.zadd(key, score, userId);
if (!payload.isEmpty()) {
tx.hset(metadataKey(userId), payload);
}
tx.exec();
}
List<String> trimmedUserIds = trimToMaxEntries();
LeaderboardEntry entry = getUserEntry(userId);
if (entry != null) {
entry = entry.withTrimmedUserIds(trimmedUserIds);
}
return entry;
}
To fetch users around a rank, the implementation converts the requested rank and count into a reverse range window:
public List<LeaderboardEntry> getAroundRank(int rank, int count) {
int normalizedRank = normalizePositiveInt(rank, "rank");
int normalizedCount = normalizePositiveInt(count, "count");
long totalEntries = getSize();
if (totalEntries <= normalizedCount) {
return listAll();
}
int halfWindow = normalizedCount / 2;
int start = Math.max(0, normalizedRank - 1 - halfWindow);
int maxStart = (int) totalEntries - normalizedCount;
if (start > maxStart) {
start = maxStart;
}
int end = start + normalizedCount - 1;
try (Jedis jedis = jedisPool.getResource()) {
Set<Tuple> entries = jedis.zrangeWithScores(
key,
ZRangeParams.zrangeParams(start, end).rev()
);
return hydrateEntries(entries, start + 1);
}
}
Jedis operations are synchronous and thread-safe when you use JedisPool, which manages a pool of connections internally.
Metadata design
The leaderboard stores only user IDs and scores in the sorted set. Richer details stay in a separate per-user hash. That means the same user ID can be ranked efficiently while still exposing extra fields such as:
- Display name
- Short description
- Team or country
- Avatar URL
- Other lightweight profile fields
This is a useful pattern when the ranking view and the profile view need different data shapes.
Running the demo
A local demo server is included to show the leaderboard in action (source):
# Compile
javac -cp jedis-5.2.0.jar RedisLeaderboard.java DemoServer.java
# Run the demo server
java -cp .:jedis-5.2.0.jar DemoServer
The demo provides an interactive web interface where you can:
- Add or update a player score and metadata
- Increase a player's score incrementally
- View the top
nplayers on the leaderboard - View the
nplayers around a chosen rank - Change the maximum number of entries the leaderboard keeps
- Reset the demo dataset to a known starting state
The demo assumes Redis is running on localhost:6379 but you can specify a different host and port using the --redis-host HOST and --redis-port PORT command-line arguments. Visit http://localhost:8080 in your browser to try it out.
Production usage
This guide uses a deliberately small local demo so you can focus on the Redis leaderboard pattern. In production, you will usually want to add more validation, tighter concurrency control, and application-specific lifecycle rules.
Decide how ties should behave
Redis sorted sets order primarily by score. When two members have the same score, Redis uses the member value as a secondary ordering rule. If your application needs a different tie-breaker, you may want to encode it in the score or store additional state.
Consider how you expire or archive old data
Some leaderboards are permanent, while others reset daily, weekly, or seasonally. Depending on your use case, you may want to:
- Namespace keys by season or event
- Snapshot historical results elsewhere
- Rebuild the current leaderboard from upstream data
Keep metadata lightweight
Per-user hashes work best for small, frequently accessed profile details. Large profile documents or rarely used attributes are often better kept in another store, with Redis holding only the fields needed to render the leaderboard quickly.