leif

8 ms·

31.
by leif 13y ago
If you're having problems with MongoDB on large data sets, try TokuMX: http://www.tokutek.com/products/tokumx-for-mongodb/
32.
by leif 13y ago
thanks a lot, argv0
33.
by leif 13y ago
For other cmake writers out there, this isn't hard. set(LIBDIR lib CACHE STRING "lib dir") install(${lib_targets} DESTINATION ${LIBDIR}) That's what I do and I am able to build packages with it just fine, th
34.
by leif 13y ago
CTO is a professor at UNH, Chief Scientist is from UNH and used to work at Virtual Iron which was acquired by Oracle, then he worked at Akiban until they were acquired. It appears some of their patents ( http://www.google.com&#x2
35.
by leif 13y ago
This links to the wrong fractal tree paper for discussing write-read optimized data structures. The proper one is http://supertech.csail.mit.edu/papers/sbtree.pdf This makes me wonder how much research this team really
36.
by leif 13y ago
It's telling that those jira tickets are both in the top five most voted on open server tickets and are from 2010 and before. (I know you know this roger, but) TokuMX completely resolves both of them.
37.
by leif 13y ago
I agree. We're putting a lot of effort into this at Tokutek with TokuMX: http://www.tokutek.com/2014/02/introducing-tokumx-1-4-major-... Personally, I think the company formerly known as 10gen is doing a lot
38.
by leif 13y ago
This isn't a great answer, but I think I owe you an honest one. Our marketing department wants to be able to throw the "please put your email here if you want" form up before a download. We are trying to find a way to recon
39.
by leif 13y ago
From where I'm standing it appears that 10gen is still iterating fast on features in MongoDB. They're trying to figure out text search, they're expanding the aggregation framework rapidly (which looks really interesting), th
40.
by leif 13y ago
All TokuMX data and index storage is block compressed. It's not hard, it's on by default.
41.
by leif 13y ago
Unfortunately, this would break compatibility with existing MongoDB applications more than we would probably be willing to do. However, there's no reason RethinkDB couldn't use Fractal Tree indexing instead of B-trees, given some
42.
by leif 13y ago
It's unclear exactly what you mean by "rethinkdb-style" because that could mean a number of things, but stay tuned for our posts on this next week, I think you'll be pleasantly surprised.
43.
by leif 13y ago
Ok. Well, you said you were waiting for it to be ready, and I think it is. We'll be here when you get a week free to tinker.
44.
by leif 13y ago
If you were using upserts I expect you were having problems due to the optimizer retrying all possible plans (including table scan) periodically. This is reflected in https://github.com/Tokutek/mongo/issues/79
45.
by leif 13y ago
When are these comments going to stop? Everyone lazy enough is going to keep suggesting "curl install" and everyone lazy enough is going to keep using it, and everyone that has something worth protecting and cares enough is eithe
46.
by leif 13y ago
sudo echo foo > bar doesn't work, instead use echo foo | sudo tee bar
47.
by leif 13y ago
beatbox couldn't be more thrilled by that
48.
by leif 13y ago
Kind of. TCmalloc used to never unmap pages (though it would reuse things the client freed), which made it awful for long-lived processes with dynamic memory usage.
49.
by leif 13y ago
They're functional alcoholics.
50.
by leif 13y ago
HAT ( http://www.bailis.org/papers/hat-vldb2014.pdf ) looks pretty promising in terms of multi-term transactions. It turns out that you can push the problem off to garbage collection in order to make transaction id gener
51.
by leif 13y ago
Oh ok, now I see what you're saying, it's still similar to an insert buffer in that case. B-tree behavior is still to blame for this, and if you make your log file bigger it lets you soak up more writes before you need to checkpoi
52.
by leif 13y ago
I think you're talking about an insert buffer, not a transaction log, and in that case, no matter how big your insert buffer is, it will eventually saturate and you'll end up hitting the performance cliff of the B-tree. You really
53.
by leif 13y ago
I'm not talking about the speed of the array, rather a battery backed controller. With one of those, as long as you're under the sequential write bandwidth of the underlying array, it pretty much doesn't matter how much you f
54.
by leif 13y ago
The bids and offers made in the market set the price, just like all currencies. Right now the market is too small to be stable like most currencies (not enough inertia, too many events if large relative significance, not enough arbitrageurs
55.
by leif 13y ago
The write bottleneck for traditional databases has never been the write-ahead log, with group commit and a battery-backed RAID controller you'll have a hard time saturating the disk with log writes. The bottleneck has always been rando
56.
by leif 13y ago
Ok, that's more drastic than I thought. I think I get the point now.
57.
by leif 13y ago
I'm not a web guy, but isn't sass a CSS generator, as in something you run once before deploying anything? What's the advantage of speed for something like this?
58.
by leif 13y ago
That thread is talking about the possible inclusion of our indexing library inside Postgres, and was from before we had open sourced the code. IANAL but I think it would be possible to include the fractal tree library in Postgres now if so
59.
by leif 13y ago
I promise it hasn't, but I'm curious to see what you're talking about. Link?
60.
by leif 13y ago
Fine-grained locking is hard , but "tar pit" is unfair and honestly a bad attitude. It's crucial for modern applications, and it can be done if you're careful, and it can be done really well. We (Tokutek) tried for a l

More ›