voidmain

28 ms·

361.
by voidmain 13y ago
FoundationDB ( https://foundationdb.com ) provides optimistic transactions-- the client does reads from a consistent snapshot, and then tells the database what it wants to write and what serializable reads it did, and the database
362.
by voidmain 13y ago
I agree. At FoundationDB, we're writing a coordination tool (working name "beastmaster") that provides service discovery, locking, leader election, etc on top of our transactional key/value store. It is higher level th
363.
by voidmain 13y ago
I'm the author of the post, if anyone has any questions (or corrections :-)
364.
7 Things That Make Google F1 and FoundationDB SQL Layer So Strikingly Similar(blog.foundationdb.com)
4 points by voidmain 13y ago|0 comments
365.
by voidmain 13y ago
A database is going to do a query like that in one of two ways: scan over (all of|a column family of) the data, or look in some kind of index on "someproperty". In our approach this kind of functionality is the responsibility of a higher "l
366.
by voidmain 13y ago
Quicksand (the physical fault testing environment) doesn't find our bugs because our simulation-based testing finds them first! Our deterministic simulations cover all of the failure cases that quicksand can test and many more. The main re
367.
by voidmain 13y ago
I love that someone is actually testing database fault tolerance in public, instead of just assuming that anything with replication is fault tolerant... Stateful distributed systems are really, really hard to get right. The only hope is
368.
by voidmain 14y ago
Random, uncached reads on the same dataset as the 90/10 - 1.6M/sec, limited by SSD throughput. Cached reads (from the same dataset, with a different distribution of read keys) you can see on our website at 3.2 M/sec. I should mention that
369.
by voidmain 14y ago
You are right. Our API is strong enough that you could implement a SQL database on top of it efficiently. I have done it (using sqlite4 as the front end) as a proof of concept.
370.
by voidmain 14y ago
I was nervous writing that sentence, because it's hard to be sure of the truth of any claim to be 'first'! But none of the examples you mention, to my knowledge, provide multi-key ACID transactions. A compare and set facility for an ind
371.
by voidmain 14y ago
The conflict resolution service assigns a global ordering to transactions as well as pass/fail. Transactions that fail don't do any writes. Transactions that pass still aren't durable, they could be rolled back by a subsequent failure unt
372.
by voidmain 14y ago
We require a quorum over coordination servers to stay up. For example, if you only have two datacenters with actual DB servers, a third coordination server out in the cloud somewhere can act as a tiebreaker (it will be lightly loaded). The
373.
by voidmain 14y ago
I can only speculate, because I have never used datomic. Like FoundationDB, datomic does appear to separate transaction processing from storage. A few relevant differences: - Datomic provides transaction isolation through stored procedures
374.
by voidmain 14y ago
FoundationDB co-founder here. I'll try to address your questions. This isn't a complete explanation of how our system works! Most people trying to solve this problem have approached it by trying to take multiple machines, each capable of p
375.
by voidmain 14y ago
FoundationDB co-founder here. As other posters have already guessed, we don't support long-running transactions (we only keep multi-version information for a short time). So if you keep a transaction open for a long time it will not commit
376.
by voidmain 14y ago
FoundationDB co-founder here. As any ACID database must, we choose Consistency over Availability in the CAP theorem sense. This means that when a datacenter is disconnected or poorly connected to the internet, the database is not available
377.
by voidmain 15y ago
Here's my attempt (requires WebGL, realistically only works in Chrome): http://www.glowscript.org/#/user/David/folder/Public/program...
378.
by voidmain 15y ago
It appears to have no indirect load or store instruction. I don't think it's Turing complete!
379.
by voidmain 15y ago
Why are you horrified by the idea that someone might suffer from their own mistakes, but not by the idea that they might suffer from the mistakes of others?
380.
by voidmain 15y ago
I have co-founded one successful company and am a co-founder in a current startup. I do think explicitly about tax effects when making business decisions, and there are definitely tax rates that would have changed my decisions, particularl
381.
by voidmain 16y ago
I'm not an expert in this area, but since homomorphic encryption exists (though is still impractical) and obfuscators do not exist ( http://www.iacr.org/archive/crypto2001/21390001.pdf ), it follows that the former can't be used to construc
382.
by voidmain 16y ago
I don't think the pressure _can_ be removed. Nothing in the article says this "material" is stable at ordinary pressures. They're just saying that the chemical structure changes as it is squeezed into a smaller and smaller space. If you
383.
by voidmain 16y ago
It's a spring. You put in mechanical energy, you get back mechanical energy and heat. The engineering challenge, I think, is making something that can compress a useful quantity of the stuff.
384.
by voidmain 16y ago
Sadly, what Corey did was probably illegal: http://www.nytimes.com/2010/04/03/business/03intern.html
385.
by voidmain 17y ago
I think the idea of one company controlling what people may do with computers is pretty horrible. I hope this doesn't happen, and would rather develop or invest in something that could make the iPad fail than something complementary to it.
386.
by voidmain 17y ago
I'm sure the cost of entry for medical insurance (and pretty much every highly regulated industry) is dominated by costs imposed by regulation.
387.
by voidmain 17y ago
Very bad idea. For every person in the world who need not pay U.S. taxes -- which would be everyone in your system -- there is a simple way to avoid this "tax": not holding dollars. The value of the dollar would collapse instantly. This s
388.
by voidmain 17y ago
If you could lower cost-to-orbit by a factor of a hundred, you wouldn't need a NASA prize to make money! Prizes can be a good idea, but not for things so spectacularly easy to monetize.
389.
by voidmain 17y ago
Actually, it's worse than that. Time machine's "snapshots" aren't snapshots - they don't represent a point in time at all. A time machine backup can complete and nevertheless be unrestorable. On filesystems that support snapshots - inclu
390.
by voidmain 17y ago
Publish at least some of them, so others can at least evaluate whether you have _good_ ideas. You are never going to find anyone who will "buy" business ideas. All the people saying that execution is what matters are right. But the _abili

More ›