JP2014013519A - Data specification method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To suppress prolonged batch centralized processing time posterior to determination in data specification (search) such as the lottery(winning) number determination of lottery.SOLUTION: Processing of generating and totaling all combined numbers derived from application numbers until lottery numbers are determined and processing of storing combined numbers as the candidates of winning numbers of each rank in a table different for each rank makes it possible to solve the above mentioned problem. Also, the combination of unit data as the candidates of each portion corresponding data is stored in a table different for each hierarchy of each portion corresponding data such that the processing can be quickened. Furthermore, those processing may be used for the lottery number specification of lottery.

Description

  The present invention relates to a technique for extracting data that matches a predetermined condition from a large amount of data. In particular, the present invention relates to a technique for speeding up the calculation of the winning number in the winning number calculating system.

  Currently, a large amount of data is generally handled due to the spread of cloud computing. However, when the amount of data becomes large, it becomes difficult to extract desired data (calculation of the number of data satisfying a predetermined condition) from the data. For example, in a service such as a lottery ticket, if there are a large number of participants and each designates a plurality of numbers, the amount of data handled becomes large. When the winning number is determined, it is necessary to grasp the total prize amount according to the number of units. However, when a large amount of data is handled, it takes time to calculate the number of units.

  For example, Patent Document 1 has been proposed in order to solve such a problem in data extraction for a large amount of data. Japanese Patent Application Laid-Open No. 2004-151858 discloses that search efficiency is improved by classifying and managing a large number of files.

  In addition, for information processing in a lottery that is an application example of the present invention, Patent Document 2 describes a technique for improving the efficiency of payment processing.

  The purchaser selects any nine numbers from 60 numbers from 1 to 60 prepared in advance. At this time, the lottery number announced by the organizer is a combination of 16 numbers {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }, The set of numbers such as 1 is {1, 2, 3, 4, 5, 6, 7, 8, 9} or {2, 3, 4, 5, 6, 7, 8, 9 , 10}, etc., and there are a plurality of combinations even if only 1 is. Hereafter, nine selected numbers such as {1, 2, 3, 4, 5, 6, 7, 8, 17} and {2, 3, 4, 5, 6, 7, 8, 9, 17} It becomes 2 etc. when eight numbers correspond to a lottery number among combinations.

JP 2003-167767 A JP 2006-107333 A

  However, in Patent Document 1, it is necessary to perform pre-processing for associating attribute information used for search with a file in advance. Here, in the lottery, it is desired to calculate the winning result number from all application data after the lottery number is confirmed. Along with this, there is a problem that data extraction for specifying the number of winning units from purchase or the like is not realistic in Patent Document 1 in which preprocessing is performed. In other words, Patent Document 1 has a problem that it is difficult to cope with a short time from data collection to data extraction. Further, when the number of data (application data) to be handled increases, there is a concern that the collective centralized processing may take a long time.

  Patent Document 2 determines whether or not the presented lottery ticket has been won, and does not take into account the extraction of a specific item from a large amount of data (calculation of the number of winning results).

  An object of the present invention is to provide a technique for extracting specific data from a large amount of data (for example, calculation in a short time after announcement of a lottery result).

In order to achieve this object, the present invention has the following configuration.
Store a plurality of target data consisting of combinations of unit data in advance,
Select a unit data number that is a combination of unit data and is larger than the number of unit data constituting the target data, and generate the corresponding data.
Generate a plurality of partial corresponding data consisting of a combination of unit data constituting the generated corresponding data and having a smaller number of unit data than the number of unit data constituting the target data,
Identify target data that satisfies multiple partial corresponding data, calculate the total number of identified target data,
Among the identified target data, the overlap number in each partial corresponding data is calculated and subtracted from the total number of target data to identify the number of target data that matches the partial corresponding data.

  Here, the plurality of partial corresponding data have a hierarchical structure and are configured by different numbers of unit data, and the unit data constituting the lower partial corresponding data is included in the unit data constituting the upper partial corresponding data. It is what The unit data includes a single digit number.

  Furthermore, the present invention is applicable to the identification of a winning number such as a lottery ticket. In other words, in a number selection type lottery, a 10-digit number is specified as the corresponding data, and if several digits (the higher the number of digits, etc.) match, the winning is made. In this case, the target data is a number (in a specific digit) selected by the purchaser, and a plurality of partial corresponding data indicate the winning numbers of each.

  In this case, first, it is confirmed whether there is a combination number, whether there is the same combination data, each combination number derived from the application number is generated and counted before the lottery number is confirmed.

  Further, in the present invention (including the case where it is applied to other than lottery), the combination of unit data as candidates for each partial corresponding data is stored in a different table for each hierarchical level of each partial corresponding data, thereby speeding up the processing. It is also one mode.

  According to the present invention, it is possible to more efficiently identify information that matches a predetermined condition.

It is a system configuration outline figure of an embodiment of the invention. It is a flowchart which produces | generates the combination number derived | led-out from the application number. It is a flowchart which calculates a winning result. It is a detailed flowchart for storing combination data in a combination table. It is an example of the application table which stores application data. It is an example of a combination (first etc.) table for storing first candidate combination data derived from application data. It is an example of a combination (second etc.) table storing combination data of second choice candidates derived from application data. It is an example of a combination (3 etc.) table storing combination data of 3rd candidate candidates derived from application data. It is an example of the data related figure of an application table and the combination (n etc.) table of each equal number. It is an example of a winning result table storing winning result data.

EMBODIMENT OF THE INVENTION Below, the form for implementing this invention is demonstrated using drawing.
FIG. 1 is an overall system configuration schematic diagram showing an embodiment of the present invention. Reference numeral 100 is an application receiving apparatus, 200 is an AP server, and 300 is a data storage server, and each apparatus is connected via a network. The data storage server 300 has a table for storing data, 310 is an application table, 320 is a combination (n etc.) table, and 330 is a winning result table. The application accepting apparatus 100 is an apparatus in which the person in charge of the application uses the application numbers purchased for participating in each lottery, and transmits the application numbers and the number of applications (application data) from this apparatus to the AP server 200. The AP server 200 allocates application data to the data storage server 300 in which application numbers for each lottery are distributed and transmits the lottery results to the application reception apparatus 100. The data storage server 300 applies the application data received from the AP server 200 to the application table 310, the combination number generated from the application data and the combination number (combination data) to the combination (n etc.) table 320, the equal number and the combination (n etc.) The winning number (winning result data) generated from the table 320 is stored in the winning result table 330, and the lottery result is transmitted to the AP server 200.

FIG. 2 is a flowchart for generating a combination number of application numbers. Hereinafter, the processing contents will be described for each step.
410: Each application data is stored in the application table 310 in response to the application data input from the application reception apparatus 100.

  420: When the application data is stored in the application table 310, a combination number of application numbers is generated. At this time, the combination numbers are generated in order from the higher order equality (1st order → 2nd order → 3rd order →...), But it is also possible to generate the combination numbers in order from the lower order equality. The process is repeated until the lowest equal number combination number is generated.

  430: Store the generated combination data in the combination (n etc.) table 320 for each equal number. At this time, since combination data is stored in the combination (n etc.) table 320 for each equal number, it is possible to process in parallel for each equal number. The processing is repeated until all the combination data derived from the application data is stored, and the processing is repeated in the order of 410 → 420 → 430 until the application data is input.

FIG. 3 is a flowchart for calculating the winning result. Hereinafter, the contents will be described step by step.
440: When the lottery number is confirmed, a winning number derived from the lottery number is generated. At this time, the winning numbers are generated in order from the higher equality, but may be generated in order from the lower equality. The process repeats until all winning numbers are generated.

  450: When the generation of each winning number is completed, the winning number is searched from the winning number to each combination (n, etc.) table, and if the corresponding winning number exists, the number of the number Is added. If the corresponding combination number does not exist in the combination (n etc.) table 320, the next winning number is processed without doing anything. At this time, since the combination (n etc.) table 320 is searched from the winning numbers for every equal number, it is possible to process in parallel for every equal number. As soon as all the winning numbers have been searched, the sum of the number of winning units for each equal number is calculated. The total number of winning units of each equal number can be processed in parallel for each equal number. The process is repeated until the sum of all equal numbers is calculated.

  460: When the calculation of the sum of the winning numbers of each equal number is completed, the winning result number of each etc. is calculated. At this time, the winning number of each equal number is subtracted from the total number of winning numbers in order from the higher number in order to subtract the winning result number of the upper equal number. For example, for 1 etc., there is no number of winning units that overlaps with the upper order number, so the sum of the number of winning units such as 1 is the winning result number. 2nd prize is the total number of winning prizes of 2nd class-nC (n-1) x 1 winning prize number is 1st prize. ) × 1 etc. Winning Result Units + (n-1) C (n-2) × 2 etc. Winning Result Units) becomes the Winning Units, 4th is the sum of 4th etc. Winning Units-(nC (n- 3) × 1 etc. winning results number + (n-1) C (n-3) × 2 winning results number + (n-2) C (n-3) × 3 etc. total winning results number) Is the number of winning units, 5th is the total number of winning units of 5th-(nC (n-4) x 1 winning unit number + (n-1) C (n-4) x 2 winning unit number + (N-2) C (n-4) × 3 etc. winning result number + (n-3) C (n-4) × 4 etc. winning result number) is the winning number. The process is repeated until the winning result number of the lowest equal number is calculated.

  470: When the calculation of the winning result number is completed, the winning result number is stored in the winning result table 330. At this time, the winning result number is stored in the corresponding equal number of records in order from the highest equal number winning result number, but may be stored in order from the lower equal number. The process is repeated until all winning result numbers are stored in the winning result table 330.

FIG. 4 is a detailed flowchart for storing combination data in the combination (n, etc.) table 320. Hereinafter, the contents will be described step by step.
431: 1 is substituted into the equal number n (: natural number) 432: The value of the equal number n and the lowest order equal number m (: natural number) are compared. At this time, m may be different depending on each lottery. When the value of n is less than or equal to m, the process proceeds to 433. If the value of n is larger than m, the process is terminated.

  433: It is determined whether there is a combination number stored in the combination (n etc.) table 320 in the generated combination number. If there is a combination number to be stored in the combination (n etc.) table 320, the process proceeds to step 434. If not, the process proceeds to 438.

  434: It is determined whether the same combination number exists in the combination (n etc.) table. If the same combination number exists in the combination (n etc.) table 320, the process proceeds to 435. If not, the process proceeds to 436.

435: A process of adding the number of combination numbers in the combination (n etc.) table 320 is executed. At this time, the number of combination numbers added is overwritten in the combination (n, etc.) table 320.
436: A process of newly adding combination data in the combination (n etc.) table 320 is executed.
437: The next combination data is acquired.
438: Add 1 to the value of n.

5-10 is a figure explaining the processing content regarding this embodiment using the specific example of an application number.
Example: Nine selectable numbers, three application numbers, five lottery numbers, and the winning lowest equal number are three. In the following, an example is shown in which the lottery applicant selects three from 1 to 9 selectable numbers, and six applicants purchase the application numbers one by one.
Applicant 1: Application number {1, 3, 5}, Number: 1 Applicant 2: Application number {2, 4, 6}, Number: 1 Applicant 3: Application number {1, 2, 3}, Number of units: 1 applicant 4: Application number {4, 5, 6}, Number of applications: 1 Applicant 5: Application number {5, 6, 7}, Number of applications: 1 Applicant 6: Application number {6, 7 , 8}, 1 mouth.

  FIG. 5 is an example of an application table 310 that stores application data. The application table 310 stores application numbers and the number of applications for the applicants 1 to 6. At this time, in order to store the application data in consideration of the relationship between the applicant and the application data in consideration of future service expansion, etc., a serial number is assigned and managed in the order of application.

  FIG. 6 is an example of a combination (first etc.) table storing candidate first grade data derived from application data. Reference numeral 321 denotes a table that stores combination numbers and combination numbers of first-class candidates derived from application data stored in the application table 320. The combination (1 etc.) table 321 is managed without assigning a serial number because it is not stored in consideration of the relationship between the applicant and the combination data.

  FIG. 7 is an example of a combination (second etc.) table for storing candidate combination second grade data derived from application data. A table 322 stores combination numbers and combination numbers of second-class candidates derived from application data stored in the application table 320. The combination (2 etc.) table 322 is managed without assigning a serial number because it is not stored in consideration of the relationship between the applicant and the combination data.

  FIG. 8 is an example of a combination (3 etc.) table storing candidate 3 grade candidate data derived from the application data. A table 323 stores combination numbers and combination numbers of third-class candidates derived from application data stored in the application table 320. In the combination (3 etc.) table 323, since the relation between the applicant and the combination data is not stored, it is managed without assigning a serial number.

  FIG. 9 is an example of a data relation diagram of the application table 310 and each combination (n etc.) table 320 derived from application data. The application data stored in the application table 310 is a combination (1 etc.) table 321, a combination (2 etc.) table 322, and a combination (3 etc.) table 323. The combination data generated from the application data is stored in each table. To do. At this time, since combination data is stored in the combination (n etc.) table 320 stored for each equal number, it is possible to process in parallel for each equal number.

  FIG. 10 is an example of a winning result table 330 that stores winning result data. The winning result table 330 stores an equal number and a winning result number. In this example, the total number of winning units such as 1st is 2 units in total: Applicant 1 {1, 3, 5} and Applicant 3 {1, 2, 3}. {1,3} 2 ports, {1,5} 1 port, {3,5} 1 port, {2,4} 1 port, {1,2} 1 port {2,3} 1 port, {4, The total number of winning units such as 3 etc. is {1} 2, 2 {3}, 2 {5} 3, 2 {2}, 2 {4}. There are a total of 11 ports. Since the number of winning results such as 1 is the same as the number of winning units, it is two. According to the calculation formula of 460 after 2 etc., 8-3 × 2 = 2 units, and 3 etc. is 11− (3 × 2 + 2 × 2) = 1 unit.

  According to the present embodiment, the combination numbers derived from the application numbers and the number of combinations are counted before the lottery number is determined, and the combination numbers that are candidates for the equal number of winning numbers are different for each equal number. By storing in the table, it becomes possible to access the table in parallel for every equal number, so that the batch concentration process after the determination of the lottery number can be shortened. Further, even when the number of application data increases, this processing uses a processing method that depends on the number of winning numbers, so the load of the batch centralized processing can be reduced.

100 Application receiving device 200 AP server 300 Data storage server 310 Application table 320 Combination (n etc.) table 321 Example of combination (1 etc.) table 322 Example of combination (2 etc.) table 323 Example of combination (3 etc.) table 330 Winning Results table

Claims (4)

Store a plurality of target data consisting of combinations of unit data in advance,
Select a unit data number that is a combination of unit data and is larger than the number of unit data constituting the target data, and generate the corresponding data.
Generate a plurality of partial corresponding data consisting of a combination of unit data constituting the generated corresponding data and having a smaller number of unit data than the number of unit data constituting the target data,
Identify target data that satisfies multiple partial corresponding data, calculate the total number of identified target data,
Among the identified target data, the number of target data matching the partial corresponding data is specified by calculating the duplication number of each partial corresponding data and subtracting it from the total number of target data. Data identification method. The data identification method according to claim 1,
The plurality of partial corresponding data have a hierarchical structure and are configured by different numbers of unit data, and unit data constituting lower partial corresponding data is included in unit data constituting upper partial corresponding data. Characteristic data identification method. In the data identification method of Claim 2,
A combination of unit data that is candidates for the partial corresponding data is stored in a different table for each layer of the partial corresponding data, and the duplication calculation is performed. In the data identification method according to any one of claims 1 to 3,
The target data is a multi-digit application number selected by the user,
A data identification method for identifying a winning number generated as the partial corresponding data from the application number.

Images