Extensible RDF databases
US-9805076-B2 · Oct 31, 2017 · US
US10296496B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10296496-B2 |
| Application number | US-201214342264-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 5, 2012 |
| Priority date | Sep 1, 2011 |
| Publication date | May 21, 2019 |
| Grant date | May 21, 2019 |
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.
A data storage unit of a data editing apparatus stores both a base indicating a data attribute and a data value in association with each other as data to be edited. A code acquisition unit acquires a user code, which is a code described in a first program language for describing data editing details by intensive notation and which describes editing details for the data to be edited that are based on the base. A code generation unit generates, in accordance with a predetermined correspondence relationship between a second program language for describing data editing details by extensive notation and the first program language, an execution code described in the second program language based on the user code. An editing processing unit edits the data to be edited in accordance with the execution code.
Opening claim text (preview).
The invention claimed is: 1. An exchange algebra data editing apparatus comprising: a memory configured to store exchange algebra data to be edited that is composed of a base indicating a data attribute and a data value; a comma separated values (CSV) file; a first processor configured to acquire a first code described by a user in a first program language for describing data editing details by intensive notation which is a method for describing a data set by providing conditions necessary and sufficient for a data to belong to it; a correspondence relationship table configured to store a preset correspondence relationship between the first program language and a second program language for describing data editing details by extensive notation which is a method for describing a data set by listing all elements of the data set; a second processor configured to generate, in accordance with the correspondence relationship stored in the correspondence relationship table, a second code which is an execution code to edit the exchange algebra data based on the base; and an editing processor configured to edit the exchange algebra data automatically in accordance with the second code and output an edited result to the CSV file, wherein when a projection operation specifying both a data set, from which a plurality of exchange algebra data are extracted, and one or more extraction base which serve as a condition for the extraction, is included in the first code, the second processor generates a second code which includes a first repeat order for sequentially listing a plurality of elements included in the data set and a second repeat order for sequentially listing one or more extraction base, and in which a process of extracting an element having the extraction base is described as a repetitive process by these repeat orders. 2. The exchange algebra data editing apparatus according to claim 1 , wherein a numerical value is used as the exchange algebra data value and at least one of a name, a unit, a period, and a subject is used as the base in the data to be edited. 3. The exchange algebra data editing apparatus according to claim 1 , wherein when an aggregation order is included in the first code, the second processor generates, in accordance with information predefining an aggregation base serving as a base that aggregates respective bases of the plurality of pieces of exchange algebra data, a second code for outputting a totalization result that associates a totalization value of the respective values of the plurality of pieces of data with the aggregation base. 4. The exchange algebra data editing apparatus according to claim 3 , wherein the second processor further generates a second code for outputting intermediate data that associates an exchange algebra symbol indicating the subtraction of respective data values of a plurality of pieces of exchange algebra data to be aggregated with the totalization result. 5. A computer-implemented exchange algebra data editing method comprising: storing, in a memory, exchange algebra data to be edited that is composed of a base indicating a data attribute and a data value; acquiring, with a first processor, a first code, which is a code described by a user in a first program language for describing data editing details by intensive notation which is a method for describing a data set by providing conditions necessary and sufficient for a data to belong to it; generating, with a second processor and in accordance with a preset correspondence relationship between the first program language and a second program language for describing data editing details by extensive notation which is a method for describing a data set by listing all elements of the data set, a second code, which is an execution code to edit the exchange algebra data based on the base; and editing, with an editing processor, the exchange algebra data automatically in accordance with the second code and outputting an edited result to a comma separated values (CSV) file, wherein when a projection operation of specifying both a data set, from which a plurality of exchange algebra data are extracted, and one or more extraction base which serve as a condition for the extraction, is included in the first code, a second code is generated, which includes both a first repeat order for sequentially listing a plurality of elements included in the data set and a second repeat order for sequentially listing one or more extraction base, and in which a process of extracting an element having the extraction base is described as a repetitive process by these repeat orders. 6. An exchange algebra data editing apparatus comprising: a memory configured to store exchange algebra data to be edited that is composed of a base indicating a data attribute and a data value; a comma separated values (CSV) file; a first processor configured to acquire a first code described by a user in a first program language for describing data editing details by intensive notation which is a method for describing a data set by providing conditions necessary and sufficient for a data to belong to it; a correspondence relationship table configured to store a preset correspondence relationship between the first language and a second program language for describing data editing details by extensive notation which is a method for describing a set by listing all elements of the data set; a second processor configured to generate, in accordance with the correspondence relationship stored in the correspondence relationship table, a second code which is an execution code to edit the exchange algebra data based on the base and which describes editing details; and an editing processor configured to edit the exchange algebra data automatically in accordance with the second code and output an edited result to the CSV file, wherein when an aggregation order is included in the first code, the second processor generates, in accordance with information predefining an aggregation base serving as a base that aggregates respective bases of the plurality of pieces of exchange algebra data, a second code for outputting a totalization result that associates a totalization value of the respective values of the plurality of pieces of data with the aggregation base, and outputs intermediate data that associates an exchange algebra symbol indicating the subtraction of respective data values of a plurality of pieces of exchange algebra data to be aggregated with the totalization result. 7. An exchange algebra data editing apparatus comprising: a memory configured to store exchange algebra data to be edited that is composed of a base indicating a data attribute and a data value; a comma separated values (CSV) file; a first processor configured to acquire a first code described by a user in a first program language for describing data editing details by intensive notation which is a method for describing a data set by providing conditions necessary and sufficient for a data to belong to it; a correspondence relationship table configured to store a preset correspondence relationship between the first program language and a second program language for describing data editing details by extensive notation which is a method for describing a set by listing all elements of the data set; a second processor configured to generate, in accordance with the correspondence relationship stored in the correspondence relationship table, a second code which is an execution code to edit the exchange algebra data based on the base; and an editing processor configured to edit the exchange algebra data automatically in accordance with the second code and output an edited result to the CSV file.
Related publications grouped by family.
Answers are generated from the same data shown on this page.