Array Data Structure

An Array Data Structure is an Index Data Structure that describes an Array Data Object which is composed of Array Data Elements that can be efficiently accessed via One or more Integer Array Dimensions.

• AKA: Array, Array Data Object, Multi-Dimensional Array, Multi-Dimensional Array Data Structure, Array Index.
• Context:
  • It can be based on a Array Data Structure Pattern.
  • It must have an Array Dimension.
  • It can represent:
    • a Vector (of Data Values, of Tuples, of Vectors)
    • a Matrix (be a Matrix Data Structure).
• Example(s):
  • an OLAP Cube, which also allows efficient summarization functions.
  • a Perl Array Data Structure, such as @Array1 .
• Counter-Example(s):
  • a Hash Data Structure.
  • a Tabular Data Structure, an Index Data Structure with Data Attributes.
  • a List Data Structure,
• See: Structured Data.

References

1996

• (Wall & al, 1996) => Larry Wall, Tom Christiansen, and Randal L. Schwartz. (1996). "Programming Perl, 2nd edition." O'Reilly. ISBN 1565921496 (alternate, search)
  • multi-dimensional array: An array with multiple subscripts for finding a single element. Perl does them with references.