Patrick Reilly - Ignite OSCON 2014
summary
Claims a graph database named Orly Databse that uses an eventual concurrency model: each client keeps a private point of view and the system reconciles views behind the scenes, allegedly with typical merge lag around two milliseconds. Implementation is in C++14 with a Python-like server scripting language that compiles and runs the same on a Vagrant VM or the sharded “irma gerd” backend. Benchmarks claim 3x faster than MySQL, and it can double as a tuple store replacement for memcache.
AI-written summary · about
related talks
38mAn Ode to 17 Databases in 33 Minutes
35mAn Ode to 17 Databases in 39 minutes
29mThe Design and Evolution of Event-Driven Databases
04h 15mTopical Edition on Databases - Track 2
32mData @Scale Seattle- Eric Hwang introduced by Ganapathy Krishnamoorthy
29mModern Database Architecture: From SQL to NoSQL & Distributed SQL
43mJust Use Postgres.
13mNext-generation databases for next-generation workloads (PRT051)