An introduction to the S SPIN hash function: making more out of the multidimensional array

Along with enlightened communication and exchange, the digital revolution has produced mounds of information requiring classification, control, and management. As such, several organizations around the country have toyed with the idea of a totally paperless environment. To one degree or another, digitized information management has emerged among retail outlets, banks, insurers, and other companies. While electronic transactions involving uncomplicated information processing are common place today, still implementing the more complex data management techniques produces a number of difficulties. Not the least important is rise in the number of sophisticated design tools which allow system designers to pile layers of abstracted automation on top of the data structures responsible for performing the fundamental operations of search, insert, delete, change etc. While today´s data structures are, for the most part, linear, the complexity of current systems demands a multidimensional approach capable of supporting layered data relationships. This paper explains a hash function called S SPIN capable of performing fundamental operations on multidimensional data spaces