JPH0786880B2 - Data storage method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of storing data in which each data is provided with an identification code of a plurality of digits and the plurality of data includes common data.

[0002]

2. Description of the Related Art FIG. 8 is a diagram showing an example of JAN code master data in which a product classification code and a product name are compared with each other. The classification code is attached to each product of each sales company.
Used for product barcodes.

9 to 11 are conceptual diagrams showing a storage state of the above-mentioned JAN code master data by a conventional storage method. Conventionally, one record stores data having a fixed-length numerical data part and a variable-length character string data part in a tree structure of a binary tree. That is, as shown in FIG. 9, a pointer indicating the storage position of the character string data is stored in association with the numerical data portion, and the branch destination from the numerical data is stored as the left and right branch pointers. The character string data is shown in Figure 1.
As shown by 0, they are stored at the addresses indicated by the pointers. FIG. 11 is a conceptual diagram showing a storage state of the tree structure data as described above.

[0004]

In the conventional data storage method as described above, like the JAN code master data, a character string code common to a large number of data such as a sales company name and corresponding numerical data are stored. Even when storing data including all, since all data of each record is stored in different storage areas, the same data is stored as the number of records increases, which causes a problem that the storage area usage efficiency decreases. there were.

The present invention has been made in order to solve such a problem, and stores a common data with another record at the same address so that a data storage method with high utilization efficiency of a storage area is provided. For the purpose of provision.

[0006]

According to the data storage method of the present invention, the identification code of the data and the data consisting of a plurality of digits is defined as one record, and one element of the data of one record is identified as one element of another record. If they are the same, in the method of storing the data in which the same value is set in the digit part of each identification code corresponding to the same data element, each digit value of the identification code becomes deeper in the digit order. Are stored in the list for each digit value specified from, and the node address of the next digit is stored in each list, and among the data elements identified by the identification code from the most significant digit to the relevant digit in the list of predetermined digits, The storage address of the data element excluding the data element identified in the digit higher than the relevant digit is stored, and the data element of each record is the same as that of other records. If the and to store to the same address as the data elements in the record.

[0007]

According to the data storage method of the present invention, the identification code is decomposed into digits, and each digit is assigned to each node of the tree structure that becomes deeper in the digit order, and the node of the next digit is added to the list of digit values specified by each node. In addition to storing the address, in the list of predetermined digits, among the data elements identified by the identification code from the most significant digit to the relevant digit, the storage of data elements excluding the data elements that have been identified by the digits higher than the relevant digit The address is stored, while the data element of each record is stored at the same address of the data element of the record when the data element is the same as the other record. When searching the data stored as above, the node address of the next digit is obtained by the list specified by the node of each digit of the identification code, and the identification code is traced in digit order by the match search, If the storage address of the data element is stored, the data element is read from this storage address, added to the identified data element from the most significant digit to the relevant digit, and when all digits are searched for a match, the data element is read. Output all data elements as search results.

[0008]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below with reference to the drawings showing the embodiments thereof. FIG. 1 is a block diagram showing the configuration of a data processing device for implementing the data storage method according to the present invention.
In the figure, reference numeral 1 denotes an input unit including a keyboard for inputting data such as numerical values and characters and various commands, and the data and commands input from the input unit 1 are input to the data processing unit 2. The data processing section 2 has a numerical data section and a character string data section as 1
The data is read from the database 3 which stores the data to be recorded and processed, and the processing result is C
The image is displayed on the display unit 5 composed of RT and printed on the printer 6. The data processing unit 2 searches the database 3 and stores the search result in the search result character string buffer 4.

The database 3 includes a tree structure data storage unit 31 that stores a numerical data section, which is the identification code, in a tree structure described later, and a character string data section, which is the data, with data elements common to a plurality of records. And an aggregated data storage unit 32 that aggregates and stores them at the same address.

FIG. 2 is a conceptual diagram showing the data structure.
FIG. 2A shows the structure of one record consisting of a fixed-length numerical data part and a variable-length character string data part, and the numerical data part serves as a search key. FIG. 2B shows the structure of each node data 311 in the tree structure, and the data is a pointer to the head element of the bidirectional list.

FIG. 2 (c) is a diagram showing the element structure of the bidirectional list 312, in which each element is a numerical data (numb) from the beginning.
Pointer to aggregated data (comp), pointer to front element
(prev), a pointer to the back element (next), and a pointer to the node data of the next digit (nxcl).

