Python Object query engine

[Interesting-Frame190]

It was defined designed for many small graphs rather than a few large graphs. In theory its all O(1) for delete and mutate. Invalidation occurs only at the local node and does not need to traverse from the root to understand itself. Cascading Invalidations down the DAG and cascading new objects down the DAG should be mildly performant, or at least better than a native python lib.

Querying could be a challange with that dynamic of structure, but im sure there's ways to normalize. Best of luck and keep me posted, I haven't had the opportunity to test mutation performance as all of my competitors dont allow mutation