Validating modifications to mapping statements for processing hierarchical data structures
US-11074231-B1 · Jul 27, 2021 · US
US2021096932A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2021096932-A1 |
| Application number | US-201916586578-A |
| Country | US |
| Kind code | A1 |
| Filing date | Sep 27, 2019 |
| Priority date | Sep 27, 2019 |
| Publication date | Apr 1, 2021 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The present disclosure describes systems and methods for processing schemas to generate set representations thereof. Schema set representations can be used to generate schema coverage notifications. Set operations can be performed on schemas to compare schemas and identify whether any support changes have been made thereto.
Opening claim text (preview).
1 . A computer implemented method for generating a schema coverage notification, the method comprising: accessing an input schema; for each of a plurality of data types, processing the input schema to: determine that the input schema imposes two or more constraints on values of the data type; analyse the two or more constraints to determine if any constraint contradictions exist; and in response to determining that a constraint contradiction exists, generating a contradiction message including data with respect to the constraint contradiction identified. 2 . The computer implemented method of claim 1 further comprising processing the input schema to generate a type set representation for each of the plurality of data types, and wherein determining that the input schema imposes two or more constraints on values of a given data type comprises analyzing the type set representation in respect of the given data type. 3 . The computer implemented method of claim 1 , wherein determining that a constraint contradiction exists comprises: analysing the constraints imposed on the given type by the input schema against a contradiction rule set, the contradiction rule set defining one or more contradiction rules; and determining that two constraints imposed on the data type by the input schema match a contradiction rule. 4 . The computer implemented method of claim 1 , wherein determining that a constraint contradiction exists comprises: analysing the constraints imposed on the given type by the input schema against a contradiction rule set, the contradiction rule set defining one or more contradiction rules; and determining that three or more constraints imposed on the data type by the input schema match a contradiction rule. 5 . The computer implemented method of claim 1 , wherein prior to processing the input schema to for each data type the method comprises: processing the input schema to initially determine whether the input schema is intended to accept some values, all values, or no values; and wherein processing the input schema for each of the plurality of data types is only performed in response to initially determining that the input schema is intended to accept some values. 6 . The computer implemented method of claim 5 , wherein the input schema is initially determined to be a schema intended to accept some values if the input schema is not a Boolean value. 7 . The computer implemented method of claim 1 , wherein prior to determining that the input schema imposes two or more constraints on values of a particular data type the method further comprises: determining whether the input schema supports the particular data type; and wherein determining that the input schema imposes two or more constraints on values of the particular data type is only performed in response to determining that the input schema supports the particular data type. 8 . The computer implemented method of claim 1 , wherein the contradiction message causes a contradiction interface to be displayed on a display, the contradiction interface displaying information on the constraint contradiction identified. 9 . The computer implemented method of claim 8 , wherein the information displayed by the contradiction interface includes information on the nature of the contradiction identified in the input schema together with location information indicating where in the input schema the contradiction was identified. 10 . The computer implemented method claim 1 , wherein the data types are selected from a group comprising: a number type; a string type; an object type; and an array type. 11 . A system comprising: one or more processors; one or more non-transitory computer-readable storage media storing sequences of instructions which, when executed by the one or more processors, cause the one or more processors to: access an input schema; for each of a plurality of data types, process the input schema to: determine that the input schema imposes two or more constraints on values of the data type; analyse the two or more constraints to determine if any constraint contradictions exist; and in response to determining that a constraint contradiction exists, generate a contradiction message including data with respect to the constraint contradiction identified. 12 . The system of claim 11 , wherein execution of the sequences of instructions causes the one or more processors to process the input schema to generate a type set representation for each of the plurality of data types, and wherein determining that the input schema imposes two or more constraints on values of a given data type comprises analyzing the type set representation in respect of the given data type. 13 . The system of claim 11 , wherein determining that a constraint contradiction exists comprises: analysing the constraints imposed on the given type by the input schema against a contradiction rule set, the contradiction rule set defining one or more contradiction rules; and determining that two or more constraints imposed on the data type by the input schema match a contradiction rule. 14 . The system of claim 11 , wherein prior to processing the input schema to for each data type execution of the sequences of instructions cause the one or more processors to: process the input schema to initially determine whether the input schema is intended to accept some values, all values, or no values; and wherein processing the input schema for each of the plurality of data types is only performed in response to initially determining that the input schema is intended to accept some values. 15 . The system of claim 14 , wherein the input schema is initially determined to be a schema intended to accept some values if the input schema is not a Boolean value. 16 . The system of claim 11 , wherein prior to determining that the input schema imposes two or more constraints on values of a particular data type execution of the sequences of instructions cause the one or more processors to: determine whether the input schema supports the particular data type; and wherein determining that the input schema imposes two or more constraints on values of the particular data type is only performed in response to determining that the input schema supports the particular data type. 17 . The system of claim 11 , wherein the contradiction message causes a contradiction interface to be displayed on a display, the contradiction interface displaying information on the constraint contradiction identified. 18 . The system of claim 17 , wherein the information displayed by the contradiction interface includes information on the nature of the contradiction identified in the input schema together with location information indicating where in the input schema the contradiction was identified. 19 . The system of claim 11 , wherein the data types are selected from a group comprising: a number type; a string type; an object type; and an array type. 20 . Non-transitory computer-readable storage media storing sequences of instructions which, when executed by one or more processors, cause the one or more processors to: determine that the input schema imposes two or more constraints on values of the data type; analyse the two or more constraints to determine if any constraint contradictions exist; and in response to determining that a constraint contradiction exists, generate a contradiction message including data with respect to the constraint contradiction identified.
with details for data modelling support · CPC title
Event management; Broadcasting; Multicasting; Notifications · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.