Magnetic-bubble Chinese-character generator

A scheme to map B-trees to minor loops of a bubble memory is described. The mapped data structure allows fast searches as well as insertions and deletions of variable-length data. The mapping utilizes the electrically-timed data movement in bubble memory. Indirect pointers for dynamical mappings are separated from the data in minor loops and stored in a main memory. The scheme is implemented to store and retrieve Chinese character generation codes. The coding method extends a coding for character input to facilitate character generation as well. Further data compression, derived from intrinsic features of Chinese characters, enables storing 20,000 character generation codes into a 1 Mbit bubble memory.