leif

17 ms·

121.
by leif 13y ago
The sharing architecture is the same as mongodb: data is partitioned based according to a shard key and the secondary indexes are built separately on each shard. So queries that use indexes other than the shard key must be broadcast. For 1.
122.
by leif 13y ago
Wow sorry responding on my phone is hard. It's drop in if you're on 2.2. We do not have some 2.4 features (FTS, geo).
123.
by leif 13y ago
We're working on that, and we are hoping to base it on feedback, so if there's something you want, definitely let us know.
124.
by leif 13y ago
The simplest list is this: no full text search, geo indexes, or background indexing yet.
125.
by leif 13y ago
3. We support 2.2 but we've back ported some things from 2.4 (like hash-based sharding) pretty easily, I think we'll be able to keep up 4. Nope, it just came out today.
126.
by leif 13y ago
1. Yep 2. Dump and reload to get between mongodb and TokuMX. The storage systems and replication systems are incompatible
127.
by leif 13y ago
Glad to help. I hear you, we'd love to put out more benchmarks, but honestly we just don't have enough people time to do as much benchmarking as the software deserves, and if you can only put out k benchmarks/month, you'd better be putting
128.
by leif 13y ago
Unfortunately not, the replication format is completely different. A tool to do this would not be difficult to write, though.
129.
by leif 13y ago
The name is a marketing term, you're right. The structure is somewhere in the realm of buffer trees, LSM-trees, $B^\epsilon$ trees, and COLAs. It's hard to give it an academic name precisely because the implementation takes hints from many
130.
by leif 13y ago
TokuMX offers multi-document transactional semantics without application changes (snapshot reads), as well as protocol support for multi-statement (read-modify-write style) transactions, within a single shard. We are still designing how we
131.
by leif 13y ago
I am an engineer at Tokutek. Just talking about TokuMX, I have only seen MongoDB beat us on single-threaded, read-only workloads on extremely small data sets (like under 8K, or one MongoDB B-tree bucket). The statement is really pretty muc
132.
TokuMX: Fractal Trees with MongoDB(tokutek.com)
3 points by leif 13y ago|0 comments
133.
by leif 13y ago
Regarding "no multi-threading support", I have often wished for a node.js-like abstraction for event-driven processing in elisp. Seems like it could take the pain out of writing modules that want to do interesting processing or network-hea
134.
by leif 13y ago
(On phone, can't edit the other reply) Though you are right, the architecture we tried earlier, when we were doing a proof of concept, would not have helped with compression. Back then we were trying to play nice with mongodb's data format
135.
by leif 13y ago
What we are doing now is replacing all of mongodb's storage. So all of the data and all the indexes are in fractal trees. This means we can compress everything (including the field names!) and keep everything nicely defragmented.
136.
by leif 13y ago
I'll just leave this here... http://www.tokutek.com/2013/02/mongodb-fractal-tree-indexes-... Come talk to us if you're interested. We are stabilizing things and hope to open up evaluations more in a week or two.
137.
by leif 13y ago
dwm (almost everything in emacs anyway though) you should probably add options for awesome/xmonad, those are fairly popular in some circles.
138.
by leif 13y ago
Yep, we aren't doing sharded transactions yet. Still trying to nail down the basics.
139.
by leif 13y ago
Our (Tokutek) build of MongoDB with Fractal Tree indexes has atomic multi-document updates: http://www.tokutek.com/2013/04/mongodb-transactions-yes/ Come talk to us if you want to give it a spin! Don't mean to steal the thunder from Reth
140.
by leif 13y ago
8. New arrays: SYMTAB, FUNCTAB, and PROCINFO["identifiers"]. SYMTAB allows indirect access to any defined variable or array; it is possible to "walk" the symbol table, if that should be necessary. Can't wait for t
141.
by leif 13y ago
Someone using the open source version can take backups just as they would with our versions prior to 7.0: - snapshots (LVM, EBS, etc...) - cold backups - mysqldump (with MVCC, this is technically hot)
142.
by leif 13y ago
Dancing Trees are algorithmically the same as B+ trees, if I understand the wikipedia article correctly. With just a uniformly random workload with a large enough working set, one would behave pretty much exactly the same as a B+ tree.
143.
by leif 13y ago
IANAL, but the patents are owned by the universities where the founders work, not by the company. I don't know if this makes you feel any better though.
144.
by leif 13y ago
We have some more descriptions of Fractal Tree Indexes at http://tokutek.com/what-is-a-fractal-tree , and I'm always happy to answer questions about it.
145.
by leif 13y ago
Fractal Tree indexes are very different from Dancing Trees. See http://tokutek.com/what-is-a-fractal-tree for an overview, and I'd be happy to answer questions if you have them.
146.
by leif 13y ago
We're trying to contact the website folk but they're mighty busy announcing things right now. I'll let you all know what happened soon. In the meantime, here's a press release you can read: http://www.marketwire.com/press-release/tokutek
147.
by leif 14y ago
I'm glad this is out. I'm really going to enjoy plugging fractal trees in under FTS.
148.
by leif 14y ago
http://xkcd.com/927
149.
by leif 14y ago
$ git add .ssh $ git commit
150.
by leif 14y ago
I have a strongly negative reaction to straw man arguments. Maybe I can be more helpful: Being a programmer is like being a novelist. You need to be able to construct a plot, but you also need a powerful vocabulary. I'm saying C helps dev

More ›