[0012] Figure 3 is a conceptual diagram illustrating the storage state of the data by the data storage method of the present invention, two-way list 31
2 is stored backward from the first bidirectional list 312 pointed to by each node data 311 in ascending numerical data (numb).
And, a pointer to the aggregated data of the two-way list 312 (c
The aggregated data 321 is stored in the address pointed to by ( omp) . Also, the bidirectional list 312 is a multi-digit number.
It is stored in a tree structure that deepens sequentially from the upper digit of the value data part.
ing.

The procedure for searching the data stored by the data storage method of the present invention as described above will be described with reference to FIGS.
It will be described based on the flowchart shown in FIG. In addition, S
[n] is the numerical value of each digit in the numerical data part that serves as the search key, and i is
Order from the most significant digit of each digit in the numerical data part (0 to n),
A is character string data read from the aggregated data 321, N
Is node data, M is element data of bidirectional list 312
(numb, comp, prev, next, nxcl) are set respectively
Indicates the contents of the registered register. The operator searches for J
When the AN code is input from the input section 1, the data processing section 2
First sets each digit of the numerical value of the search key in S [n] (S1). Next, "A" is an empty character string, "i" is "0",
"N" is set to "root node data", that is, a pointer to the bidirectional list of the depth of the first digit of the numerical data part (S2).

Element data of the bidirectional list pointed to by "N" is set in "M" (S3). That is, "Mnum
“B” is a digit of numerical data, “Mcomp” is a pointer to aggregated data, “Mprev” is a pointer to the preceding element, and “M”
Set the pointer to the rear element in "next" and the pointer to the node data of the next digit in "Mnxcl".

"S [i]" is compared with "Mnumb", and if they are not equal, it is determined whether "Mnext" is "0" (S5). If "Mnext" is "0", the search target is not found (S7), and the process ends in error. "Mnex
If t "is not" 0 "," Mnext "is set to" N "(S6), and the process returns to step 3 to examine the next numerical data.

If "S [i]" is equal to "Mnumb" in S4, since it is the numerical data to be obtained, it is determined whether "Mcomp" is "0" (S8). If "Mcomp" is not "0", the aggregated data is stored.
The aggregated data character string pointed to by "Mcomp" is read and added to the end of "A" (S9).

When "Mcomp" is "0" and the aggregated data is not stored, it is judged whether "Mnxcl" is "0" (S10). If "Mnxcl" is not "0", that is, if there is a next digit, the node data pointed to by "Mnxcl" is set to "N" (S11), "i" is incremented (S12), and the step Return to 3 and the above is S [0] to S
[12] Repeat for all digits. When you reach the last digit, "Mn
When "xcl" becomes "0", the character string "A" is output as a search result to the display unit 5, the printer 6 and the like (S13), and the search for one record is completed.

Next, the procedure for retrieving data using "49771710007213" entered by the operator from the input unit 1 as a key will be described based on the conceptual diagrams of the storage state of tree structure data shown in FIGS. In the figure, 61, 64, 66, 68,
70,77 and 80 indicate node data, 62,65,6
7,69,71,72,74,75,78 and 81 indicate the element data of the bidirectional list. Note that, for example, 68 and 69 are linearly connected data. 63, 76 and 79 are aggregated data.

The data processing unit 2 firstly S [0] ← 4, S
[1] ← 9, S [2] ← 7, S [3] ← 1, S [4] ← 7, S
[5] ← 1, S [6] ← 0, S [7] ← 0, S [8] ← 0, S
Set [9] ← 7, S [10] ← 2, S [11] ← 1, S [12] ← 3. "Mnumb" numerical data to "4", "Mcomp" to aggregate data pointer to the "large forest Kose", "Mprev"
When the pointer to the front element is set to, the pointer to the rear element is set to "Mnext", and the pointer to the node data of the next digit "9" is set to "Mnxcl", the key matches the first digit key.
So, the search result character string is 63 for the aggregated data "Obayashi Kose".
Store in buffer 4.

A tree structure in which “i” is incremented 9 times
"497171000" by tracing the stored data of
When the match search is completed up to, the node data 70 of the 10th digit S [9] is reached, and the digit value “7” is set as “Mnumb” of the element data 71 at the head of the bidirectional list pointed to by the node data 70. As a result of comparison, since it is large, branch to the element data 72 at the rear
However, this element data 72 is a pointer (Mco
mp), the pointer to the node data of the next digit
Move to the 11th digit node indicated by the data (nxcl).

Next, the numerical data "0" of the head element data of the bidirectional list pointed to by the node data 73 of the 11th digit S [10].
And the digit value “2” of the 11th digit are larger, branch to the element data 75 at the rear because the digit value and the numerical data “2” of the element data 75 match, the aggregate data “SBS
Cake "to give a 76, the search result of the string buffer 4" (Quick T) R "to" large forest Kose SBS cake (Quick
T) R ”is added. The node data of S [11] at the 12th digit 77
Result of comparing the numerical data and the digit value "1" of the first element data 78 of the bidirectional list pointed to, so consistent, to obtain aggregated data "110" 79, results for the character string buffer 4 "large Hayashi Kose "110" for SBS cake (quick T) R "
"Add.

As a result of comparing the numerical value data of the element data 80 of the bidirectional list pointed to by the node data 80 of the final digit S [12] with the digit value “3” of the final digit, they match and the node data of the next digit. "Mnxc" of element data 81 of the bidirectional list pointed to by
l "is" 0 "because it is, match the search until the final digit is determined to have ended" large forest Kose SBS cake (Quick T)
R110 "and outputs as the search results. As mentioned above, the nodes of the tree structure have roots tracing in the direction of the leaf, when it reaches the end of the leaf" large Lin Kose SBS cake (Quick T)
R110 ”is output as the search result.

In this embodiment, the case of storing the JAN code master data has been described, but the present invention is not limited to this and can be applied to, for example, a zip code.

[0024]

As described above, according to the data storage method of the present invention, common data portions in a plurality of records are aggregated and stored at a common address, so that the storage area can be saved and the storage capacity can be reduced. It has an excellent effect that a huge amount of data can be stored in the storage area.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an apparatus for implementing a data storage method of the present invention.

FIG. 2 is a conceptual diagram showing the structure of data stored by the data storage method of the present invention.

FIG. 3 is a conceptual diagram showing a data storage state according to the data storage method of the present invention.

FIG. 4 is a flowchart showing a search procedure for data stored by the data storage method of the present invention.

FIG. 5 is a flowchart showing a search procedure for data stored by the data storage method of the present invention.

FIG. 6 is a conceptual diagram showing a relationship between a data storage state and a search procedure according to the data storage method of the present invention.

FIG. 7 is a conceptual diagram showing a relationship between a data storage state and a search procedure according to the data storage method of the present invention.

FIG. 8 is a diagram showing an example of JAN code master data.

FIG. 9 is a conceptual diagram showing a storage state of a numerical data section according to a conventional data storage method.

FIG. 10 is a conceptual diagram showing a storage state of a character string data section according to a conventional data storage method.

FIG. 11 is a conceptual diagram showing a data storage state according to a conventional data storage method.

[Explanation of symbols]

 1 Input Section 2 Data Processing Section 3 Database 4 Search Result Character String Buffer 31 Tree Structure Data Storage Section 32 Aggregated Data Storage Section

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Kiyoshi Fukuyama 4-17 96 Tsurumi, Tsurumi-ku, Osaka-shi, Osaka Prefecture Tsubakimoto Chain Co., Ltd. (72) Hironori Yoshimura 4-17 Tsurumi, Tsurumi-ku, Osaka-shi, Osaka No. 96, Tsubakimoto Chain Co., Ltd. (56) Reference JP 59-5370 (JP, A) JP 62-20027 (JP, A) JP 63-104133 (JP, A)

Claims (1)

[Claims] 1. A data and an identification code of the data consisting of a plurality of digits are defined as one record, and when a partial element of the data of one record is the same as a partial element of another record, each corresponds to the same data element. In the method of storing data in which the same value is set in the digit part of the identification code, each digit value of the identification code is stored in the list by digit value specified from each node of the tree structure that becomes deeper in the digit order. In addition, the node address of the next digit is stored in each list, and the data identified by the digit higher than the digit among the data elements identified by the identification code from the most significant digit to the digit in the list of the predetermined digit The storage address of the data element excluding the element is stored, and the data element of each record is the same as the data element of the record when the data element is the same as the other record. A data storage method characterized by storing data without a reply.