Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

532x Performance Increase for MongoDB with fractal tree indexes

tokutek.com

Post reply on HN
Print view View original

21–27 of 27 posts

Re: 532x Performance Increase for MongoDB with fractal tree indexes

#21

Post by ot »

monopede wrote: post #8
carterschonwald wrote: post #2

Please note that the actual name for a "fractal tree" in the research literature is "Streaming (cache oblivious) B-Tree" (or at least they've very very closely related). Writing good code wrt memory locality is SUPER important for writing high performance code, whether its in memory work, or larger than ram (eg for the DB). Also a fun exercise to try to understand how!

Would make sense. Michael Bender is a co-author on that paper and he apparently works for Tokutek, judging by this presentation: http://www.bnl.gov/csc/seminars/abstracts/Bender_Presentatio...

He is a co-founder: http://www.tokutek.com/about/team/

Re: 532x Performance Increase for MongoDB with fractal tree indexes

#22

Post by knightni »

Groxx wrote: post #15

> At 3.5 million inserted documents, the exit velocity of standard MongoDB was 2.11 inserts per second... That's terrifying - do people expect performance like this? Or was this crafted to be a pathological case? 100 element arrays don't seem too common, but that only makes this 300 million entries in e.g. a SQL table - I suspect my laptop running MySQL could outdo that kind of performance (but have no proof. I could…

It doesn't surprise me a great deal - Mongo doesn't have a history of being a technologically strong database system. While it is/was perceived as high performance, it's always been clear that this performance was gained as a result of compromises rather than technical excellence.

Re: 532x Performance Increase for MongoDB with fractal tree indexes

#23

Post by Zenst »

krmmalik wrote: post #18
X4 wrote: post #14

Nobody believes me when I say Fractals solve literally everything efficiency related. Even though it's true. Nobody believed me when I introduced on-demand script injection for javascript, today it's IT etiquette. The power of popularity I guess.

Did you blog about it? give examples? What else can be solved with fractals?

http://en.wikipedia.org/wiki/Fractal_compression

Re: 532x Performance Increase for MongoDB with fractal tree indexes

#26

Post by dbecker »

X4 wrote: post #14

Nobody believes me when I say Fractals solve literally everything efficiency related. Even though it's true. Nobody believed me when I introduced on-demand script injection for javascript, today it's IT etiquette. The power of popularity I guess.

An example where fractals improved efficiency does not constitute proof (or even compelling evidence) that there aren't any efficiency issues that fractals don't solve. Which is what you are claiming.
Post reply on HN