Topic: associative memory

Summary

An associative memory, association list, or table is a data structure which is accessed by a (non-numeric) index. In Icon, the index is arbitrary.

An element of an associative memory stores a relationship or association between two values. Hardware implementations have largely failed because of inefficient storage and retrieval. Hardware caches often use set-associative memory. (cbb 1/90)

Subtopic: tuples

Quote: Linda specifies a tuple by a template; values match exactly while parameters match the data type [»carrN4_1989]

Subtopic: associative memory

QuoteRef: feldJA8_1969 ;;440 associative memory: accessing by specifying part of the contents

QuoteRef: feldJA8_1969 ;;445 fancy data structure to handle associative data

QuoteRef: flonL9_1974 ;;8 structures which associatively indexed (eg MUMPS)

Subtopic: like memory

Quote: memories are gestalts recalled from a subpart; ambiguities resolved statistically

Related Topics

Group: access to data   (12 topics, 307 quotes)
Group: relationship information   (5 topics, 69 quotes)

Topic: attribute-value pairs as information (57 items)
Topic: computer architecture (46 items)
Topic: hash table and hash functions (41 items)
Topic: information retrieval by searching (35 items)
Topic: memory cache (29 items)
Topic: objects as a set of attributes (39 items)
Topic: sparse arrays (6 items)
Topic: tuples
(17 items)