Multi-Hierarchical Data Storage for Faster Curriculum Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing curriculum mapping systems face challenges in efficiently retrieving and sorting data for individual programs, courses, and modules due to the complexity of storing data for multiple permutations of activities, outcomes, and modules, leading to significant memory requirements and slow data retrieval.
Innovation Solution
Implementing a multi-hierarchical data structure with separate sub-data structures for programs, courses, modules, and activities, and outcomes, linked in sequences to facilitate quick data retrieval by linking sub-data structures directly, reducing the need for extensive database querying.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data for individual programs, courses, modules, and activities are stored in separate databases or a single database with flat structure, then data for multiple permutations can be stored, but data retrieval and sorting become slow and require extensive querying
Solution Approach 1:
The patent segments the curriculum data into a hierarchical structure with separate data structures for programs, courses, modules, and activities. Each level contains only the data relevant to that specific level, allowing the processor to retrieve data by querying only the necessary subset rather than searching through all data permutations. This segmentation enables efficient retrieval while maintaining the ability to store comprehensive curriculum information.
2Adaptability or versatility
If a flat database structure is used to store all curriculum data, then all data can be accessed, but the processor must query for each individual entry relating to programs, courses, or modules
Solution Approach 1:
The patent introduces a hierarchical dimension to the data structure, organizing curriculum data into nested levels (programs containing courses, courses containing modules, modules containing activities). This dimensional organization allows the processor to navigate efficiently through the hierarchy using parent-child relationships, reducing processing complexity while maintaining versatile data access capabilities across all curriculum elements.
3Loss of information
If extensive database querying is performed to retrieve data for programs and their elements, then complete data can be retrieved, but computational resources are consumed
Solution Approach 1:
The patent performs preliminary organization of curriculum data into a hierarchical structure during data entry, establishing parent-child relationships between programs, courses, modules, and activities. This preliminary structuring enables subsequent retrieval operations to efficiently access only the necessary data subsets by traversing the pre-established hierarchy, significantly reducing computational resource consumption while ensuring complete data retrieval when needed.
Data Source
AI summary
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.