Dynamic selection of source table for db rollup aggregation and query rewrite based on model driven definitions and cardinality estimates
US-2015379080-A1 · Dec 31, 2015 · US
US9870404B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9870404-B2 |
| Application number | US-201214399065-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 7, 2012 |
| Priority date | Sep 7, 2012 |
| Publication date | Jan 16, 2018 |
| Grant date | Jan 16, 2018 |
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.
When plural processing programs for generating post-processing data which is a source of services to be provided are present, a relationship between post-processing data and a data group which is a source of the post-processing data is managed. The processing units acquire pre-processing data, execute given processing, and generate post-processing data as a result of the processing. At an opportunity to acquire the pre-processing data, a process ID indicative of ordering of the acquisition, and not updated before and after the given processing is allocated to acquired pre-processing data. The generated post-processing data is stored, and in extracting the post-processing data satisfying the given data search condition, the post-processing data having a process ID equal to or before the process ID that is latest in the post-processing data and oldest among the respective processing units is extracted from the post-processing data that satisfies the data search condition.
Opening claim text (preview).
The invention claimed is: 1. A computer system, comprising: a computer coupled to a storage device, a communication interface, and a non-transitory computer readable medium storing instructions, that when executed by the computer, cause the computer to: execute a plurality of processing units that each acquire pre-processing data, each execute given processing on the pre-processing data, and each generate post-processing data as a result of the processing; newly allocate a respective process identifier (ID) from among a plurality of process IDs for one of the plurality of processing units each time the one of the plurality of processing units is to acquire the pre-processing data, wherein the process IDs collectively indicate an order of acquisition of the pre-processing data by the plurality of processing units; manage a process management ID table that includes information of the processing units in correspondence with the process IDs which have been allocated to the processing units when the pre-processing data has been acquired by the processing units, the process management ID table being managed in ascending order of the process IDs; store the post-processing data generated by the processing of each of the plurality of processing units in the storage device in association with the corresponding allocated process IDs; determine the post-processing data that satisfies a received data search condition from a search request source; and extract the post-processing data associated with a same or earlier process ID than a first process ID that is earliest among the respective latest allocated processing IDs of the plurality of the processing units from the determined post-processing data that satisfies the data search condition, and output the extracted post-processing data to the search request source. 2. The computer system according to claim 1 , wherein the process IDs are information indicating respective times at which the processing units acquire the pre-processing data. 3. The computer system according to claim 1 , wherein the process IDs are managed in association with identification information of the plurality of processing units that acquire the pre-processing data. 4. The computer system according to claim 1 , wherein the non-transitory computer readable medium further stores instructions, that when executed by the computer, cause the computer to: store dependency information indicating a dependency of the plurality of processing units, and extract the post-processing data having a same or earlier process ID than a second process ID that is earliest among the respective latest allocated processing IDs of the processing units having the dependency from the post-processing data that satisfies the data search condition. 5. The computer system according to claim 1 , wherein the non-transitory computer readable medium further stores instructions, that when executed by the computer, cause the computer to: store value management information that defines information indicative of a value of each of the generated post-processing data for each of the plurality of processing units, and generate value information of the extracted post-processing data with reference to the value management information, output the extracted post-processing data when the value of the extracted post-processing data is a predetermined value or smaller to the search request source, and output the generated value information to the search request source when the value of the extracted post-processing data is larger than the predetermined value. 6. The computer system according to claim 5 , wherein the non-transitory computer readable medium further stores instructions, that when executed by the computer, cause the computer to: receive a request for acquiring the extracted post-processing data from the search request source after outputting the generated value information, and transmit the extracted post-processing data corresponding to the generated value information to the search request source. 7. The computer system according to claim 5 , wherein the value of each of the generated post-processing data defined by the value management information is a price per unit data amount. 8. The computer system according to claim 6 , wherein the value of each of the generated post-processing data defined by the value management information is a price per unit data amount. 9. The computer system according to claim 1 , further comprising: a data storage computer, coupled to the computer, having a storage unit that stores the pre-processing data acquired by the plurality of processing units, wherein the storage unit includes an external data acquisition unit that acquires the pre-processing data stored in an external computer connected thereto through a communication line, and stores the acquired pre-processing data in the storage unit when the plurality of processing units request to acquire the pre-processing data. 10. The computer system according to claim 9 , wherein the data storage computer further includes a data format conversion unit that converts the pre-processing data acquired from the external computer into a another data format. 11. The computer system according to claim 10 , wherein the non-transitory computer readable medium further stores instructions, that when executed by the computer, cause the computer to: store data acquisition schedule information in which timings at which the plurality of processing units acquire the pre-processing data stored in the storage unit of the data storage computer is defined for each of the processing units, and acquire the pre-processing data on the basis of the data acquisition schedule information. 12. A data management method for a computer system including a plurality of processing units that each acquire pre-processing data, each execute a given processing on the pre-processing data, and each generate post-processing data as a result of the processing, and transmit a search result in response to a request for searching the post-processing data, the method comprising: newly allocating a respective process identifier (ID) from among a plurality of process IDs for one of the plurality of processing units each time the one of the plurality of processing units is to acquire the pre-processing data, wherein the process IDs collectively indicate an order of acquisition of the pre-processing data by the plurality of processing units; managing a process management ID table that includes information of the processing units in correspondence with the process IDs which have been allocated to the processing units when the pre-processing data has been acquired by the processing units, the process management ID table being managed in ascending order of the process IDs; storing the post-processing data generated by the processing of each of the processing units in a storage device in association with the corresponding allocated process IDs; determining the post-processing data that satisfies a received data search condition from a search request source; and extracting the post-processing data associated with a same or earlier process ID than a first process ID that is earliest among the respective latest allocated processing IDs of the plurality of the processing units from the determined post-processing data that satisfies the search condition, and outputting the extracted post-processing data to the search request source. 13. A non-transitory computer readable recording medium storing a program for causing a computer system having a plurality of processing units to each execute processing to acquire pre-processi
for electronic clinical trials or questionnaires · CPC title
Accessing, addressing or allocating within memory systems or architectures (digital input from, or digital output to record carriers, e.g. to disk storage units, G06F3/06) · CPC title
Solving problems relating to consistency · CPC title
Data logging (G06F11/14, G06F11/2205 take precedence) · CPC title
Error detection; Error correction; Monitoring (error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.