Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: Management of a data cache having a compressed portion and an uncompressed portion by adaptively and dynamically allocating the relative amount space each portion receives. The relative sizes are defined based on one or more cost metrics and benefit metrics. The metrics are selected based on the performance of an application utilizing the cache. An optimized benefit relative to the cost is defined. Application operations on the cache are sampled and the relative cost and benefit is determined for different ratios of uncompressed to compressed cache sizes. The size of the uncompressed portion relative to the compressed portion is then re-adjusted based on an optimal cost-to-benefit ratio for the application.

Abstract: A computer-implemented system and method for managing service requests are disclosed. The system includes a service provider, having a number of server devices, that provides a service response in response to a client service request. The service response includes a service instance ID associated with a server and a connection lease. A communication processing component routes a first client service request to one of the servers. Subsequent client service requests and responses are transmitted directly between the client device and the server device associated with service instance ID included in the first service response for the duration of the connection lease.

Abstract: A facility for determining whether to consistency-check a cache entry is described. The facility randomly or pseudorandomly selects a value in a range. If the selected value satisfies a predetermined consistency-checking threshold within the range, the facility consistency-checks the entry, and may decide to propagate this knowledge to other cache managers. If, on the other hand, the selected value does not satisfy the consistency-checking threshold, the facility determines not to consistency-check the entry.

Abstract: A facility for determining whether to consistency-check a cache entry is described. The facility randomly or pseudorandomly selects a value in a range. If the selected value satisfies a predetermined consistency-checking threshold within the range, the facility consistency-checks the entry, and may decide to propagate this knowledge to other cache managers. If, on the other hand, the selected value does not satisfy the consistency-checking threshold, the facility determines not to consistency-check the entry.

Abstract: A facility for determining whether to consistency-check a cache entry is described. The facility randomly or pseudorandomly selects a value in a range. If the selected value satisfies a predetermined consistency-checking threshold within the range, the facility consistency-checks the entry, and may decide to propagate this knowledge to other cache managers. If, on the other hand, the selected value does not satisfy the consistency-checking threshold, the facility determines not to consistency-check the entry.

Abstract: A facility for determining whether to consistency-check a cache entry is described. The facility randomly or pseudorandomly selects a value in a range. If the selected value satisfies a predetermined consistency-checking threshold within the range, the facility consistency-checks the entry, and may decide to propagate this knowledge to other cache managers. If, on the other hand, the selected value does not satisfy the consistency-checking threshold, the facility determines not to consistency-check the entry.