diff options
| author | Eduardo Julian | 2021-08-19 04:59:06 -0400 |
|---|---|---|
| committer | Eduardo Julian | 2021-08-19 04:59:06 -0400 |
| commit | d772fe99d5d4990c6774481fb64d12280cdb6aae (patch) | |
| tree | 209a2ce3b8e896be15db40bc58db830a5304b4f9 /documentation/bookmark/database.md | |
| parent | e00ba096c8837abe85d366e0c1293c09dbe84d81 (diff) | |
Enabled compile-time code evaluation (i.e. "eval" function).
Diffstat (limited to 'documentation/bookmark/database.md')
| -rw-r--r-- | documentation/bookmark/database.md | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/documentation/bookmark/database.md b/documentation/bookmark/database.md index 3ef227087..0e27f89cf 100644 --- a/documentation/bookmark/database.md +++ b/documentation/bookmark/database.md @@ -90,6 +90,8 @@ # Storage +1. [Database Internals: A deep-dive into how distributed data systems work](https://www.oreilly.com/library/view/database-internals/9781492040330/) +1. [B-Trees: More Than I Thought I'd Want to Know](https://benjamincongdon.me/blog/2021/08/17/B-Trees-More-Than-I-Thought-Id-Want-to-Know/) 1. [Understanding LSM Trees: What Powers Write-Heavy Databases](https://yetanotherdevblog.com/lsm/) 1. http://www.benstopford.com/2015/02/14/log-structured-merge-trees/ 1. A Comparison of Adaptive Radix Trees and Hash Tables |