# US 2026/0140966 A1 · Systems and methods for a multi-hierarchy physical storage architecture for managing program and outcome data

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

- Number: US 2026/0140966 A1
- Document ID: US20260140966A1
- Status: Published application
- Kind: A1
- Application number: 19/446,735
- Filed: 2026-01-12
- Published: 2026-05-21
- Earliest claimed: 2022-03-03
- Assignees: iDesignEDU, LLC
- Applicants: iDesignEDU, Inc.
- Inventors: Paxton Riter; Ned Stone; Whitney Kilgore; Krista Galyen; Sam Foster; Andreas Buchmann; Derek Howard
- Web page: https://patentgrep.com/patent/US20260140966A1

## CPC

- G06F 16/282: {Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes}
- G06F 16/211: {Schema design and management}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/2272: {Management thereof}
- G06F 16/2282: {Tablespace storage structures; Management thereof}
- G06F 16/243: {Natural language query formulation}
- G06F 16/2457: with adaptation to user needs
- G06F 16/248: Presentation of query results
- G06F 16/26: Visual data mining; Browsing structured data
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In some aspects, the disclosure is directed to methods and systems for data storage and retrieval from a computer memory. A computing device may store a first hierarchical data structure having a first sequence of sub-data structures and a second hierarchical data structure having a second sequence of sub-data structures in memory. The computing device may link the first hierarchical data structure and the second hierarchical data structure together. The computing device may link the first hierarchical data structure and the second hierarchical data structure by inserting an identifier of a sub-data structure of the second sequence in the first sequence.

## Claims

### Claim 1

A computer-implemented method for data storage for efficient retrieval from a computer memory, the method comprising:
receiving, by a computing device, an input data file including a spreadsheet comprising a plurality of rows and a plurality of columns, the columns including at least a program identifier column, a course identifier column, a module identifier column, and an activity identifier column, each row defining a relationship among a program, a course, a module, and an activity;
parsing, by the computing device, the spreadsheet to extract, from each row, values corresponding to the program identifier, course identifier, module identifier, and activity identifier;
determining, by the computing device for each extracted value, whether a corresponding sub-data structure already exists within a dual-hierarchical data structure stored in memory;
in response to determining that a corresponding sub-data structure does not exist, generating a new sub-data structure for the program, course, module, or activity represented by the extracted value;
inserting, by the computing device into one or more generated or preexisting sub-data structures of the dual-hierarchical data structure, attribute data extracted from one or more columns of the spreadsheet, the attribute data comprising at least a time-on-task estimate;
linking, by the computing device, the sub-data structures generated or identified from each row into a hierarchical sequence defining parent-child relationships among programs, courses, modules, and activities;
updating, by the computing device when a newly generated activity sub-data structure is linked to a module sub-data structure, a module-level time-on-task value stored in the module sub-data structure based on the time-on-task estimate of the activity, and further updating a course-level time-on-task value stored in the course sub-data structure based on aggregated time-on-task estimates of associated modules of the course sub-data structure; and
storing, in memory, the dual-hierarchical data structure comprising the linked program, course, module, and activity sub-data structures generated from the spreadsheet.

### Claim 2 (depends on 1)

The method of claim 1, wherein the spreadsheet further comprises columns specifying activity type, Bloom's taxonomy level, and time-on-task estimate, and
wherein the inserting comprises populating, by the computing device, corresponding fields of activity sub-data structures with values from those columns.

### Claim 3 (depends on 1)

The method of claim 1, wherein linking the sub-data structures comprises:
storing, by the computing device within each sub-data structure, an identifier of at least one adjacent sub-data structure to define parent-child relationships among programs, courses, modules, and activities.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
updating, by the computing device, a module-level time-on-task value in a module sub-data structure based on a time-on-task estimate of a newly linked activity; and
updating, by the computing device, a course-level time-on-task value based on aggregated module-level time-on-task values.

### Claim 5 (depends on 1)

The method of claim 1, wherein the dual-hierarchical data structure is implemented in a graph database or relational database.

### Claim 6 (depends on 1)

The method of claim 1, wherein the program, course, module, and activity sub-data structures are realized as models in a content framework that includes textual identifiers, type descriptors, and descriptions of respective programs, courses, modules, or activities.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
generating overlapping sequences within the dual-hierarchical data structure by linking, by the computing device, a course sub-data structure to multiple module sub-data structures and the module sub-data structures to different activity sub-data structures, thereby forming multiple paths through the dual-hierarchical data structure.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
storing an outcome hierarchical data structure and a program curriculum hierarchical data structure in the dual-hierarchical data structure, the outcome hierarchical data structure including program outcomes, course outcomes, and module outcomes; and
linking terminal activity sub-data structures in the program curriculum hierarchical data structure of the dual-hierarchical data structure to terminal outcome sub-data structures in the outcome hierarchical data structure of the dual-hierarchical data structure for faster request retrieval.

### Claim 9 (depends on 8)

