notes

commit e19a06a8fe24bf4199195180d2a84bc6df04db2d
parent 892a36c5647d8be6cf5f6663a4bbfe4067c6c88b
Author: Andrew Laack <andrew@laack.co>
Date:   Fri,  5 Sep 2025 14:23:21 -0700

DDIA notes

Diffstat:
M
latex/designing/DesigningDataIntensiveApplications.tex
 | 
17
++++++++++++-----

1 file changed, 12 insertions(+), 5 deletions(-)
diff --git a/latex/designing/DesigningDataIntensiveApplications.tex b/latex/designing/DesigningDataIntensiveApplications.tex
@@ -170,13 +170,20 @@ As we see, this is a directed graph and each object (edges and vertices) contain
 
 The triple-store model, as implemented by Datomic, AllegroGraph, and others, 
 
-\subsection{Graph Query Languages}
+\section{Storage and Retrieval}
 
-\subsubsection{Cypher}
-\subsubsection{SPARQL}
-\subsubsection{Datalog}
+\subsection{Compaction}
+
+Compaction is an approach often used by log-based DBs to condense the information contained in logs without losing any information by removing stale writes/updates.
+
+\subsection{Hash Indexing}
+
+A simple hash indexing key-value store, implemented with logging and in memory keys, using compaction, is the data storage approach used by Riak. This approach allows fast seeks, but can have costly startups as the in memory hashtable must be rebuilt (unless it is written to disk which Riak does).
+
+\section{SSTables}
+
+Sorted String Tables (SSTables) are logs that require sequential keys be sorted.
 
-\section{Storage and Retrieval}
 \section{Encoding and Evolution}
 \section{Replication}
 \section{Partitioning}