# US 2024/0004883 A1 · Data ingestion with spatial and temporal locality

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0004883 A1
- Document ID: US20240004883A1
- Status: Published application
- Kind: A1
- Application number: 17/983,755
- Filed: 2022-11-09
- Published: 2024-01-04
- Earliest claimed: 2020-01-07
- Assignees: Elastic Flash Inc.
- Applicants: Elastic Flash Inc.
- Inventors: Darshan Bharatkumar Rawal; Naoki Iwakami; Pradeep Jnana Madhavarapu
- Web page: https://patentgrep.com/patent/US20240004883A1

## CPC

- G06F 16/24568: {Data stream processing; Continuous queries}
- G06F 16/2219: {Large Object storage; Management thereof}
- G06F 16/285: {Clustering or classification}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Implementations described herein relate to methods, systems, and computer-readable media to write data records. In some implementations, a method may include calculating a data rate of a data stream that includes a plurality of data records and determining if the data rate of the data stream is less than an ingest threshold. The method may further include, if the data rate of the data stream is less than the ingest threshold, calculating a number of write requests per time unit based on the data stream; determining a storage capacity per storage bucket; determining a read interval for the data stream; based on the number of write requests per time unit, the storage capacity, and the read interval, selecting a size of time window per storage bucket; and writing the plurality of data records to a particular storage bucket.

## Claims

### Claim 1

A computer-implemented method comprising:
calculating a data rate of a data stream that includes a plurality of data records;
determining if the data rate of the data stream is less than an ingest threshold; and
if the data rate of the data stream is less than the ingest threshold,
calculating a number of write requests per time unit based on the data stream;
determining a storage capacity per storage bucket;
determining a read interval for the data stream;
based on the number of write requests per time unit, the storage capacity, and the read interval, selecting a size of time window per storage bucket; and
writing the plurality of data records to a particular storage bucket.
