IP Library Granted Patent US 10,402,380
Granted Patent B1
US 10,402,380 · App. 15/975,317 · Granted Sep 3, 2019

Interactive user interface for schema transformation

Inventors: Michael R. Carr (Bremen, GA); William E. Henry (Dallas, TX); Alen J. Pulido (Miramar, FL); Joshua A. Siegel (Miami, FL)
Assignee: CARECLOUD CORPORATION
G06F16/213G06F9/451G06F16/248G06F16/2433G06F16/252
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,402,380
App. No.
15/975,317
Granted
Sep 3, 2019
Kind
B1
Abstract

According to an embodiment of the present invention, a system provides a graph that identifies data mapping rules for a data transformation type and comprises: a display interface configured to present a plurality of distinct node types, each with a distinct location and is displayed at corresponding a first display location, a second display location and a third display location on the display surface, a first distinct node type is a pure data type with one or more value output ports; a second distinct node type is a data mapping type with one or more value input ports and at least one output port; and a third distinct node type is a sequence instruction type with one or more stream input ports and at least one output data transform port; a computer processor that generates a rules configuration representing a graph construct; and a memory that stores the rules configuration.

Claims (61)

1. A system for providing a graph that identifies data mapping rules for a data transformation type, the system comprising:

a display interface configured to present a plurality of distinct node types, each with a distinct location and is displayed at corresponding a first display location, a second display location and a third display location on the display surface, the plurality of distinct node types comprising:

a first distinct node type that is a pure data type with one or more value output ports;

a second distinct node type that is a data mapping type with one or more value input ports and at least one output port; and

a third distinct node type that is a sequence instruction type with one or more stream input ports and at least one output data transform port, wherein the sequence instruction type represents a sequence rule as a guiding parser that sequences a state machine that receives data tree mapping node type outputs and in a designated order constructs a tree of valid segment representations;

a computer processor that generates a rules configuration representing a graph construct; and

a memory that stores the rules configuration;

wherein the display interface is coupled to the computer processor and the memory; and

wherein the computer processor applies the rules configuration to generate the data mapping rules, generates an in-memory tree structure based on a schema definition for the in-memory tree structure, wherein the schema definition is generated by defining a schema in a visually declarative schema definition language, populates the in-memory tree structure with data received at the one or more value input ports based on the data mapping rules, and transforms the in-memory tree structure into a data structure or object.

2. The system of claim 1 , wherein the display interface provides the graphing construct, the display interface is configured to:

receive a first user input specifying a first drawing of a displayed linkage between a first node type port output and a second node type port input; and

receive a second user input specifying a second drawing of a displayed linkage between a second node type port output and a third node type port input.

3. The system of claim 2 , wherein the display interface is further configured to:

receive at least a third user input specifying a third drawing of a displayed linkage between an output port of a second data mapping type node and a second input port of the sequence node.

4. The system of claim 2 , wherein the display interface is further configured to:

receive at least a third user input specifying a third drawing of a displayed linkage between an output port of a second sequence node and a second input port of the sequence node.

5. The system of claim 2 , wherein the display interface is further configured to:

receive at least a third user input specifying a third drawing of a displayed linkage between one or more output ports of a second pure data type node and one or more input ports of a second sequence node type.

6. The system of claim 1 wherein an input of a sequence instruction node includes a starting port, where the starting port identifies the start sequencing of data within the sequence instruction node.

7. The system of claim 6 , wherein a first input port and a second input port structures the order of the sequencing of data streams as per the sequence instruction node's instructions within the sequence instruction node.

8. The method of claim 1 , wherein the computer processor validates the rules configuration based on a schema definition.

9. A method for providing a graph that identifies data mapping rules for a data transformation type, the method comprising the steps of:

presenting, via a display interface, a plurality of distinct node types, each with a distinct location and is displayed at corresponding a first display location, a second display location and a third display location on the display surface, the plurality of distinct node types comprising:

a first distinct node type that is a pure data type with one or more value output ports;

a second distinct node type that is a data mapping type with one or more value input ports and at least one output port; and

a third distinct node type that is a sequence instruction type with one or more stream input ports and at least one output data transform port, wherein the sequence instruction type represents a sequence rule as a guiding parser that sequences a state machine that receives data tree mapping node type outputs and in a designated order constructs a tree of valid segment representations;

