Memory-efficient management of computer network resources

Systems and methods are provided for managing a data store, invalidation requests, and/or resource requests. The system and methods may use one or more data structures, such as hash data structures and/or probabilistic data structures, to achieve various levels of granularity and/or computer resource efficiencies. Further, the invalidation request data may be stored at a front-end layer separate from a data store layer, such that the invalidation requests are processed based on resource requests. In the example, the hash data structure can be used for recent invalidation requests and older request data can be stored in memory-efficient probabilistic data structures. For example, probabilistic filters, such as a bloom filter, can store resource identifiers along with an associated version for space-efficient invalidation comparisons.