Abstract: Search requests are processed in a distributed database environment which includes a frontend module, one or more clients, a cache, a live data source, and multiple data records. Each data record includes at least one stable data piece stored in the cache and at least one volatile data piece. The frontend module receives a search request from a client and retrieves from the cache a set of data records. Each stable data piece in the set of data records corresponds to search criteria indicated in the search request. Current volatile data pieces, which correspond to the stable data pieces of the retrieved set of data records, are retrieved by the frontend module from the live data source for the retrieved set of data records. A completed set of data records is generated by combining the stable data pieces and the current volatile data pieces, and returned to the requesting client.

Abstract: Search requests are processed in a distributed database environment which includes a frontend module, one or more clients, a cache, a live data source, and multiple data records. Each data record includes at least one stable data piece stored in the cache and at least one volatile data piece. The frontend module receives a search request from a client and retrieves from the cache a set of data records. Each stable data piece in the set of data records corresponds to search criteria indicated in the search request. Current volatile data pieces, which correspond to the stable data pieces of the retrieved set of data records, are retrieved by the frontend module from the live data source for the retrieved set of data records. A completed set of data records is generated by combining the stable data pieces and the current volatile data pieces, and returned to the requesting client.

Abstract: Pre-computed search results are re-computed by a computation platform based on available computing resources. A search platform maintains at least a first and a second group of pre-computed search results and provides the first group of pre-computed search results at a first provision time and the second group of pre-computed search results at a second provision time to requesting clients. A re-computation controller schedules the re-computation of the pre-computed search results on the basis of validity probabilities being associated with the pre-computed search results and the respective provision times. Re-computation of the first group and the second group is scheduled such that the validity of the search results of the first group given by the validity probabilities is maximized at the first provision time and the validity of the pre-computed search results of the second group given by the validity probabilities is maximized at the second provision time.

Abstract: Pre-computed search results are re-computed by a computation platform based on available computing resources. A search platform maintains at least a first and a second group of pre-computed search results and provides the first group of pre-computed search results at a first provision time and the second group of pre-computed search results at a second provision time to requesting clients. A re-computation controller schedules the re-computation of the pre-computed search results on the basis of validity probabilities being associated with the pre-computed search results and the respective provision times. Re-computation of the first group and the second group is scheduled such that the validity of the search results of the first group given by the validity probabilities is maximized at the first provision time and the validity of the pre-computed search results of the second group given by the validity probabilities is maximized at the second provision time.