Title :
A quick adjustable large page B-tree on multiprocessors-QALPB-tree
Author :
Qinghua, Li ; Sui Haiyau
Author_Institution :
Nat. High Performance Comput. Center, Wuhan, China
Abstract :
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.
Keywords :
database indexing; multiprocessing systems; parallel databases; query processing; resource allocation; software performance evaluation; tree data structures; B-tree structured index; QALPB-tree; adjustable large page B-tree; indexing; load balance; multiprocessors; performance; query response time;
Conference_Titel :
High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on
Conference_Location :
Beijing, China
Print_ISBN :
0-7695-0589-2
DOI :
10.1109/HPC.2000.843509
