Lucent Technologies Inc.

Torsten Suel

Viswanath Poosala

Shanmugavelayut Muthukrishnan

Sridhar Ramaswamy

Shanmuugavelayut Muthukrishnan

A system and method for increasing the speed of flow of a quantity of data or of a plurality of data types through a communication system. The communication system comprises a plurality of switches including a source and a sink, each of the switches connected to a neighboring switch by a communication link having a capacity, each of the links having a pair of queue buffers, and one queue buffer of each pair of queue buffers is located at each switch connected by a link. For a single data type, a flow is computed for each link as a function of a last previous amount of flow across the same link. In the multi-data type case, a weighted queue difference is computed as a function of a last previous amount of flow between the same pair of queues and an amount of flow f of said data type i is routed across each said link such that &Sgr; f (&Dgr;&prime; (e)&minus;f ) is maximized. In other embodiments of the invention, the system and method resolves the contention between different data types for the capacity of a communication link with and without a normalization factor, and adjusts flow so as not to exceed the capacity of a communication link or the amount of a data available to be routed by the sending queue buffer.

System and method for increasing the speed of distributed single and multi-commodity flow using second order methods

I/O-efficient methods and apparatus are provided for the d-dimensional join problem in one, two, and three dimensions, and are also generalized for arbitrary higher dimensions. Let N be the total number of rectangles in the two sets to be joined, M the total amount of memory available, B the disk block size, and T the total number of pairs in the output of the join. Define n&equals;N/B, m&equals;M/B, and t&equals;T/B. For one and two dimensions, I/O-optimal join methods are provided that run in O(nlog,n&plus;t) I/O operations and have utility to temporal and spatial database systems. For dimensions d&gE;3, methods are provided that run in O(nlog,n&plus;t) I/O operations, which is within a log,n factor of the currently known lower bounds.

System and method for performing I/O-efficient join processing

A method of using an algorithm to partition a multi-dimensional data set into a minimum number of rectangular-shaped partitions that can be processed more quickly than the non-partitioned data set while satisfying certain specified performance constraints.

Method for partitioning multi-dimensional data sets into rectangular partitions

A novel and unique method, apparatus and programmed storage medium for approximating large data distributions of a database in order to allow a user to accurately analyze the entire data distribution using a limited amount of memory space in a reasonable amount of time. The approximation is based on partitioning the data domain into a number of regions, approximating each region using any well-known technique, and composing the errors of approximation to optimize suitable criteria for approximating the entire data distribution.

Computer method, apparatus and programmed medium for approximating large

A computer method, apparatus and programmed medium for optimizing the number of buckets, and thus minimizing the necessary amount of memory space, needed to construct a histogram of a data distribution contained within a computer database with a cumulative error bounded by a specified threshold. The method according to the present invention allows a user to determine the near-minimal memory space necessary to store an approximation of a database with a maximum error measure at most three times that specified by the user to allow the user to maximize computer resources.

Growing community of inventors

Springfield, NJ, United States of America

Torsten Suel