Google Inc.

David Edward Gay

Alfred R K Fuller

Joshua Melcon

Ryan Huebsch

Arash Parsa

Max C Ross

A method for detecting a traffic ramp-up rule violation includes receiving data element retrieval requests from an information retrieval system and determining a requests per second (RPS) for a key range. The method also includes determining a moving average of RPS for the key range. The method also includes determining a number of delta violations, each delta violation comprising a respective beginning instance in time when the RPS exceeded a delta RPS limit. For each delta violation, the method includes determining a maximum conforming load for the key range over and determining whether the RPS exceeded the maximum conforming load for the key range based on the beginning instance in time of the respective delta violation. When the RPS has exceeded the maximum conforming load, the method includes determining that the delta violation corresponds to a full-history violation indicative of a degradation of performance of the information retrieval system.

Rule violation detection

A server system having one or more processors and memory receives a first request from an application and processes at least a portion of the first request in accordance with a predefined set of resource constraints. In accordance with a determination that the predefined set of resource constraints has been met prior to completing processing the first request, the server system terminates processing of the first request prior to completing processing of the first request, generates a first intermediate result; and provides a response to the application. The response includes the first intermediate result, and request status information enabling the application to request resumption of the first request.

Resource constraints for request processing

A server system having one or more processors and memory launches an instance of an application subject to a first set of resource constraints. Exceeding the first set of resource constraints will cause the application instance to be terminated. The server system transmits a first request from the application instance to a datastore server system. The first request is subject to a second set of resource constraints that are more restrictive than the first set of resource constraints. The server system receives a first response to the first request. When processing the first request exceeds the second set of resource constraints, the first response includes a first set of partial results and information enabling the application instance to request resumption of processing the first request, and when the first request was processed without exceeding the second set of resource constraints, the first response includes complete results.

Application of resource limits to request processing

A server system having one or more processors and memory stores a plurality of entities in a schemaless database. The entities are not structured in accordance with a predefined schema. The server system generates an index for the plurality of entities stored in the schemaless database. The index has a plurality of index entries sorted in a sort order. The server system receives a first request from an application and, in response to the first request, accesses an empirically-determined schema and generates a first response based on the empirically-determined schema. The empirically-determined schema is generated from the index. After generating the first response, the server system sends the first response to the application.

Growing community of inventors

Oakland, CA, United States of America

David Edward Gay