By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li Qinghua ; Nat. High Performance Comput. Center, Wuhan, China ; Sui Haiyau

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.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000