A quick adjustable large page B-tree on multiprocessors-QALPB-tree

We consider how to exploit multiprocessors to improve the performance of a B-tree structured index. We presented a new large page B-tree, called QALPB-tree. The B-tree can adjust itself quickly, and it has perfect load balance. Preliminary performance results confirm that the QALPB-tree improves query response time, especially for the indexing of massive data.