News for hackers. Stuff that matters.

A comment on 532x Performance Increase for MongoDB with fractal tree indexes.

Re:532x Performance Increase for MongoDB with fractal tree i... by carterschonwald on Saturday November 17, 2012 @08:49PM (#4799577)
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!

[ Parent | on HN ]
Re:532x Performance Increase for MongoDB with fractal tree i... by monopede on Saturday November 17, 2012 @10:18PM (#4799714)
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...
[ Parent | on HN ]
Re:532x Performance Increase for MongoDB with fractal tree i... by ot on Sunday November 18, 2012 @07:12AM (#4800442)
He is a co-founder: http://www.tokutek.com/about/team/
[ Parent | on HN ]
Re:532x Performance Increase for MongoDB with fractal tree i... by carterschonwald on Sunday November 18, 2012 @02:12AM (#4800123)
What is also especially interesting is that a lot of the same ideas are also really important in writing HPC grade numerical code!

admission: i'm presently having a go at trying to write some high level + good locality numerical code! :-) , partly for fun, and partly as part of my little business! :-)

[ Parent | on HN ]