Cylinders: a relational data structure

  • Authors:
  • Paul E. Weston;Stephen M. Taylor

  • Affiliations:
  • University of Illinois;University of Illinois

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

A form of list structure is described which permits an efficient representation of relational data structures. The general notions of the PLEX and of ring structures, because of their proven value, have been used as a basis; but by systematically treating the array structure of the PLEX as an implicit form of linkage which is complementary to the explicit links carried by pointers, a new form of linked data structure emerges, which is called CYLINDER. While CYLINDERS are built up from two or more simple rings of pointers, they characteristically exhibit a multiplicity of closed search paths, which are usable in the construction of data representations. Examples of CYLINDER applications are discussed.