# US 2025/0094402 A1 · Analytical platform for distributed data

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

- Number: US 2025/0094402 A1
- Document ID: US20250094402A1
- Status: Published application
- Kind: A1
- Application number: 18/961,841
- Filed: 2024-11-27
- Published: 2025-03-20
- Earliest claimed: 2020-01-30
- Assignees: PagerDuty, Inc.
- Applicants: PagerDuty, Inc.
- Inventors: Christopher Phillip Bonnell
- Web page: https://patentgrep.com/patent/US20250094402A1

## CPC

- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/2465: {Query processing support for facilitating data mining operations in structured databases}
- G06F 9/30014: {with variable precision}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06F 16/242: Query formulation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A tree data structure that includes an exponential root node and a plurality of regular child nodes arranged in hierarchical levels is generated. A number of the hierarchical levels corresponds to a specified precision value. A numerical data value is received. The numerical data value is truncated according to the specified precision value to generate a truncated value. Portions of the truncated value are stored in the tree data structure by storing an exponent of the truncated value in the exponential root node, and storing each significant digit of the truncated value in a respective regular child node based on significance level. Statistical information is computed for each node storing a portion of the truncated value. The statistical information is provided in response to a query.

## Claims

### Claim 1

A method comprising:
generating a tree data structure comprising an exponential root node and a plurality of regular child nodes arranged in hierarchical levels, wherein a number of the hierarchical levels corresponds to a specified precision value;
receiving a numerical data value;
truncating the numerical data value according to the specified precision value to generate a truncated value;
storing portions of the truncated value in the tree data structure by:
storing an exponent of the truncated value in the exponential root node; and
storing each significant digit of the truncated value in a respective regular child node based on significance level;
computing statistical information for each node storing a portion of the truncated value; and
providing the statistical information in response to a query.

### Claim 2 (depends on 1)

The method of claim 1, wherein computing the statistical information comprises:
computing a count of data values inserted at each node.

### Claim 3 (depends on 1)

The method of claim 1, wherein computing the statistical information comprises:
computing a sum of data values inserted at each node.

### Claim 4 (depends on 1)

The method of claim 1, wherein computing the statistical information comprises:
computing a count of data values inserted at each node; and
computing a sum of the data values stored at the each node.

### Claim 5 (depends on 1)

The method of claim 1, wherein generating the tree data structure comprises:
initializing the plurality of regular child nodes as empty nodes.

### Claim 6 (depends on 1)

The method of claim 1, wherein the specified precision value represents a number of significant figures to be stored for numerical data values.

### Claim 7 (depends on 1)

The method of claim 1,
wherein the exponential root node stores an exponent indicating a magnitude of the numerical data value, and
wherein the regular child nodes store mantissa digits of the numerical data value.

### Claim 8 (depends on 1)

The method of claim 1, wherein storing the each significant digit comprises:
storing digits in successive hierarchical levels based on decreasing significance.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
sampling the numerical data value from a data stream at predetermined intervals.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
receiving a second numerical data value;
truncating the second numerical data value according to the specified precision value to obtain truncated second numerical data value; and
updating the statistical information for nodes storing portions of the truncated second numerical data value.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
receiving multiple numerical data values; and
processing the multiple numerical data values in a single pass to compute the statistical information.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
merging the tree data structure with a second tree data structure by:
identifying overlapping nodes between the tree data structure and the second tree data structure; and
combining the statistical information for the overlapping nodes.

### Claim 13 (depends on 1)

The method of claim 1, wherein the query comprises a request for approximate answers to database queries.

### Claim 14 (depends on 1)

The method of claim 1, wherein the specified precision value is configurable and controls value quantization behavior across a value range.

### Claim 15

An apparatus, comprising:
a memory; and
a processor, the processor configured to execute instructions stored in the memory to:
generate a tree data structure comprising an exponential root node and a plurality of regular child nodes arranged in hierarchical levels, wherein a number of the hierarchical levels corresponds to a specified precision value;
receive a numerical data value;
truncate the numerical data value according to the specified precision value to generate a truncated value;
store portions of the truncated value in the tree data structure, wherein to store the portions of the truncated value in the tree data structure comprises to:
store an exponent of the truncated value in the exponential root node; and
store each significant digit of the truncated value in a respective regular child node based on significance level;
compute statistical information for each node storing a portion of the truncated value; and
provide the statistical information in response to a query.

### Claim 16 (depends on 15)

The apparatus of claim 15,
wherein the exponential root node stores an exponent indicating a magnitude of the numerical data value, and
wherein the regular child nodes store mantissa digits of the numerical data value.

### Claim 17 (depends on 15)

The apparatus of claim 15, wherein to store the each significant digit comprises to:
store digits in successive hierarchical levels based on decreasing significance.

### Claim 18

A non-transitory computer readable medium storing instructions operable to cause a processor to perform operations comprising:
generating a tree data structure comprising an exponential root node and a plurality of regular child nodes arranged in hierarchical levels, wherein a number of the hierarchical levels corresponds to a specified precision value;
receiving a numerical data value;
truncating the numerical data value according to the specified precision value to generate a truncated value;
storing portions of the truncated value in the tree data structure by:
storing an exponent of the truncated value in the exponential root node; and
storing each significant digit of the truncated value in a respective regular child node based on significance level;
computing statistical information for each node storing a portion of the truncated value; and
providing the statistical information in response to a query.

### Claim 19 (depends on 18)

The non-transitory computer readable medium of claim 18, the operations further comprising:
receiving a second numerical data value;
truncating the second numerical data value according to the specified precision value to obtain truncated second numerical data value; and
updating the statistical information for nodes storing portions of the truncated second numerical data value.

### Claim 20 (depends on 18)

The non-transitory computer readable medium of claim 18, the operations further comprising:
merging the tree data structure with a second tree data structure by:
identifying overlapping nodes between the tree data structure and the second tree data structure; and
combining the statistical information for the overlapping nodes.
