ABSTRACT
For distributed processing, a key concept, maybe relating to NoSQL database storage, is as follows: key–value pairs, allowing the accumulation, in a distributed and scalable way, followed by the feeding into the component layers of the overall data processing carried out. This is the basis of the MapReduce programming or algorithmic model that is used in Apache Hadoop. It is also an expectation that future and further challenges and requirements can be addressed by hierarchy and symmetry, related to such areas as forensics, and potentially contexts where data rights management is relevant, and all such fields where the genealogy of information plays a role. Data piling is a known outcome of very high-dimensional data spaces. Massive data sets, in moderately sized dimensionality, can be well approximated in the manner that has been described. From that, then, clustering properties are to be derived.
