Search icon
Subscription
0
Cart icon
Close icon
You have no products in your basket yet
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Redis Stack for Application Modernization

You're reading from  Redis Stack for Application Modernization

Product type Book
Published in Dec 2023
Publisher Packt
ISBN-13 9781837638185
Pages 336 pages
Edition 1st Edition
Languages
Authors (2):
Luigi Fugaro Luigi Fugaro
Profile icon Luigi Fugaro
Mirko Ortensi Mirko Ortensi
Profile icon Mirko Ortensi
View More author details

Table of Contents (18) Chapters

Preface 1. Part 1: Introduction to Redis Stack
2. Chapter 1: Introducing Redis Stack 3. Chapter 2: Developing Modern Use Cases with Redis Stack 4. Chapter 3: Getting Started with Redis Stack 5. Chapter 4: Setting Up Client Libraries 6. Part 2: Data Modeling
7. Chapter 5: Redis Stack as a Document Store 8. Chapter 6: Redis Stack as a Vector Database 9. Chapter 7: Redis Stack as a Time Series Database 10. Chapter 8: Understanding Probabilistic Data Structures 11. Part 3: From Development to Production
12. Chapter 9: The Programmability of Redis Stack 13. Chapter 10: RedisInsight – the Data Management GUI 14. Chapter 11: Using Redis Stack as a Primary Database 15. Chapter 12: Managing Development and Production Environments 16. Index 17. Other Books You May Enjoy

Top-K

The Top-K data structure is used to keep track of items with the highest rank, such as the top players in a leaderboard. The ranking, or score, is often based on the count of how many times an item appears in the data source (such as a stream), making the data structure ideal for identifying elements with the highest frequency. Among the most common use cases of this data structure are leaderboards, trending entities in a system, detecting network anomalies, and DDoS attacks. Here, the Top-K data structure can help answer questions such as “Which top addresses or IPs have the highest surge in the flow of requests?”

Let’s dive into an example of using the Top-K data structure and insert a few items into it. First, we must initialize it using the following command:

TOPK.RESERVE key topk [width depth decay]

In addition to key, which specifies the Top-K name, topk indicates the number of top items we want to keep track of, and width indicates the number...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime}