Topic: sparse arrays

topics > computer science > data > Group: data structures

associative memory


Sparse arrays are arrays with most elements zero or undefined. Instead of normal array implementations, they are implemented with explicitly stated indices in a tree, list, or associative memory. The data objects of the MUMPS medical information system are sparse arrays, allowing dynamic definition of the data base. In MUMPS, the array indices represent attributes of the data objects. Gehani (gahaN2_79) defines 'grids' which are regularly specified sparse arrays. They allow more efficient, but less flexible, implementations. (cbb 5/80)
Subtopic: sparse array up

QuoteRef: mumps ;; global variables -- sparse arrays on disk, siblings chained together with links to sons. use of an entry implies the path to get to the entry.
QuoteRef: shawCJ_1963 ;;93 variable data structure -- sparse table with optional entries indexed by name.
QuoteRef: smitJW_1970 ;;227 allows sparse array declaration.

Subtopic: sparse bit vector up

Quote: bit-counting algorithm based on frequency division; most efficient for sparse vectors [»berkS11_2000]

Subtopic: grid -- array subset up

Quote: a grid is the union of some arrays minus the union of other arrays; e.g., GRID[1..20 PLUS 30..50] [»gahaN2_1979]
Quote: declare grid in terms of other coordinates; e.g., triangular grid by GRID[i in 1..100, 1..i] [»gahaN2_1979]

Related Topics up

Topic: arrays (58 items)
Topic: associative memory (5 items)
Topic: trees
(21 items)

Updated barberCB 2/05
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.