Data Structure
Table of Contents
1. Stream
1.1. 0x2250
- exploring consensus algorithms, some relevant structures
- Merkle Tree (also used in Version Control)
- SS Table
- Bloom Filter
1.2. 0x21B6
- initializing the first dedicated population phase
- need a stable base for all specializations
- will be proceeding in python
- accompanied by a parallel phase for Algorithms
1.3. 0x21B3
- checkout Serialization
- the right approach persistence does affect and applications health
1.4. 0x21B1
- Doing a quick overview of data storage methodologies
1.5. 0x211A
A way of representing data in memory: The most primitive notion of a data structure arises from the ability to glue objects together according to one's preferred semantics, the variation in which gives rise to all the representations that can exist.
This glue can be at a physical level (adjacent registers) or be achieved with several levels of indirection (pointers)
Closely related to a data structure, is its behavior under various operations (insert, delete, search,…). It is an abstraction of data that is exposed by these behaviors allowing one to manipulate it.
1.5.1. Mutability
This affects how one implements the said representation and the details of the abstraction (generation/return of references, copies, etc).