Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning Redis

You're reading from   Learning Redis Design efficient web and business solutions with Redis

Arrow left icon
Product type Paperback
Published in Jun 2015
Publisher
ISBN-13 9781783980123
Length 318 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Vinoo Das Vinoo Das
Author Profile Icon Vinoo Das
Vinoo Das
Arrow right icon
View More author details
Toc

Maintaining nonephemeral data


Nonephemeral type of data is not dependent on time and has usefulness throughout its existence in the system. Since this kind of data is time-independent, it is possible that the data can increase in due course of time. This can be problematic in Redis since data is stored in memory in Redis. Handling and maintaining this nonephemeral data is crucial for the maintenance of Redis since at the back of our minds, we have to keep the available memory and availability of data in mind.

Redis comes with some capabilities to handle the previously discussed scenarios, which is if the datastore grows at an alarming rate, as it can outgrow the memory available. In such scenarios, adding more RAM can solve the issue, or we can distribute the datasets using a programmatic technique called Sharding. However, in this chapter, we will discuss a mechanism to maintain data that is not required in an active application but needs to be stored.

Let's see a few in-built techniques...

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 €18.99/month. Cancel anytime