Multiple Google engineers have emphasized that Com...

# compose

[CLOVIS]

Multiple Google engineers have emphasized that Compose (not UI) is designed to handle arbitrary mutable trees of data. I have a project (currently in the “research of feasibility” stage) that would require high-performance multi-threaded tree editions; is there someone knowledgeable to discuss this?

[CLOVIS]

The two main things this project brings that are making me wonder if Compose corresponds to it

• it is very important that walking down the tree (finding a specific node by starting at the root and recursively selecting the best child) is as fast as possible,

• the total size of the tree is ~1e18 nodes (which obviously won't fit in RAM no matter the technology) so the tree must be able to dynamically load new nodes / unload old nodes (= the shape can change a lot)

[Kirill Grouchnikov]

Sounds like a search engine that holds a copy of the entire internet and needs to return results for arbitrary queries in under 100ms 😁

[Alexandre Elias [G]]

it doesn't sound like the appropriate technology for this. Generally speaking, the problem that Compose's core technology solves is minimal, automatic and guaranteed-correct partial regeneration of the output tree based on changes to the model.

[Alexandre Elias [G]]

in other words, it's a new approach to the Model/View problem which most commonly comes up in GUI, but in some cases could come up in structurally similar things. I usually imagine other user interaction modalities (audio, commandline...)

[Alexandre Elias [G]]

the requirements you're raising sound more like you should be researching filesystems and distributed computing instead

[CLOVIS]

Thanks a lot!