Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
leef
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
91.
▲
by
leef
15y ago
While superb logistics are not unique to Amazon it is just one factor that combined with other mostly non-unique factors creates a very unique and hard to duplicate advantage: 1) The marketplace - Amazon's website are massive marketplaces w
92.
▲
Microsoft Told They Can’t Use Bacon Cart To Lure Amazon Employees
(inquisitr.com)
2 points
by
leef
15y ago
|
0 comments
93.
▲
by
leef
15y ago
Our in-house solution uses InnoDB (via MySQL even, not directly) and find it to be much more stable and performant than BDB for a number of key/value workloads.
94.
▲
by
leef
15y ago
No it's not a successor to BDB. According to http://www.oracle.com/technetwork/database/nosqldb/learnmore... it's based on BDB-JE High Availability (HA). BDB-JE HA is a separate product that has been around for awhile. Basically it's a
95.
▲
by
leef
15y ago
The data is not unstructured, though. It is in JSON format which can be taken advantage of.
96.
▲
by
leef
15y ago
The problem with zookeeper is there is no safe way to dynamically change the nodes in the cluster. That's where Paxos comes in since it is provably correct even with nodes joining and leaving.
97.
▲
by
leef
15y ago
Right, I was talking about the quorum semantics as used by systems like Dynamo and Cassandra. Paxos provides a much stronger guarantee than simple quorums.
98.
▲
by
leef
15y ago
You actually cannot implement strongly consistent compare-and-set on a quorum based system. This is because quorums do not have strong failure semantics. For example, lets say you have key A with data 'foo' living on all 3 nodes of a quoru
99.
▲
by
leef
15y ago
The paper doesn't say so I am making some assumptions here but if you had a bloom filter per array then as these doubling arrays get really big all the bloom filter would tell you is that the target entry is probably contained in this giant
100.
▲
by
leef
15y ago
Thanks. The paper mentioned an open-source project for this. Does that exist yet?
101.
▲
by
leef
15y ago
It's somewhat similar in that BigTable (and Cassandra) perform writes as sequential I/O by writing to arrays (for stratified b-tree) or to SSTables (for Cassandra) and then merge them together using more sequential I/O. This is the not-so-
102.
▲
by
leef
15y ago
These Stratified B-trees are basically multi-versioned variations of Fractal Trees (aka Cache-oblivious streaming B-trees). This paper even references the tokutek teams paper - http://www.cs.sunysb.edu/~bender/newpub/BenderFaFi07.pdf . I
103.
▲
by
leef
16y ago
> Something a little more high tech, like running MySQL on top of a file system that does synchronous replication. You can't guarantee a consistent snapshot from the file system alone for Innodb. You need some other logic on top which
104.
▲
by
leef
16y ago
As opposed to...?