Concealing sensitive patterns from linked data graphs
US-2015186653-A1 · Jul 2, 2015 · US
US9740763B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9740763-B2 |
| Application number | US-201414777668-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 19, 2014 |
| Priority date | Nov 19, 2014 |
| Publication date | Aug 22, 2017 |
| Grant date | Aug 22, 2017 |
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.
Technologies are generally described for methods and systems effective to store a source ontology that is effective to represent first explicit data and second explicit data. In an example, a processor may evaluate the source ontology to identify the first explicit data and the second explicit data. The processor may also identify a relationship between the first and second explicit data. The processor may also partition the source ontology into first decomposed data and second decomposed data based on the relationship between the first and second explicit data. The first decomposed data may include the first explicit data, and the second decomposed data may include the second explicit data. The processor may also store the first decomposed data in a first concealment module. The processor may also store the second decomposed data in a second concealment module that may be different from the first concealment module.
Opening claim text (preview).
What is claimed is: 1. A method to store a source ontology that is effective to represent first explicit data and second explicit data, the method comprising: evaluating the source ontology to identify the first explicit data and the second explicit data; identifying a degree of a relationship between the first explicit data and the second explicit data; determining a first degree of the first explicit data, wherein the first degree is effective to indicate a first set of relationships that includes the relationship between the first explicit data and the second explicit data, and wherein the first set of relationships is effective to produce a first set of implicit data; determining a second degree of the second explicit data, wherein the second degree is effective to indicate a second set of relationships that includes the relationship between the first explicit data and the second explicit data, and wherein the second set of relationships is effective to produce a second set of implicit data; partitioning the source ontology into first decomposed data based on the first degree and partitioning the source ontology into second decomposed data based on the second degree, wherein the first decomposed data includes the first explicit data, and the second decomposed data includes the second explicit data; storing the first decomposed data in a first concealment module; and storing the second decomposed data in a second concealment module different from the first concealment module. 2. The method of claim 1 , wherein the source ontology is further effective to represent third explicit data, the method further comprising, prior to partitioning the source ontology: determining that the third explicit data is deduced based on the first explicit data; generating a fundamental ontology based on the first explicit data and the second explicit data, wherein the fundamental ontology includes the first explicit data and the second explicit data, and wherein the fundamental ontology excludes the third explicit data; and generating fundamental data based on the fundamental ontology and based on the identified degree of relationship between the first explicit data and the second explicit data, wherein partitioning the source ontology is further based on the fundamental data. 3. The method of claim 2 , wherein the fundamental data includes an indication of the relationship between the first explicit data and the second explicit data. 4. The method of claim 1 , wherein the source ontology is further effective to represent third explicit data, the method further comprising: identifying the third explicit data based on the evaluation of the source ontology; determining a third degree of the third explicit data, wherein the third degree is effective to indicate a third set of relationships that includes the relationship between the first explicit data and the second explicit data, and wherein the third set of relationships is effective to produce a third set of implicit data; and partitioning the source ontology into the first decomposed data is further based on the third degree, wherein the first decomposed data includes the first explicit data and the third explicit data. 5. The method of claim 1 , further comprising: determining that the first degree is greater than the second degree; and in response to the first degree being greater than the second degree, partitioning the source ontology into the first decomposed data prior to partitioning the source ontology into the second decomposed data. 6. The method of claim 1 , prior to partitioning the source ontology, the method further comprising obtaining a value effective to indicate a number of concealment modules, and wherein partitioning the source ontology into the first decomposed data and the second decomposed data is further based on the value. 7. The method of claim 1 , wherein a number of pieces of decomposed data is equal to a number of concealment modules. 8. A system effective to store a source ontology that is effective to represent first explicit data and second explicit data, the system comprising: a memory configured to store the source ontology; a first concealment module; a second concealment module; a processor configured to be in communication with the memory, the first concealment module, and the second concealment module, the processor being configured to: evaluate the source ontology to identify the first explicit data and the second explicit data; identify a degree of a relationship between the first explicit data and the second explicit data; determine a first degree of the first explicit data, wherein the first degree is effective to indicate a first set of relationships that includes the relationship between the first explicit data and the second explicit data, and wherein the first set of relationships is effective to produce a first set of implicit data; determine a second degree of the second explicit data, wherein the second degree is effective to indicate a second set of relationships that includes the relationship between the first and second explicit data, and the second set of relationships is effective to produce a second set of implicit data; partition the source ontology into first decomposed data based on the first degree and partition the source ontology into second decomposed data based on the second degree, wherein the first decomposed data includes the first explicit data, and wherein the second decomposed data includes the second explicit data; store the first decomposed data in the first concealment module; and store the second decomposed data in the second concealment module. 9. The system of claim 8 , wherein the source ontology is further effective to represent third explicit data, the processor being further configured to: determine that the third explicit data is deduced based on the first explicit data; generate a fundamental ontology based on the first explicit data and the second explicit data, wherein the fundamental ontology includes the first explicit data and the second explicit data, and wherein the fundamental ontology excludes the third explicit data; and generate fundamental data based on the fundamental ontology and based on the identified degree of relationship between the first explicit data and the second explicit data, wherein the partition of the source ontology is further based on the fundamental data. 10. The system of claim 8 , wherein the source ontology is further effective to represent third explicit data, the processor being further configured to: identify the third explicit data based on the evaluation of the source ontology; determine a third degree of the third explicit data, wherein the third degree is effective to indicate a third set of relationships that includes the relationship between the first explicit data and the second explicit data, wherein the third set of relationships is effective to produce a third set of implicit data, wherein the partition of the source ontology into the first decomposed data is further based on the third degree, and wherein the first decomposed data includes the first explicit data and the third explicit data. 11. The system of claim 8 , wherein the memory is further configured to store a value effective to indicate a number of concealment modules, and wherein the processor is further configured to partition the source ontology into the first decomposed data and the second decomposed data based on the value. 12. A device effective to partition an ontology that is effective to represent first explicit data and second explicit data, the device comprising: a memory; a receiver unit configured to rec
Data partitioning, e.g. horizontal or vertical partitioning · CPC title
Data format conversion from or to a database · CPC title
Indexing; Data structures therefor; Storage structures · CPC title
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.