Bedrock – Rock-solid distributed data
bedrockdb.com
Bedrock – Rock-solid distributed data
1–10 of 110 posts
Re: Bedrock – Rock-solid distributed data
#2- Faster? Provide a benchmark. Faster is a relative thing, faster than what? faster under which conditions?
- More reliable... than what? under which conditions? how do you know it is more reliable?
- More powerful? I thought SQLite is more constrained than other SQL databases. e.g: No stored procedures. Powerful? how? compared to exactly what?
Nullius in verba. I don't take your statements as granted, give me a proof, otherwise it's just flatus vocis.
Re: Bedrock – Rock-solid distributed data
#3When shouldn't people use Bedrock? https://sqlite.org/whentouse.html is a wonderful page - full of discouragement to would-be SQlite users to know when they're in a use-case better served by some other tool.
Re: Bedrock – Rock-solid distributed data
#4Edit: Turns out it's authored by the CEO! So you'd have to be nuts to use it, period. But, um, poke the source if you're curious. This is a good intro https://github.com/Expensify/Bedrock/tree/master/libstuff#li... I can't imagine a more ironic and hilarious backdrop for the "We Fire People" campaign. Must be tough finding people who can keep up with a brain that big.
Re: Bedrock – Rock-solid distributed data
#5Really looking forward to playing with this. Cool stuff.
Re: Bedrock – Rock-solid distributed data
#6Where do you make your CAP Theorem tradeoffs? When shouldn't people use Bedrock? https://sqlite.org/whentouse.html is a wonderful page - full of discouragement to would-be SQlite users to know when they're in a use-case better served by some other tool.
As for the CAP theorem, we compromise on "C". Each slave responds based on its current state, which might be a different state than other slaves or the master. However, every response returns the "commitCount" of the database at the time the response was generated. Then when you submit a new request, you can specify that commitCount and the slave will wait until it is at least as recent as that.
This way you can safely act upon the response of one request, and then make a second request to another.
Re: Bedrock – Rock-solid distributed data
#7I don't want to be a jerk but... just for the sake of common sense: - Faster? Provide a benchmark. Faster is a relative thing, faster than what? faster under which conditions? - More reliable... than what? under which conditions? how do you know it is more reliable? - More powerful? I thought SQLite is more constrained than other SQL databases. e.g: No stored procedures. Powerful? how? compared to exactly what? Nulli…
Re: Bedrock – Rock-solid distributed data
#8For all the emphasis put on multi-datacenter replication, it would be awesome to see it documented! Really looking forward to playing with this. Cool stuff.
But yes, lots more details to add over time. Thanks for asking!
Re: Bedrock – Rock-solid distributed data
#9Where do you make your CAP Theorem tradeoffs? When shouldn't people use Bedrock? https://sqlite.org/whentouse.html is a wonderful page - full of discouragement to would-be SQlite users to know when they're in a use-case better served by some other tool.
Heh, yep, we definitely had that sent to us. The point of Bedrock is to resolve those points and make SQLite usable in the enterprise. As for the CAP theorem, we compromise on "C". Each slave responds based on its current state, which might be a different state than other slaves or the master. However, every response returns the "commitCount" of the database at the time the response was generated. Then when you submi…
Re: Bedrock – Rock-solid distributed data
#10Look. Just about anyone can create some "database" and declare it "rock-solid". Frankly, a simple key-value store is built in most languages.
Do you have more than that? Do you have benchmarks? You know, competing against the other providers?