Sorry, but unless I'm working on an actual database, I'm unlikely to need to solve btree (index/sort/resort/invert) type problems. I do have a decent understanding in principle, but generally am using a database layer that someone else wrote for these types of things.