Joe Hellerstein

Clean up in-out tree chapter (replace hand-drawn graphs with mermaid)

2

Get figures into mermaid to align with rest of book.

E.g. I only want to send the most recent result of a fold when I receive a message, not all values of the fold. ``` items = source_iter(itemsrc) -> fold(||...

Graduate class project ideas

2

- [ ] Build out the “stdlib” of importable distributed protocol implementations in Hydroflow(+). Some things are simple (heartbeats, retries/acks), some are very complex (Paxos variants, BFT variants, etc). See...

Hackathon: Examples of common distributed design patterns

4

For now these should go in examples or the book. Eventually these should be in libraries of importable modules. Local wall-clocks, etc - [ ] heartbeats - [ ] timers/timeout...

Performance testing for mapping into/out of joins

4

Is there an expense to the mapping once the compiler has done its magic, relative to tuples that "happen to be" set up right and don't need maps? Would a...

feat: Feature/ght

1

WIP on Generalized Hash Trie

Generalized Hash Trie

2

A data structure used in optimal joins, as described in the [Wang/Willsey/Suciu paper on Freejoin](https://arxiv.org/abs/2301.10841)

Going to implement algorithms from [Wang/Willsey's Freejoin paper](), and extend to binary optimal joins along the lines of [Olteanu's factorized research](). Breaking it down: - [x] Generalized Hash Trie data...

extended semantics for `defer_signal`

1

Based on #966 Two independent considerations here: - Do we empty the buffer on new `input`? - Do we empty the buffer on new `signal`? The current implementation is `{input:...

As an example it should use the higher-level IR.