4 ms·
I read the paper, and I must be missing something. (I'm not a computer scientist, so there's probably something important here that's flying right over my head.
by thaumaturgy 18y ago
I read the paper, and I must be missing something. (I'm not a computer scientist, so there's probably something important here that's flying right over my head.)
The paper mentions "fault tolerance" a number of times, and I'm thinking, "fantastic! They've got some magic in there so that if a node goes down, there are automatically some number of nodes that can instantly take over its place." Except, they don't ... their fault tolerance sounds like they just expect to use servers with really good data recovery. It does mention a primary backup server that's supposed to shadow each other data server, but now we're talking about an effective 2n nodes. Also, it doesn't sound like it would be all that fault tolerant in the event of network problems (broken pipe between nodes, denial of service attack, etc.), or if the root node goes down.
Since they're only storing actual data in leaf nodes, they're not outperforming a classic balanced binary tree in search time.
It does sound like they've done some good work in making sure that they keep data integrity in the event of client-server communication problems, but that's also been solved by a number of database and file systems already.
So ... can someone explain the novelty here?