Dynamic Fragment Mapping

A data structure and methods for dynamic fragment mapping are disclosed. A dataset may be divided into pieces and stored at multiple locations and the system may dynamically increase or decrease the number of storage locations where the pieces of the data set may be stored. The addition or removal of storage locations may cause only the data stored on those locations to be moved but the rest of the data may not be moved. The data structure comprises a first data field including a first index and a first element, and one or more data fields, each with an index and an element. The elements of the one or more data fields include a token representing a location associated with the index of the first data field. A data row of a data set may be mapped to the index of a data field using a second index. The second index may be derived from a data row of the data set using a hash function. The second index may then be mapped to the index of a data field included in the one or more data fields using a modulus function.