Is there a good technical read on state maintenance in large graph databases? I’m now getting curious about actual basic CS problems here. Like NP completeness and phase transition type results providing tighter bounds on CAP theorem type limits?
-
-
Ooh i like this take
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.