Abstract: The systems, methods, devices, and non-transitory media of the various embodiments enable query execution plan graphs to be compared to determine whether all or portions of two or more queries define data sets that are structurally equivalent. Two data sets may be structurally equivalent when each data set may be composed with a bijective relation that yields the other. In the various embodiments, when all or a portion of a first query that has been previously run defines a data set that is structurally equivalent to a data set defined by all or a portion of a second query that is to be run, the structure preserving transform may be applied to the corresponding portion of the second query to transform that portion of the second query into the corresponding portion of the first query, thereby allowing the results from previously running the first query to be reused.

Abstract: Methods and systems for transmitting data, including transmitting a series of packets of data to multiple nodes, each of the multiple nodes being configured to return an acknowledgement of receipt of one or more of the packets of data, and reducing a size of a current packet of data in response to a time to receive an acknowledgment for a previous packet of data being greater than a threshold time.

Abstract: Methods and systems for handling exceptions, including being provided with a catch list, the catch list being a flattened inheritance tree for exception types in ascending inheritance order, receiving an exception from a thread, searching the catch list in ascending inheritance order to find a matching exception type to received exception.