The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1990 vol.39)
pp: 1208-1212
ABSTRACT
<p>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.</p>
INDEX TERMS
large node B-trees; parallel processing; concurrency; B-trees; tree height; response time; parallel algorithms; parallel processing; trees (mathematics).
CITATION
S. Pramanik, M. Kim, "Parallel Processing of Large Node B-Trees", IEEE Transactions on Computers, vol.39, no. 9, pp. 1208-1212, September 1990, doi:10.1109/12.57061
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool