Restructuring structured payloads for efficient downstream electronic transmission, storage, and processing
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.
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,
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.
2. The computer system of claim 1 , wherein one or more respective condition comprises:
a predetermined other field being present in the structured payload.
3. 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.
4. 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.
5. The computer system of claim 4 , wherein the requesting and receiving are conducted of and from a user via a user interface.
6. The computer system of claim 4 , wherein the requesting and receiving are conducted of and from an application via an application programming interface (API).
7. 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.
8. 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,
wherein the computer-implemented method further comprises:
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.
9. The computer-implemented method of claim 8 , wherein one or more respective condition comprises:
a predetermined other field being present in the structured payload.
10. The computer-implemented method of claim 8 , wherein one or more respective condition comprises:
a value of a predetermined other field in the structured payload satisfying a value condition.
11. The computer-implemented method of claim 8 , 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.
12. The computer-implemented method of claim 11 , wherein the requesting and receiving are conducted of and from a user via a user interface.
13. The computer-implemented method of claim 11 , wherein the requesting and receiving are conducted of and from an application via an application programming interface (API).
14. The computer-implemented method of claim 8 , further comprising:
adding all non-contingently-required fields specified in the schema to the list of required fields.
15. 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,
wherein the compute 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.
16. The non-transitory processor-readable medium of claim 15 , wherein one or more respective condition comprises:
a predetermined other field being present in the structured payload.
17. The non-transitory processor-readable medium claim 15 , wherein one or more respective condition comprises:
a value of a predetermined other field in the structured payload satisfying a value condition.