Dynamic Distributed Dimensional Data Model (D4M) Database and Computation

An associative array stores data in a matrix form responsive to linear algebra operations. A set of associative arrays employed for representing data are each composable, such that operations performed on them generate a result that is also an associative array responsive to linear algebra operations. An algebraic engine implements standard linear algebra computations for performing database operations. In contrast to conventional relational models, the associative arrays are not bound by a rigid schema and transaction atomicity, which tend to impose transactional overhead. The associative arrays store only non-null entries as tuples. The tuples are responsive to linear algebra operations, which employ simpler coding constructs than conventional relational SQL or other access mechanisms. The associative arrays and algebraic engine enjoy relaxed consistency, which recognizes that many queries seek information that is malleable over time and need not rely on global consistency or transaction atomicity in order to retrieve useful results.