Memory Structures

There are many structures for information retention in Vector memories, each comes with its own set of advantages and additional relationships

Flat Memory


Fast, relationship between peers across all parents and ancestors

Hierarchic Memory


Recursion, relationships between root, parent, child

Graph or Linked



Mixes of these models can be constructed to define memories that deviate from format based on design or data. AncestorDB is a Hierarchic Memory that has a Graph between root nodes for alternate vector addressing. Additionally Flat Memory spaces could be added at any node.

Vector Addressed Accumulated Memory (VAAM)

Vector -> to memory: store, retrieve, count stores, get count

Vector Addressed Ancestor Memory (VAnM)

hierarchy of information and structure

Each root node is either a class or is an instance of a class, each class has a hierarchy that that contains information in class and in instance. This allows for information to be extended easily without altering the underlying data. It also allows for generalizations and comparisons of complex information to be easily completed.