|Next Page||Prev Page||Main Index||Home|
The problem is information. How to acquire, validate, store, analyze
and distribute information within a distributed network. Lots
of little pockets of information held by different people with
different needs and goals. All points outside the network and
random points inside the network must be assumed hostile. Add
this to nodes in the network playing a constant game of hide-and-seek,
and you have a problem no conventional DBMS can solve. Whether
this is a military or corporate battle field the problems are
MPbase has several unique characteristics that make it
ideal for this very challenging environment. In a traditional
DBMS, the functions listed above (acquire, etc.) are largely separate.
Each part of the solution using different methods and tools. With
MPbase all of the information handling requires only one
tool, MPbase. There is no one-to-one correspondence between
features and the required functions. Instead the problems are
solved by the way MPbase deals with the information itself.
First, the content addressable memory schema allows for distributed
acquisition, validation and analysis. As an example, each field
node could contain the data for X hundred yards in any direction.
The holder of this node can now add to, or correct, information
about this area in the networked knowledge base. Many such overlapping
circles of information can exist in a single MPbase without
creating any problems.
Second, each MPbase is already made up of many little TCP/IP
connected databases. In the phone book demo alone there are over
80,000. Small sets of these databases can live in network-connected
laptops, palm tops, or backpacks. These little DBs can be moved
around "at will" without confusing MPbase.
Third, encryption can be used at the lowest level of the DB. This
after a compression that is a good encryption by itself. Because
the search engine works on the compressed buffer directly, "plain
text" need never exist outside of the final result set.
Fourth, an MPbase can be configured as a fault-tolerant
hierarchy of information. This allows the best available information
to be used in all decisions. The best source is a node at the
site. The next best, is the node real-time synched at last contact.
Next, a local interconnect. Last of all, a system wide interconnect.
With MPbase this real world environment is no problem.
The natural information-based clustering found in MPbase
makes short work of this information-based problem. Every MPbase
already calls this type of complex networked environment home.
In short, with MPbase this nasty real world environment and problem are no problem.
|Next Page||Prev Page||Main Index||Home||© 1998-2004 NPSI|