Abstract: Methods, systems, and computer-readable media for continuous functions in a time-series database are disclosed. A plurality of data points of a time series are stored into one or more storage tiers of a time-series database. The plurality of data points comprise a plurality of discrete measurements at respective timestamps. Using one or more query processors of the time-series database, a query of the time series is initiated. The query indicates a time range. Using the one or more query processors, a continuous function is determined that represents a segment of the time series in the time range. The continuous function is determined based at least in part on the plurality of data points. An operation is performed using the continuous function as an input.

Abstract: Atomic partition scheme updates to partition items may be implemented by a time series database. A time threshold may be assigned to partition scheme update so that the time threshold may be applied across a set of ingestion nodes that may apply the partition scheme update the same. A request to store an item with a timestamp less than the time threshold may be stored in one partition of the time series database, while the item may be stored in a different partition of the time series database if the item has timestamp greater than or equal to the time threshold.

Abstract: Methods, systems, and computer-readable media for adaptive querying of time-series data over tiered storage are disclosed. A distributed time-series database receives a query indicating spatial and temporal boundaries of requested time-series data in a table. The time-series database stores time-series data using a plurality of storage resources, wherein a first storage tier is accessible using a first access interface and a second storage tier is accessible using a second access interface. The time-series database determines, in the plurality of storage resources, one or more storage locations corresponding to the spatial and temporal boundaries of the query. Using the first access interface, the time-series database reads one or more elements of the requested time-series data from storage locations in the first storage tier. Using the second access interface, the time-series database reads one or more additional elements of the requested time-series data from storage locations in the second storage tier.

Abstract: Methods, systems, and computer-readable media for partition splitting in a distributed database are disclosed. A partition of data is split into a first sub-partition and a second sub-partition. A first portion of the data is assigned to the first sub-partition, and a second portion of the data is assigned to the second sub-partition. One or more elements of the first portion of the data from the partition and an additional one or more elements of the first portion of the data from the first sub-partition are stored into a first node. One or more elements of the second portion of the data from the partition and an additional one or more elements of the second portion of the data from the second sub-partition are stored into a second node. The partition is prevented from receiving new data after the partition is split into the first and second sub-partitions.

Abstract: Techniques are described for clustering data at the point of ingestion for storage using scalable storage resources. To cluster data at the point of ingestion, a data ingestion and query service uses a multilevel hash tree (MLHT)-based index to map a hierarchy of attribute values associated with each data element onto a point of a MLHT (which itself conceptually maps onto a continuous range of values). The total range of the MLHT is divided into one or more data partitions, each of which is mapped to one or more physical storage resources. A mapping algorithm uses the hierarchy of attribute fields to calculate the position of each data element ingested and, consequently, a physical storage resource at which to store the data element.

Abstract: Methods, systems, and computer-readable media for partition segmenting in a distributed time-series database are disclosed. A first host receives a request to store a data element in a tile comprising linked segments including a head segment and a tail segment. The head and tail segments are associated with the same spatial and temporal boundaries, and the data element is within those boundaries. The first host determines that the data element is not stored in the head segment and forwards the data element to a next segment of the tile. An additional host receives a request to store the data element in the tail segment. The additional host determines that the data element is not stored in the tail segment and then stores the data element in the tail segment.

Abstract: Methods, systems, and computer-readable media for continuous functions in a time-series database are disclosed. A plurality of data points of a time series are stored into one or more storage tiers of a time-series database. The plurality of data points comprise a plurality of discrete measurements at respective timestamps. Using one or more query processors of the time-series database, a query of the time series is initiated. The query indicates a time range. Using the one or more query processors, a continuous function is determined that represents a segment of the time series in the time range. The continuous function is determined based at least in part on the plurality of data points. An operation is performed using the continuous function as an input.