This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Processing of Large Node B-Trees
September 1990 (vol. 39 no. 9)
pp. 1208-1212

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.

[1] R. Bayer and E. M. McCreight, "Organization and maintenance of large ordered indices,"Acta Informatica, vol. 1, no. 3, pp. 173-189, 1972.
[2] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[3] H. C. Du and J. S. Sobolewski, "Disk allocation for Cartesian product files on multiple-disk systems,"ACM Trans. Database Syst., vol. 7, no. 1, pp. 82-101, Mar. 1982.
[4] T. Kakuta, N. Miyazaki, S. Shibayama, H. Yokota, and K. Murakami, "The design and implementation of relational database machine delta," inDatabase Machines, Fourth Int. Workshop, Mar. 1985, pp. 13-34.
[5] M. Y. Kim, "Synchronized disk interleaving," inProc. IEEE Trans. Comput., vol. C-35, no. 11, pp. 978-988, Nov. 1986.
[6] M. H. Kim and S. Pramanik, "Optimal file distribution for partial match retrieval," inProc. ACM SIGMOD Conf., 1988.
[7] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[8] H. O. Leilich, G. Stiege, and H. C. Zeidler, "A search processor for database management systems," inProc. 4th Int. Conf. Very Large Data Bases, 1978, pp. 280-287.
[9] S. Pramanik, "Performance analysis of a database filter search hard-ware,"IEEE Trans. Comput., vol. 35, no. 12, pp. 1077-1082, Dec. 1986.
[10] S. Pramanik and M. H. Kim, "Generalized parallel processing models for database systems," inProc. Int. Conf. Parallel Processing, 1988.
[11] H. Schweppe, H. C. Zeidler, W. Hell, H. O. Leilich, G. Stiege, and W. Teich, "RDBM--A dedicated multiprocessor system for database management," inAdvanced Database Machine Architecture, D. K. Hsiao, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1983, pp. 36-86.
[12] S. Y. W. Su, L. H. Nguyen, A. Eman, and G. J. Lipovski, "The architectural features and implementation techniques of multicell CASSM,"IEEE Trans. Comput., pp. 430-445, June 1979.
[13] H. Stone, "Parallel querying of large databases: A case study,"IEEE Comput. Mag., pp. 11-21, Oct. 1987.
[14] A. Yao, "Random 3-2 trees,"Acta Informatica, vol. 9, pp. 159-170, 1978.
[15] "Synchronized disks," Hitachi Corp.
[16] S. M. Ross,Introduction to Probability Models, 3rd ed. New York: Academic, 1985, pp. 335-339.

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, Sept. 1990, doi:10.1109/12.57061
Usage of this product signifies your acceptance of the Terms of Use.