Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: A database system stores data as hypertables that represent partitioned database tables. Each hypertable comprises chunks of data that may be distributed across multiple locations, each location comprising at least a storage device. The database system provides an interface that allows database queries seamlessly to hypertables as well as standard tables. The database system dynamically creates chunks as records are added to a hypertable. The database system defines a new partitioning strategy if the storage configuration of the database system is changed by adding new locations or removing existing locations. The records added to the hypertable before the storage configuration was changed continue to be stored as chunks distributed according to the previous partitioning policy.

Abstract: An example method is provided and includes maintaining at a network element a flow table, in which the flow table comprises a plurality of flow table entries and in which each of the flow table entries corresponds to one of a plurality of active data flows in a network, and, subsequent to receipt at the network element of a data packet of one of the active flows, characterizing the one of the active flows as a large flow or a short flow using values contained in the flow table entry corresponding to the one of the active flows. The method further includes processing the received packet in accordance with the characterization.

Abstract: An example method is provided and includes maintaining at a network element a flow table, in which the flow table comprises a plurality of flow table entries and in which each of the flow table entries corresponds to one of a plurality of active data flows in a network, and, subsequent to receipt at the network element of a data packet of one of the active flows, characterizing the one of the active flows as a large flow or a short flow using values contained in the flow table entry corresponding to the one of the active flows. The method further includes processing the received packet in accordance with the characterization.

Abstract: An example method for performance enhancement in a heterogeneous network environment with multipath transport protocols is provided and includes receiving packets according to Transmission Control Protocol (TCP packets) and packets according to multipath TCP (MPTCP packets) in a network environment, determining that TCP packets are experiencing congestion in comparison to the MPTCP packets, and delaying acknowledgement packets (MPTCP ACK packets) corresponding to the MPTCP packets for a pre-determined time interval. In a specific embodiment, a local MPTCP proxy intercepts the TCP packets and forwards underlying data of the TCP packets according to MPTCP.

Abstract: An example method for performance enhancement in a heterogeneous network environment with multipath transport protocols is provided and includes receiving packets according to Transmission Control Protocol (TCP packets) and packets according to multipath TCP (MPTCP packets) in a network environment, determining that TCP packets are experiencing congestion in comparison to the MPTCP packets, and delaying acknowledgement packets (MPTCP ACK packets) corresponding to the MPTCP packets for a pre-determined time interval. In a specific embodiment, a local MPTCP proxy intercepts the TCP packets and forwards underlying data of the TCP packets according to MPTCP.

Abstract: A method is provided in one example embodiment that includes identifying a foreground flow that has a higher priority than at least one background traffic flow in a network. The method also includes determining (e.g., periodically) a latency metric associated with the foreground flow, and activating a latency reduction response if the latency metric exceeds a threshold. In more particular embodiments, the latency reduction response may include diverting background flows in the network to a buffer for a delay period and/or delaying acknowledgements for background flows until the latency metric is below the threshold. In yet more particular embodiments, the latency metric may be a round-trip time.

Abstract: A method is provided in one example embodiment that includes identifying a foreground flow that has a higher priority than at least one background traffic flow in a network. The method also includes determining (e.g., periodically) a latency metric associated with the foreground flow, and activating a latency reduction response if the latency metric exceeds a threshold. In more particular embodiments, the latency reduction response may include diverting background flows in the network to a buffer for a delay period and/or delaying acknowledgements for background flows until the latency metric is below the threshold. In yet more particular embodiments, the latency metric may be a round-trip time.