generating, via a computer processor, a rules configuration representing a graph construct;

applying, via the computer processor, the rules configuration to generate the data mapping rules;

generating, via the computer processor, an in-memory tree structure based on a schema definition for the in-memory tree structure, wherein the schema definition is generated by defining a schema in a visually declarative schema definition language;

populating, via the computer processor, the in-memory tree structure with data received at the one or more value input ports based on the data mapping rules;

transforming, via the computer processor, the in-memory tree structure into a data structure or object; and

storing, via a memory, the rules configuration;

wherein the display interface is coupled to the computer processor and the memory.

10. The method of claim 9 , further comprising the steps of:

receiving a first user input specifying a first drawing of a displayed linkage between a first node type port output and a second node type port input; and

receiving a second user input specifying a second drawing of a displayed linkage between a second node type port output and a third node type port input.

11. The method of claim 10 , further comprising the steps of:

receiving at least a third user input specifying a third drawing of a displayed linkage between an output port of a second data mapping type node and a second input port of the sequence node.

12. The method of claim 10 , further comprising the steps of:

receiving at least a third user input specifying a third drawing of a displayed linkage between an output port of a second sequence node and a second input port of the sequence node.

13. The method of claim 10 , further comprising the steps of:

receiving at least a third user input specifying a third drawing of a displayed linkage between one or more output ports of a second pure data type node and one or more input ports of a second sequence node type.

14. The method of claim 9 , wherein an input of a sequence instruction node includes a starting port, where the starting port identifies the start sequencing of data within the sequence instruction node.

15. The method of claim 14 , wherein a first input port and a second input port structures the order of the sequencing of data streams as per the sequence instruction node's instructions within the sequence instruction node.

16. The method of claim 9 , further comprising the step of:

validating, via the computer processor, the rules configuration, based on a schema definition.

17. A method for generating a graph that identifies data mapping rules for a transaction type, the method comprising the steps of:

identifying a transaction type;

retrieving, using a computer processor, a set of nodes to construct a graph for the transaction type;

providing, via the graphical user interface, a graphing construct and a plurality of graphing actions; the graphing construct comprising:

an input that selects at least one data node from the set of nodes, the data node having one or more associated data elements;

a linking input that links a data element of the data node to a corresponding input of a relationship node;

a sequence input that identifies a sequence for a plurality of relationship nodes, wherein the sequence for the relationship nodes is of a sequence instruction type that represents a sequence rule as a guiding parser that sequences a state machine that receives data tree mapping node type outputs and in a designated order constructs a tree of valid segment representations;

generating, using the computer processor, a rules configuration representing the graphic construct;

applying, using the computer processor, the rules configuration to generate the data mapping rules;

generating, using the computer processor, an in-memory tree structure based on a schema definition for the in-memory tree structure, wherein the schema definition is generated by defining a schema in a visually declarative schema definition language;

populating, using the computer processor, the in-memory tree structure with data received at the one or more value input ports based on the data mapping rules;

transforming, using the computer processor, the in-memory tree structure into a data structure or object; and

storing, in a memory, the rules configuration.

18. The method of claim 17 , further comprising the step of:

validating, using the computer processor, the rules configuration, based on a schema definition.

Assignments (4)
SECURITY INTEREST Recorded Aug 28, 2026
From: CARECLOUD HEALTH, INC.,
To: CITIZENS BANK, N.A.
Reel/Frame 075818/0419 →
RELEASE OF SECURITY INTEREST Recorded Aug 14, 2025
From: RUNWAY GROWTH CREDIT FUND INC.
To: CARECLOUD CORPORATION
Reel/Frame 072020/0388 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 7, 2019
From: CARR, MICHAEL R.; HENRY, WILLIAM E.; PULIDO, ALEN J.; SIEGEL, JOSHUA A.
To: CARECLOUD CORPORATION
Reel/Frame 049400/0182 →
SECURITY INTEREST Recorded Jun 19, 2018
From: CARECLOUD CORPORATION
To: RUNWAY GROWTH CREDIT FUND INC.
Reel/Frame 046134/0838 →
Cited By (2)
US 12,379,836 US 12,670,175