I have stumbled upon a B-Tree template library written in C++. The library I found was written by someone from Google and can be downloaded from http://code.Google.com/p/cpp-btree/. According to the authors the advantage over the standard libraries implementing map and set data structures is the memory overhead. Usually those are implemented using Red-Black trees, which ...

Recently I read a lot about databases, mostly theory but also from the design point of view. I have to admit that until recently I had no idea what a B-tree is. I mean beside that it is a kind of a data structure, but how it is build and why on average there is ...

Writing the previous post it came to my mind, that many people may not be aware that using custom functions in WHERE clauses may be the reason why the index is not used. There are several facts about indexes you should keep in mind: index is most often a b-tree, see one of the Princeton’s lectures ...