1. A computer-implemented method, comprising: inserting a set of accessed objects into a cache, the set of accessed objects varying in size; and responsive to receiving a request to access a first object, the first object comprising a set of object components: determining that the first object does not fit into the cache given the set of accessed objects and a total size of the cache; applying, by a computer processor, a heuristic algorithm to identify in the set of object components one or more object components for insertion into the cache, the heuristic algorithm considering at least a priority of the first object compared to priorities of one or more objects in the set of accessed objects; wherein applying the heuristic algorithm comprises generating an eviction list of objects in the set of accessed objects, wherein each object in the eviction list has a weight, and wherein the sum of the weights of the objects in the eviction list is no greater than a weight of the first object; evicting from the cache the objects in the eviction list; and inserting into the cache the one or more object components of the first object.