# US 2025/0071378 A1 · Unification reduction of complex traversal and search application programming interface

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

- Number: US 2025/0071378 A1
- Document ID: US20250071378A1
- Status: Published application
- Kind: A1
- Application number: 18/238,030
- Filed: 2023-08-25
- Published: 2025-02-27
- Earliest claimed: 2023-08-25
- Assignees: Roku, Inc.
- Applicants: Roku, Inc.
- Inventors: Donald R. Woodward, JR.
- Web page: https://patentgrep.com/patent/US20250071378A1

## CPC

- G06F 16/9027: {Trees}
- H04N 21/4435: {Memory management (allocation of memory to service a request G06F9/5016; addressing or allocating within memory systems or architectures G06F12/02)}
- G06F 16/282: {Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes}
- H04N 21/4431: {characterized by the use of Application Program Interface [API] libraries}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for searching for and reading data from a hierarchical data set stored in a database accessible to a network device such as a media device or a display device. An example embodiment operates by the media device receiving a request for the data in the hierarchical data set where the request is implemented as a unified application programming interface (API) traversal function that is configured with an overloaded search parameter and an integer marker for tracking a current position of the unified API traversal function within the hierarchical data set. The unified API traversal function enables a single call to be initiated for data within the hierarchical data set without the need to call additional API callback functions to traverse the data set.

## Claims

### Claim 1

A computer-implemented method for a media device identifying data stored within a hierarchical data set, comprising:
receiving a request for the data;
parsing the request to identify a search parameter, wherein a first value of the search parameter indicates a first type of traversal of the hierarchical data set and a second value of the search parameter indicates a second type of traversal of the hierarchical data set;
performing a traversal of the hierarchical data set based on the first value of the search parameter or the second value of the search parameter; and
tracking a position in the hierarchical data set during the traversal.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the hierarchical data set is formatted in a tree structure.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the request for the data is implemented as a unified traversal application programming interface (API) function.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the first value comprises a search string, wherein the traversal is the first type of traversal, and the first type of traversal is a resource search of the hierarchical data set, and wherein the resource search returns a result from the hierarchical data set that matches the search string.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the second value comprises a null value, wherein the traversal is the second type of traversal, wherein the hierarchical data set comprises a plurality of nodes, and the second type of traversal is a scan of the hierarchical data set, and wherein the scan returns a plurality of values corresponding to the plurality of nodes.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the hierarchical data set is implemented as an extensible markup language (XML) tree.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the hierarchical data set is implemented as a javascript object notation (JSON) tree.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the hierarchical data set comprises a plurality of nodes and wherein tracking the position in the hierarchical data set during the traversal comprises:
incrementing an integer marker for each node of the plurality of nodes that is traversed during the traversal.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the hierarchical data set is stored as a precompiled binary representation of a resource tree in a flash memory of the media device.

### Claim 10

A system, comprising:
one or more memories;
at least one processor each coupled to at least one of the one or more memories and configured to perform operations for identifying data stored within a hierarchical data set, the operations comprising:
receiving a request for the data;
parsing the request to identify a search parameter, wherein a first value of the search parameter indicates a first type of traversal of the hierarchical data set and a second value of the search parameter indicates a second type of traversal of the hierarchical data set;
performing a traversal of the hierarchical data set based on the first value of the search parameter or the second value of the search parameter; and
tracking a position in the hierarchical data set during the traversal.

### Claim 11 (depends on 10)

The system of claim 10, wherein the hierarchical data set is formatted in a tree structure.

### Claim 12 (depends on 10)

The system of claim 10, wherein the request for the data is implemented as a unified traversal application programming interface (API) function.

### Claim 13 (depends on 10)

The system of claim 10, wherein the first value comprises a search string, wherein the traversal is the first type of traversal, and the first type of traversal is a resource search of the hierarchical data set, and wherein the resource search returns a result from the hierarchical data set that matches the search string.

### Claim 14 (depends on 10)

The system of claim 10, wherein the second value comprises a null value, wherein the traversal is the second type of traversal, wherein the hierarchical data set comprises a plurality of nodes, and the second type of traversal is a scan of the hierarchical data set, and wherein the scan returns a plurality of values corresponding to the plurality of nodes.

### Claim 15 (depends on 10)

The system of claim 10, wherein the hierarchical data set is implemented as an extensible markup language (XML) tree.

### Claim 16

A non-transitory computer-readable medium having instructions stored thereon that, when executed by at least one computing device, cause the at least one computing device to perform operations for identifying data stored within a hierarchical data set, the operations comprising:
receiving a request for the data;
parsing the request to identify a search parameter, wherein a first value of the search parameter indicates a first type of traversal of the hierarchical data set and a second value of the search parameter indicates a second type of traversal of the hierarchical data set;
performing a traversal of the hierarchical data set based on the first value of the search parameter or the second value of the search parameter; and
tracking a position in the hierarchical data set during the traversal.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the hierarchical data set is formatted in a tree structure.

### Claim 18 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the request for the data is implemented as a unified traversal application programming interface (API) function.

### Claim 19 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the first value comprises a search string, wherein the traversal is the first type of traversal, and the first type of traversal is a resource search of the hierarchical data set, and wherein the resource search returns a result from the hierarchical data set that matches the search string.

### Claim 20 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the second value comprises a null value, wherein the traversal is the second type of traversal, wherein the hierarchical data set comprises a plurality of nodes, and the second type of traversal is a scan of the hierarchical data set, and wherein the scan returns a plurality of values corresponding to the plurality of nodes.
