IP Library › Patent Application 19254573
Patent Application
App. No. 19/254,573

RESTRUCTURING STRUCTURED PAYLOADS FOR EFFICIENT DOWNSTREAM ELECTRONIC TRANSMISSION, STORAGE, AND PROCESSING

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 None
App. No.
19/254,573
Abstract

Disclosed herein is a computer system and method for restructuring a structured payload for efficient downstream storage, transmission, and processing, in which a schema specifies fields including at least one contingently-required field. At least one processor is configured to: retrieve the schema and the structured payload from processor-readable memory; evaluate, for each contingently-required field in the schema, whether a respective condition in the schema is either satisfied or unsatisfied by content in the structured payload; responsive to a respective condition being satisfied, add the contingently-required field to a list of required fields; responsive to a respective condition being unsatisfied, add the contingently-required field to a list of removed fields; and generate a restructured payload by: adding to the structured payload all fields in the list of required fields that are missing; and removing from the structured payload all fields in the list of removed fields that are present.

Claims (84)

1 . A computer system for restructuring a structured payload, the computer system comprising:

processor-readable memory storing:

a schema, wherein the schema specifies fields including at least one contingently-required field; and

the structured payload;

and

at least one processor configured to:

retrieve the schema and the structured payload from the processor-readable memory;

evaluate, for each contingently-required field in the schema, whether a respective condition in the schema is either satisfied or unsatisfied by content in the structured payload;

responsive to a respective condition being satisfied, add the contingently-required field to a list of required fields;

responsive to a respective condition being unsatisfied, add the contingently-required field to a list of removed fields; and

generate a restructured payload by:

adding to the structured payload all fields in the list of required fields that are missing; and

removing from the structured payload all fields in the list of removed fields that are present.

2 . The computer system of claim 1 , wherein the at least one processor is further configured to:

remove all contingently-required fields from the list of required fields;

remove all contingently-required fields from the list of removed fields;

evaluate, for each contingently-required field in the schema, whether the respective condition in the schema is either satisfied or unsatisfied by content in the restructured payload;

responsive to a respective condition being satisfied, add the contingently-required field to the list of required fields;

responsive to a respective condition being unsatisfied, add the contingently-required field to the list of removed fields; and

generate a further restructured payload by:

adding to the restructured payload all fields in the list of required fields that are missing; and

removing from the restructured payload all fields in the list of removed fields that are present.

3 . The computer system of claim 1 , wherein one or more respective condition comprises:

a predetermined other field being present in the structured payload.

4 . The computer system of claim 1 , wherein one or more respective condition comprises:

a value of a predetermined other field in the structured payload satisfying a value condition.

5 . The computer system of claim 1 , wherein adding to the structured payload all fields in the list of required fields that are missing comprises:

requesting, in respect of each field in the list of required fields that is missing, a corresponding value;

receiving each corresponding value; and

inserting, into the structured payload, each field in the list of required fields that is missing along with the corresponding value.

6 . The computer system of claim 5 , wherein the requesting and receiving are conducted of and from a user via a user interface.

7 . The computer system of claim 5 , wherein the requesting and receiving are conducted of and from an application via an application programming interface (API).

8 . The computer system of claim 1 , wherein the at least one processor is configured to:

add all non-contingently-required fields specified in the schema to the list of required fields.

9 . A computer-implemented method of restructuring a structured payload, wherein a schema for the structured payload specifies fields including at least one contingently-required field, the method comprising:

retrieving the schema and the structured payload from processor-readable memory;

evaluating, for each contingently-required field in the schema, whether a respective condition in the schema is either satisfied or unsatisfied by content in the structured payload;

responsive to a respective condition being satisfied, adding the contingently-required field to a list of required fields;

responsive to a respective condition being unsatisfied, adding the contingently-required field to a list of removed fields; and

generating a restructured payload by:

adding to the structured payload all fields in the list of required fields that are missing; and

removing from the structured payload all fields in the list of removed fields that are present.

10 . The computer-implemented method of claim 9 , further comprising:

removing all contingently-required fields from the list of required fields;

removing all contingently-required fields from the list of removed fields;

evaluating, for each contingently-required field in the schema, whether the respective condition in the schema is either satisfied or unsatisfied by content in the restructured payload;

responsive to a respective condition being satisfied, adding the contingently-required field to the list of required fields;

responsive to a respective condition being unsatisfied, adding the contingently-required field to the list of removed fields; and

generating a further restructured payload by:

adding to the restructured payload all fields in the list of required fields that are missing; and

removing from the restructured payload all fields in the list of removed fields that are present.

11 . The computer-implemented method of claim 9 , wherein one or more respective condition comprises:

a predetermined other field being present in the structured payload.

12 . The computer-implemented method of claim 9 , wherein one or more respective condition comprises:

a value of a predetermined other field in the structured payload satisfying a value condition.

13 . The computer-implemented method of claim 9 , wherein adding to the structured payload all fields in the list of required fields that are missing comprises:

requesting, in respect of each field in the list of required fields that is missing, a corresponding value;

receiving each corresponding value; and

inserting, into the structured payload, each field in the list of required fields that is missing along with the corresponding value.

14 . The computer-implemented method of claim 13 , wherein the requesting and receiving are conducted of and from a user via a user interface.

15 . The computer-implemented method of claim 13 , wherein the requesting and receiving are conducted of and from an application via an application programming interface (API).

16 . The computer-implemented method of claim 9 , further comprising:

adding all non-contingently-required fields specified in the schema to the list of required fields.

17 . A non-transitory processor-readable medium embodying a computer program that is executable by at least one processor for restructuring a structured payload, wherein a schema for the structured payload specifies fields including at least one contingently-required field, the computer program comprising:

computer program code for retrieving the schema and the structured payload from processor-readable memory;

computer program code for evaluating, for each contingently-required field in the schema, whether a respective condition in the schema is either satisfied or unsatisfied by content in the structured payload;

computer program code for responsive to a respective condition being satisfied, adding the contingently-required field to a list of required fields;

computer program code for responsive to a respective condition being unsatisfied, adding the contingently-required field to a list of removed fields; and

computer program code for generating a restructured payload including:

computer program code for adding to the structured payload all fields in the list of required fields that are missing; and

computer program code for removing from the structured payload all fields in the list of removed fields that are present.

18 . The non-transitory processor-readable medium of claim 17 , wherein the computer program further comprises:

computer program code for removing all contingently-required fields from the list of required fields;

computer program code for removing all contingently-required fields from the list of removed fields;

computer program code for evaluating, for each contingently-required field in the schema, whether the respective condition in the schema is either satisfied or unsatisfied by content in the restructured payload;

computer program code for responsive to a respective condition being satisfied, adding the contingently-required field to the list of required fields;

computer program code for responsive to a respective condition being unsatisfied, adding the contingently-required field to the list of removed fields; and

computer program code for generating a further restructured payload including:

computer program code for adding to the restructured payload all fields in the list of required fields that are missing; and

computer program code for removing from the restructured payload all fields in the list of removed fields that are present.

19 . The non-transitory processor-readable medium of claim 17 , wherein one or more respective condition comprises:

a predetermined other field being present in the structured payload.

20 . The non-transitory processor-readable medium claim 17 , wherein one or more respective condition comprises:

a value of a predetermined other field in the structured payload satisfying a value condition.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 30, 2025
From: SHARMA, RISHI, MR.
To: BRIZA, INC.
Reel/Frame 071563/0667 →