Fast Linking Associative Memory Engine

Given n freeform data objects…

+ ADD extensions to Boolean Algebra
x MULTIPLY by a Single System Image cluster
= Multi-Dimensional Object-Linked Memory Core
• Each chained object carries a path linked to the entire information base.
• Searches report results instantaneously and with provable scientific accuracy.
• Fastest path to any search is always taken.
• Data is “crunched”, then exported as an n dimensional hash matrix.
• Search performance as if any search was already optimally “indexed” (to use SQL terminology), but with no indexes required.
• Totally Clusterable, Web Back-end Ready, Simple API

The World’s fastest searchable database…

f.l.a.m.e.txt · Last modified: 2014/11/21 12:10 (external edit)
Except where otherwise noted, content on this wiki is licensed under the following license: GNU Free Documentation License 1.3
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki