Design of tree networks for distributed data

  • Authors:
  • R. G. Casey

  • Affiliations:
  • IBM Research Laboratory, San Jose, California

  • Venue:
  • AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

The advent of computerized information networks connotes a change in the normal data processing concept of information as a localized object, a disk file tied to computer X, for instance. Having available a facility for communication between computers it is more natural to think of related data files at different sites as elements of a single unified data collection. As an example, crime reports gathered in various cities across the nation inherently constitute an integrated data base of more than local interest. In banking, manufacturing, and other applications the same is often found to be true; information gathered and maintained in one geographical area is closely related to data collected elsewhere. Computer networks offer not only a replacement for unwieldy document-oriented methods of communicating between distributed data files, but also promise the flexibility needed to develop new ways of applying these data collections.