Key-Independent Uniform Segmentation of Arbitrary Input Using a Hash Function

@inproceedings{DorfmanKeyIndependentUS,
  title={Key-Independent Uniform Segmentation of Arbitrary Input Using a Hash Function},
  author={Paul M. Dorfman and Don Henderson}
}
Aggregating or combining large data volumes can challenge computing resources. For example, the process may be hindered by the system limits on utility space or memory and, as a result, either fail or run too long to be useful. It is a natural inclination to try solving the problem by segregating the input records into a number of smaller segments, process them independently, and combine the results. However, in order for such a divide-and-conquer tactic to work, two seemingly contradictory… CONTINUE READING

From This Paper

Topics from this paper.
0 Citations
0 References
Similar Papers

Similar Papers

Loading similar papers…