The method of claim 8, wherein the linking comprises tagging a terminal activity sub-data structure with an identifier of a terminal outcome sub-data structure that lacks a child sub-data structure.

### Claim 10 (depends on 8)

The method of claim 8, further comprising:
aggregating, by the computing device automatically or in response to receiving a request, time-on-task across the linked hierarchical data structures to compute module outcome, course outcome, and program outcome time-on-task estimates; and
storing, by the computing device, the computed aggregates within corresponding outcome sub-data structures.

### Claim 11 (depends on 8)

The method of claim 8, further comprising:
storing permission identifiers in the outcome hierarchical data structure to distinguish local outcome sets accessible to users of an associated partner from global outcome sets accessible to all authenticated users.

### Claim 12

A system for data storage for efficient retrieval from a computer memory, comprising:
one or more processors configured by computer-readable instructions to:
receive an input data file comprising a spreadsheet comprising a plurality of rows and columns including at least program, course, module, and activity identifiers, each row defining a relationship among a program, a course, a module, and an activity;
parse the spreadsheet to extract, from each row, values for the program, course, module, and activity identifiers;
determine for each extracted value whether a corresponding sub-data structure already exists within a dual-hierarchical data structure stored in memory;
in response to determining that a corresponding sub-data structure does not exist, generate a new sub-data structure for the program, course, module, or activity represented by the extracted value;
insert attribute data extracted from one or more columns of the spreadsheet into one or more generated or preexisting sub-data structures of the dual-hierarchical data structure;
link the generated or identified sub-data structures into a hierarchical sequence defining parent-child relationships among programs, courses, modules, and activities; and
update, when a newly generated activity sub-data structure is linked to a module sub-data structure, a module-level time-on-task value in the module sub-data structure based on the time-on-task of the activity, and further update a course-level time-on-task value in the course sub-data structure based on aggregated module-level time-on-task values.

### Claim 13 (depends on 12)

The system of claim 12, wherein the spreadsheet further comprises columns specifying activity type, Bloom's taxonomy level, and time-on-task estimate, and
the instructions cause the one or more processors to populate corresponding fields of activity sub-data structures with values from those columns.

### Claim 14 (depends on 12)

The system of claim 12, wherein the instructions further cause the one or more processors to:
link the sub-data structures by storing, within each sub-data structure, an identifier of at least one adjacent sub-data structure to define parent-child relationships among programs, courses, modules, and activities.

### Claim 15 (depends on 12)

The system of claim 12, wherein the instructions further cause the one or more processors to:
update a module-level time-on-task value in a module sub-data structure based on a time-on-task estimate of a newly linked activity; and
update a course-level time-on-task value based on aggregated module-level time-on-task values.

### Claim 16 (depends on 12)

The system of claim 12, wherein the dual-hierarchical data structure is implemented in a graph database or relational database.

### Claim 17 (depends on 12)

The system of claim 12, wherein the program, course, module, and activity sub-data structures are realized as models in a content framework that includes textual identifiers, type descriptors, and descriptions of respective programs, courses, modules, or activities.

### Claim 18 (depends on 12)

The system of claim 12, wherein the instructions further cause the one or more processors to:
generate overlapping sequences by linking a course sub-data structure to multiple module sub-data structures and linking the module sub-data structures to different activity sub-data structures, thereby forming multiple paths through the dual-hierarchical data structure.

### Claim 19

Non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the processors to perform a method for data storage for efficient retrieval from a computer memory, the method comprising:
receiving an input data file comprising a spreadsheet with rows and columns including at least program, course, module, and activity identifiers, each row defining a relationship among a program, a course, a module, and an activity;
parsing the spreadsheet to extract, from each row, values corresponding to the program, course, module, and activity identifiers;
determining for each extracted value whether a corresponding sub-data structure already exists within a dual-hierarchical data structure stored in memory;
in response to determining that a corresponding sub-data structure does not exist, generating a new sub-data structure for the program, course, module, or activity represented by the extracted value;
inserting attribute data extracted from one or more additional spreadsheet columns into each generated or preexisting sub-data structure;
linking the sub-data structures generated or identified from each row into a hierarchical sequence defining parent-child relationships among programs, courses, modules, and activities; and
updating, when a newly generated activity sub-data structure is linked to a module sub-data structure, a module-level time-on-task value in the module sub-data structure based on the time-on-task of the activity, and further updating a course-level time-on-task value in the course sub-data structure based on aggregated module-level time-on-task values.

### Claim 20 (depends on 19)

The non-transitory computer-readable media of claim 19, wherein the method further comprises:
storing an outcome hierarchical data structure and a program curriculum hierarchical data structure in the dual-hierarchical data structure, the outcome hierarchical data structure including program outcomes, course outcomes, and module outcomes; and
linking terminal activity sub-data structures in the program curriculum hierarchical data structure of the dual-hierarchical data structure to terminal outcome sub-data structures in the outcome hierarchical data structure of the dual-hierarchical data structure.
