Conversation

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?
2
8
Replying to
It tells me they're unlikely to be resolved in any plannable timeframe, and are unlikely to reward algorithmic optimization that doesn't change the shape of the problem. You're not going to prove P = NP while hacking on your graph db.