Join 📚 Kevin's Highlights

A batch of the best highlights from what Kevin's read, .

![](https://userimg-assets.customeriomail.com/images/client-env-99697/1684906032769_4%20theme%20days_01H163KFWVTVD5ZC5XKBRGZMVZ.png)

The Meditations Newsletter #030

Alex from Sunsama

[![e](https://dezyre.gumlet.io/images/blog/real-world-data-engineering-projects-/Data_Engineering_Project_Structure.png?w=700&dpr=1.3%20%22Data%20Engineering%20Project%20Structure%22)](https://dezyre.gumlet.io/images/blog/real-world-data-engineering-projects-/Data_Engineering_Project_Structure.png?w=700&dpr=1.3%20%22Data%20Engineering%20Project%20Structure%22)

Data Engineering Projects for Beginners

ProjectPro

In [theoretical computer science](https://en.wikipedia.org/wiki/Theoretical_computer_science), the **CAP theorem**, also named **Brewer's theorem** after computer scientist [Eric Brewer](https://en.wikipedia.org/wiki/Eric_Brewer_(scientist)), states that any [distributed data store](https://en.wikipedia.org/wiki/Distributed_data_store) can provide only [two of the following three](https://en.wikipedia.org/wiki/Trilemma) guarantees: [Consistency](https://en.wikipedia.org/wiki/Consistency_model) Every read receives the most recent write or an error. [Availability](https://en.wikipedia.org/wiki/Availability) Every request receives a (non-error) response, without the guarantee that it contains the most recent write. [Partition tolerance](https://en.wikipedia.org/wiki/Network_partitioning) The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes.

CAP theorem

wikipedia.org

...catch up on these, and many more highlights