Title :
Parallel processing of large node B-trees
Author :
Pramanik, Sakti ; Kim, Myoung Ho
Author_Institution :
Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
fDate :
9/1/1990 12:00:00 AM
Abstract :
The performance improvement afforded by parallel processing of large-node B-trees is investigated. A node partitioning scheme to enhance concurrency for B-trees is presented. In the method, the tree height is reduced by increasing the node size. However, it is shown that increasing node size alone in conventional B-trees on parallel disks may not improve the response time, and may even degrade the performance. The proposed method achieves better performance while avoiding this anomaly
Keywords :
parallel algorithms; parallel processing; trees (mathematics); B-trees; concurrency; large node B-trees; parallel processing; response time; tree height; Computer science; Concurrent computing; Costs; Database systems; Degradation; Delay; Indexing; Parallel algorithms; Parallel processing; Proposals;
Journal_Title :
Computers, IEEE Transactions on
