DATA SET MANAGEMENT USING TRANSIENT DATA STRUCTURES

A data set is stored in a linear data structure. A memory manager receives multiple change requests for the data set. In response to receiving, for example, a read request for the data set, the memory manager batch processes the change requests by first moving the data set into a non-linear data structure. The non-linear data structure consumes more memory resources than the linear data structure but may provide for faster processing of the change requests while eliminating duplicate data elements. The updated data set is then returned to the more memory-efficient linear data structure.