Maintaining Sorted Files in a Magnetic Bubble Memory

Authors:
G. Bongiovanni;F. Luccio
Affiliations:
IBM T. J. Watson Research Center;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 6
Cited 1

Data file management in shift-register memories

ACM Transactions on Database Systems (TODS)
Binary Search Trees and File Organization

ACM Computing Surveys (CSUR)
Permutation of data blocks in a bubble memory

Communications of the ACM
The Implications of Electronic Serial Memories*

Computer
On the Complexity of Sorting in Magnetic Bubble Memory Systems

IEEE Transactions on Computers
Intelligent Magnetic Bubble Memories and Their Applications in Data Base Management Systems

IEEE Transactions on Computers

Tree Search in Major/Minor Loop Magnetic Bubble Memories

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

A typical organization of magnetic bubble memories is the major-minor loop structure, where n (minor) loops are connected via switches to another (major) loop, containing the I/O station. We work on a sorted file F, split into subfiles allocated in the minor loops.