by hashing operation h 1 results of performing method 100 nine times using hashing operation h 1 another example of a hashing operation h is provided in appendix 2 and referred to as hashing operation h 2 fig4 shows the progression of movement of data as method 100 is performed using hashing operation h 2 so that at the conclusion database 62 p has a total of eighteen partitions each row in fig4 represents a key each column represents the addition of a new partition squares in a given row indicate that the data represented by this row need to be transitioned to a new partition as part of the migration caused by adding the new node represented by the corresponding column the first column is solid because all data needed to be written into the first partition moving across a row shows at which partition size increases a particular piece of data needed to be moved to the new partition reading down a row shows which keys were copied into the new partition when the new partition was created fig5 a and 5b are another representation of fig4 except that fig5 a and 5b also show to which partition each key is allocated at each point in time varieties of permutations combinations variations and or subsets of the embodiments discussed herein are contemplated and will now occur to those skilled in the art for example system 50 can be varied for environments other than telecommunications in which case databases 62 that serve applications 58 can in turn service any type of client machine and not just scps 54 the second u2018 part u2019 function above is limited by.