Ontology decomposer

US2016140203A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016140203-A1
Application numberUS-201414777668-A
CountryUS
Kind codeA1
Filing dateNov 19, 2014
Priority dateNov 19, 2014
Publication dateMay 19, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

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.

First claim

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 relationship between the first and second explicit data; partitioning the source ontology into first decomposed data and second decomposed data based on the relationship between the first and second explicit data, 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 and second explicit data, wherein the fundamental ontology includes the first and second explicit data, and the fundamental ontology excludes the third explicit data; and generating fundamental data based on the fundamental ontology and based on the identified relationship between the first and 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 and second explicit data. 4 . The method of claim 1 , wherein partitioning the source ontology includes: 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 and second explicit data, and the first set of relationships is effective to produce a first set of implicit data; and 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 and second explicit data, and the second set of relationships is effective to produce a second set of implicit data. 5 . The method of claim 4 , further comprising: partitioning the source ontology into the first decomposed data based on the first degree; and partitioning the source ontology into the second decomposed data based on the second degree. 6 . The method of claim 5 , 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 and second explicit data, and 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 and third explicit data. 7 . The method of claim 5 , 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. 8 . 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 and second decomposed data is further based on the value. 9 . The method of claim 1 , wherein a first number of pieces of decomposed data is equal to a second number of concealment modules. 10 . 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 relationship between the first and second explicit data; partition the source ontology into first decomposed data and second decomposed data based on the relationship between the first and second explicit data, wherein the first decomposed data includes the first explicit data, and 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. 11 . The system of claim 10 , 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 and second explicit data, wherein the fundamental ontology includes the first and second explicit data, and the fundamental ontology excludes the third explicit data; and generate fundamental data based on the fundamental ontology and based on the identified relationship between the first and second explicit data, wherein the partition of the source ontology is further based on the fundamental data. 12 . The system of claim 10 , wherein the processor is further configured to: 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 and second explicit data, and the first set of relationships is effective to produce a first set of implicit data; and 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. 13 . The system of claim 12 , wherein the processor is further configured to: partition the source ontology into the first decomposed data based on the first degree; and partition the source ontology into the second decomposed data based on the second degree. 14 . The system of claim 12 , 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 and second explicit data, and 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, wherein the first decomposed data includes the first and third explicit data. 15 . The system of claim 10 , wherein the memory is further configured to store a value effective to indicate a number of concealment modules, and the processor

Assignees

Inventors

Classifications

  • G06F16/278Primary

    Data partitioning, e.g. horizontal or vertical partitioning · CPC title

  • Indexing; Data structures therefor; Storage structures · CPC title

  • Data format conversion from or to a database · CPC title

  • Physics · mapped topic

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016140203A1 cover?
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 p…
Who is the assignee on this patent?
Empire Technology Dev Llc
What technology area does this patent fall under?
Primary CPC classification G06F16/278. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu May 19 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).