The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1981 vol.30)
pp: 537-545
G. Bongiovanni , IBM T. J. Watson Research Center
ABSTRACT
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, "Tree Search in Major/Minor Loop Magnetic Bubble Memories", IEEE Transactions on Computers, vol.30, no. 8, pp. 537-545, August 1981, doi:10.1109/TC.1981.1675838
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool