Systems and methods for context-independent database search paths
Abstract
The present disclosure provides a computer-implemented method for applying an analysis to a data model comprising data objects. The method may comprise receiving the analysis and the first data model each in semantic format. Next, the analysis and the data model may be computer processed to (i) identify one or more elements missing from the data model and (ii) determine that the analysis is not applicable to the data model upon identification of the one or more elements. The one or more elements may then be presented to a user for adjusting the data model. This may be repeated until the analysis is applicable to the data model. The analysis may then be performed on the data objects of the data model.
Claims
exact text as granted — not AI-modified1 - 20 . (canceled)
21 . A computer-implemented method for applying an analysis to a data model, comprising:
(a) using least domain ontology and semantic technology to generate (i) a semantic representation of the data model and (ii) a semantic format of the analysis; (b) determining that the analysis is applicable to the data model by processing (i) one or more elements of the semantic representation of the data model with (ii) one or more elements of the semantic format of the analysis; and (c) subsequent to (b), transforming the semantic format of the analysis into a search path that is executable to apply the analysis on one or more data objects of the data model.
22 . The computer-implemented method of claim 21 , wherein the one or more data objects are stored in at least one defined fixed data structure.
23 . The computer-implemented method of claim 21 , wherein the semantic representation of the data model is generated by tagging one or more elements of the data model using one or more terms from the domain ontology.
24 . The computer-implemented method of claim 23 , wherein the one or more terms are displayed on a user interface for a user to tag the one or more elements of the data model.
25 . The computer-implemented method of claim 23 , wherein the one or more elements of the data model comprise links, attributes, and nodes of the data model.
26 . The computer-implemented method of claim 23 , wherein the one or more elements of the data model comprise an entity class, a relation between at least two entity classes, or at least one attribute of the entity class.
27 . The computer-implemented method of claim 23 , wherein the one or more terms are imported automatically and displayed to a user on a user interface.
28 . The computer-implemented method of claim 21 , wherein (b) comprises extracting the one or more elements from one or more triples of the semantic format of the analysis and determining that an element is missing from the one or more elements of the data model.
29 . The computer-implemented method of claim 21 , wherein transforming the semantic format of the analysis into the search path comprises identifying one or more operations in the search path and an order thereof
30 . The computer-implemented method of claim 21 , wherein the analysis comprises one or more operations executable on another data model that is different from the data model.
31 . A non-transitory computer-readable medium comprising machine-executable code that, upon execution by a computer, implements a method for applying an analysis to a data model, the method comprising:
(a) using least domain ontology and semantic technology to generate (i) a semantic representation of the data model and (ii) a semantic format of the analysis; (b) determining that the analysis is applicable to the data model by processing (i) one or more elements of the semantic representation of the data model with (ii) one or more elements of the semantic format of the analysis; and (c) subsequent to (b), transforming the semantic format of the analysis into a search path that is executable to apply the analysis on one or more data objects of the data model.
32 . The non-transitory computer-readable medium of claim 31 wherein the one or more data objects are stored in at least one defined fixed data structure.
33 . The non-transitory computer-readable medium of claim 31 , wherein the semantic representation of the data model is generated by tagging one or more elements of the data model using one or more terms from the domain ontology.
34 . The non-transitory computer-readable medium of claim 33 , wherein the one or more terms are displayed on a user interface for a user to tag the one or more elements of the data model.
35 . The non-transitory computer-readable medium of claim 33 , wherein the one or more elements of the data model comprise links, attributes, and nodes of the data model.
36 . The non-transitory computer-readable medium of claim 33 , wherein the one or more elements of the data model comprise an entity class, a relation between at least two entity classes, or at least one attribute of the entity class.
37 . The non-transitory computer-readable medium of claim 33 , wherein the one or more terms are imported automatically and displayed to a user on a user interface.
38 . The non-transitory computer-readable medium of claim 33 , wherein (b) comprises extracting the one or more elements from one or more triples of the semantic format of the analysis and determining that an element is missing from the one or more elements of the data model.
39 . The non-transitory computer-readable medium of claim 33 , wherein transforming the semantic format of the analysis into the search path comprises identifying one or more operations in the search path and an order thereof
40 . The non-transitory computer-readable medium of claim 31 , wherein the analysis comprises one or more operations executable on another data model that is different from the data model.Join the waitlist — get patent alerts
Track US2023075655A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.