3 ms·
As I understand it (I might be wrong) this engine basically automates DB partitioning by creating distributed nodes. By donig this it scales without having to d
by mastazi 11y ago
As I understand it (I might be wrong) this engine basically automates DB partitioning by creating distributed nodes. By donig this it scales without having to deal with replication, but at the same time it is still fully relational. I'm not sure whether it allows ACID transactions. I'm also curious about how it could be evaluated against the CAP theorem. Interesting.
- mtanski 11y agoPretty much all these distributed databases at their core somehow handle the partitioning of data. Even if sometimes it's just throwing up your hands and saying there's a user has to provide us a partitioning function. That's true in non-relational databases (Hbase, Casandra, Mongo) and in relational ones (Volt, Vetica, this db). It looks like here the data structure enabling partitioning is based on prior art distributed B+ Tree. From the paper it looks like it allows for full ACID transactions. At least to the physical extents that ACID is possible.