World Wide Webber
World Wide Webber
About
Talks
Books
Blog
Professional Experience
Publications
Social Media
Light
Dark
Automatic
Consistency
Strong Consitency Claims in Distributed Graph Databases
Thoughts on the design of distributed graph databases that use strongly consistent methods for the data stored on their shards, but pay no regard to ordering of concurrent updates.
Cite
×