Node Graph Data Storage for Real-Time Cross-Clinic Patient Records
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Storing patient data across different clinics in a healthcare system results in repetitive data entries, large memory requirements, and difficulty in real-time data retrieval due to the analog process and lack of a centralized database, leading to inefficient clinician workflows.
Innovation Solution
Implementing a node graph data structure that stores patient data in a centralized system, using nodes and edges to link related data, with prioritized queuing and edge weighting to ensure quick access to high-priority information and maintain historical relationships.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a centralized database is implemented to store patient data across multiple clinics, then data retrieval speed and clinician efficiency are improved, but the complexity of data management and system implementation increases
Solution Approach 1:
The patent segments patient data into discrete nodes (patient nodes, visit nodes, diagnosis nodes, etc.) that can be independently stored and managed. Each node contains specific attributes related to a particular aspect of patient care, allowing the system to handle complex medical data through modular, manageable units rather than monolithic database entries.
Solution Approach 2:
The patent transitions from traditional tabular database structures to a graph-based data model with multiple dimensions. Nodes can have multiple attributes and relationships, enabling the system to represent complex medical relationships (patient-visit-diagnosis-treatment) in a multi-dimensional space that improves retrieval efficiency while managing complexity through structured relationships.
2Loss of information
If all patient data from multiple clinics is stored in a single database, then comprehensive patient history is achieved, but memory requirements and data storage costs increase
Solution Approach 1:
The patent merges data from multiple clinics into a unified graph structure where related data elements are consolidated into shared nodes. When the same patient visits multiple clinics, their demographic information, medical history, and other static data are stored once in a single patient node, while visit-specific data are stored in separate visit nodes that reference the patient node, eliminating redundancy and reducing overall storage requirements.
Solution Approach 2:
The patent uses reference copying rather than data duplication. Instead of copying patient demographic data into each visit record, the system creates visit nodes that contain references (foreign keys) to the patient node. This allows comprehensive patient history to be accessed from any visit node without actually duplicating the underlying patient data, significantly reducing memory requirements.
3Loss of time
If data is stored in traditional database format with separate entries for each clinic visit, then data structure simplicity is maintained, but data retrieval time increases due to repetitive queries
Solution Approach 1:
The patent performs preliminary organization of data into a graph structure during data ingestion, creating nodes and edges that represent relationships between patients, visits, diagnoses, and treatments. This preliminary structuring enables efficient querying later, as the system can traverse pre-established relationships rather than performing repetitive full-table scans or complex joins across multiple clinic databases.
Solution Approach 2:
The patent introduces visit nodes as intermediaries between patient nodes and diagnosis/treatment nodes. These intermediary nodes capture the temporal and contextual relationships of specific clinic visits, allowing the system to efficiently retrieve visit-specific information while maintaining connections to the broader patient history, thus reducing retrieval time without excessive structural complexity.
Data Source
AI summary
The present disclosure describes a method for updating a node graph data structure, comprising storing a node graph data structure comprising a plurality of entity nodes and a plurality of attribute nodes; receiving, from a data source during a plurality of time periods, a plurality of data files comprising data for a first entity; identifying a plurality of edges between a first entity node of the plurality of entity nodes that identifies the first entity and an attribute node of the plurality of attribute nodes that identifies a first attribute of the first entity, each of the plurality of edges corresponding to a value and a different time period; and updating a value stored in a data structure for an edge that corresponds to a time period associated with a data file.


