Abstract: Technologies are described for cost based management of cache entries stored in a computer memory. In one example, a plurality of cache entries may be stored at a cache in a computer memory and the cache entries may have a cost measure associated with individual cache entries. A cost measure may represent a computing cost of an application to generate a cache entry. An incoming cache entry may be received at the cache, where the incoming cache entry has a cost measure associated with the incoming cache entry. In response to receiving the incoming cache entry, a cache entry that has a lower cost measure than the cost measure for other cache entries may be identified for eviction from the cache. The cache entry identified for eviction may be evicted from the cache, and the incoming cache entry may be written into the cache stored in the computer memory.

Abstract: Described are techniques for reducing inaccurate values in databases by managing the order in which processes are enqueued and executed. A modification process to modify a first value in a database may be received. A precomputation process that modifies values dependent on the first value may be enqueued prior to enqueuing of the modification process to ensure that the modification process does not occur if the precomputation process fails. The modification process may be executed prior to executing the precomputation process to ensure that the precomputation process acts to modify the dependent values using the modified version of the first value.