BPS 2.1 Release set of pointer sleeve twist B-tree

BPS is a set of pointer-set torsion b-tree, which can speed up to the fastest and reduce memory usage and maintenance order based on a hash table collection. The collection introduces a new variety of b-tree with super search and http://www.aliyun.com/zixun/aggregation/17204.html "> editing capabilities." Compared with Unordered_set, the collection is only 30% slower, but can reduce memory usage by 3 times times. Compared with ordered Std::set, the collection is 4 times times faster than the ordered std::set and can be reduced by 5 times times the memory usage.

About B-tree

B-tree (multiple search trees, not binary) is a common data structure. Using the B-TREE structure can significantly reduce the intermediate processes that are experienced in locating records, thereby speeding access. According to translation, B is generally considered to be the abbreviation of balance. This data structure is generally used in database indexing, and the overall efficiency is high.

The BPS 2.1 version adds support for 64-bit machines.

Software Information: http://sourceforge.net/projects/btps/

Download Address: http://nchc.dl.sourceforge.net/project/btps/bps/bps-2.1/bps-2.1.tar.gz