This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tree Search in Major/Minor Loop Magnetic Bubble Memories
August 1981 (vol. 30 no. 8)
pp. 537-545
G. Bongiovanni, IBM T. J. Watson Research Center
In this paper we analyze various search schemes in a major/minor loop bubble memory. Specifically, we study balanced tree search, one-sided height-balanced tree search, and one-sided K-Keight-balanced tree search. Two parameters are of interest in the present framework, namely, the number of comparisons and the amount of record movement required for a search. One-sided height- balanced tree search seems to offer the best compromise. Other related issues such as insertion and deletions are also discussed.
Index Terms:
tree search, Analysis of algorithms, balanced trees, deletion, insertion, magnetic bubble memories, major loops, minor loops, number of comparisons, one-sided height-balanced trees, one-sided K-height-balanced trees, record movement
Citation:
G. Bongiovanni, C.K. Wong, "Tree Search in Major/Minor Loop Magnetic Bubble Memories," IEEE Transactions on Computers, vol. 30, no. 8, pp. 537-545, Aug. 1981, doi:10.1109/TC.1981.1675838
Usage of this product signifies your acceptance of the Terms of Use.