diff --git a/caching/README.md b/caching/README.md
index 6432ffcea..b48d060f0 100644
--- a/caching/README.md
+++ b/caching/README.md
@@ -27,3 +27,4 @@ Use the Caching pattern(s) when
* [Write-through, write-around, write-back: Cache explained](http://www.computerweekly.com/feature/Write-through-write-around-write-back-Cache-explained)
* [Read-Through, Write-Through, Write-Behind, and Refresh-Ahead Caching](https://docs.oracle.com/cd/E15357_01/coh.360/e15723/cache_rtwtwbra.htm#COHDG5177)
+* [Cache-Aside](https://msdn.microsoft.com/en-us/library/dn589799.aspx)
diff --git a/caching/etc/caching.png b/caching/etc/caching.png
index 6b3b2d055..b6ed703ab 100644
Binary files a/caching/etc/caching.png and b/caching/etc/caching.png differ
diff --git a/caching/etc/caching.ucls b/caching/etc/caching.ucls
index 815a62ec9..a058277ea 100644
--- a/caching/etc/caching.ucls
+++ b/caching/etc/caching.ucls
@@ -1,106 +1,90 @@
-write-through
which writes data to the cache and DB in a single transaction,
- * write-around
which writes data immediately into the DB instead of the cache, and
+ * write-around
which writes data immediately into the DB instead of the cache,
* write-behind
which writes data into the cache initially whilst the data is only
- * written into the DB when the cache is full. The read-through
strategy is also
- * included in the mentioned three strategies -- returns data from the cache to the caller if
- * it exists else queries from DB and stores it into the cache for future use. These
- * strategies determine when the data in the cache should be written back to the backing store (i.e.
- * Database) and help keep both data sources synchronized/up-to-date. This pattern can improve
- * performance and also helps to maintain consistency between data held in the cache and the data in
- * the underlying data store.
+ * written into the DB when the cache is full, and cache-aside
which pushes the
+ * responsibility of keeping the data synchronized in both data sources to the application itself.
+ * The read-through
strategy is also included in the mentioned four strategies --
+ * returns data from the cache to the caller if it exists else queries from DB and
+ * stores it into the cache for future use. These strategies determine when the data in the cache
+ * should be written back to the backing store (i.e. Database) and help keep both data sources
+ * synchronized/up-to-date. This pattern can improve performance and also helps to maintain
+ * consistency between data held in the cache and the data in the underlying data store.
*
* In this example, the user account ({@link UserAccount}) entity is used as the underlying
* application data. The cache itself is implemented as an internal (Java) data structure. It adopts
- * a Least-Recently-Used (LRU) strategy for evicting data from itself when its full. The three
+ * a Least-Recently-Used (LRU) strategy for evicting data from itself when its full. The four
* strategies are individually tested. The testing of the cache is restricted towards saving and
* querying of user accounts from the underlying data store ( {@link DbManager}). The main class (
* {@link App} is not aware of the underlying mechanics of the application (i.e. save and query) and
diff --git a/caching/src/main/java/com/iluwatar/caching/CachingPolicy.java b/caching/src/main/java/com/iluwatar/caching/CachingPolicy.java
index 0c907fe88..5ad32f699 100644
--- a/caching/src/main/java/com/iluwatar/caching/CachingPolicy.java
+++ b/caching/src/main/java/com/iluwatar/caching/CachingPolicy.java
@@ -24,7 +24,7 @@ package com.iluwatar.caching;
/**
*
- * Enum class containing the three caching strategies implemented in the pattern.
+ * Enum class containing the four caching strategies implemented in the pattern.
*
*/
public enum CachingPolicy {
diff --git a/caching/src/main/java/com/iluwatar/caching/LruCache.java b/caching/src/main/java/com/iluwatar/caching/LruCache.java
index 4527b5548..00e27ccf1 100644
--- a/caching/src/main/java/com/iluwatar/caching/LruCache.java
+++ b/caching/src/main/java/com/iluwatar/caching/LruCache.java
@@ -73,7 +73,6 @@ public class LruCache {
}
/**
- *
* Remove node from linked list.
*/
public void remove(Node node) {
@@ -90,7 +89,6 @@ public class LruCache {
}
/**
- *
* Move node to the front of the list.
*/
public void setHead(Node node) {
@@ -161,7 +159,6 @@ public class LruCache {
}
/**
- *
* Returns cache data in list form.
*/
public List