JP3605052B2 - Drawing management system with fuzzy search function - Google Patents

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a computer system that manages digitized drawings, and more particularly, to a drawing management system that retrieves an arbitrary drawing file from a drawing database that stores a plurality of drawing files.
[0002]
[Prior art]
Parts drawings of products are used not only in producing the parts, but also frequently in other related departments. For example, the logistics department needs parts drawings to create packaging specifications, and the quality department needs parts drawings for parts acceptance inspections and market inquiries. For this reason, manufacturers must manage part drawings so that common drawings can be used throughout the company.
[0003]
The component drawings to be managed are all the component drawings used in the products from the present to the past. For a large company with a long history, a huge number of drawings must be managed. For example, in an automobile company or the like, the number of parts used for one vehicle type is large, and there are drawings corresponding to the number of parts. Furthermore, the number of drawings increases in accordance with the regular model change of the product.
[0004]
Usually, manufacturers provide a section dedicated to drawing management in order to manage such a huge number of drawings. Conventionally, the drawing management department has managed registered drawings using a recording medium such as a microfilm or paper, but in recent years, with the development of computers, registered drawings have been digitized and managed. A computer system for managing such digitized drawings is called a drawing management system.
[0005]
In the drawing management system, drawings of each part are digitized and centrally managed by a drawing management server installed in a drawing management department. The drawing management department receives the part drawings when the product is mass-produced and the specifications of each part are determined, assigns an identification code that uniquely identifies the part, and stores the drawing file in the drawing database. register.
[0006]
When an in-house user having access to the drawing database wants to view the drawing, the user can browse the drawing corresponding to the identification code by specifying a desired identification code on a terminal interconnected with the drawing management server. .
[0007]
Generally, the identification code given to a drawing is determined so that a person can look at the identification code and guess to some extent what kind of component drawing is the part drawing corresponding to the identification code.
[0008]
FIG. 1 shows one example of the identification code. The identification code is composed of 15-digit characters (including numbers) divided into four parts according to the attribute of the part (type of part, model in which the part is used, etc.). The upper five digits of the 15-digit identification code represent the main number, and the following four digits represent the classification number. The main number and the category number represent the identification code of the parent drawing. The four digits following the main number and the category number represent the type number, which represents the identification code of the child drawing with respect to the parent drawing. Two digits following the type number represent a supplementary number, which is determined as necessary. To each digit, 36 types of characters including numbers 0 to 9 and English characters A to Z are assigned according to the attribute of the component. Since the identification code is assigned a unique identification code for each part drawing without duplication, if the identification code is known, the corresponding drawing is uniquely determined.
[0009]
[Problems to be solved by the invention]
As described above, characters are assigned to each digit of the identification code according to the attribute of the part, so if you are a person who is familiar with the assignment method, you can use the identification code to determine what kind of part drawing it is. Can be inferred to some extent. However, since the number of identification codes is a huge number, it is impossible to completely grasp all the identification codes. Furthermore, the fact that the identification codes are not assigned to the part drawings in a continuous order makes it difficult to grasp the identification codes.
[0010]
For example, when an identification code is assigned to a new part drawing, an empty main number, a classification number, a type number, and a supplementary number are assigned based on the attribute of the part. For this reason, when the identification codes registered in the drawing database are arranged in descending order, the identification codes are not in a continuous order.
[0011]
To explain with a specific example, even if the identification code “17509-S04” is registered in the database, the identification code is not assigned by a serial number, and therefore, the code “17508-S04” which is one immediately before is registered. The identification code is not always registered in the database, and "17509-S03" is not always registered. Such a large number of identification codes and the scattered arrangement of the identification codes make it difficult for the user to search the drawings.
[0012]
For example, if the user does not know the exact identification code of the desired part drawing (ie, the identification code registered in the database), the user will infer the identification code from the attributes of the desired part drawing. Assume that such a user finds a correct identification code based on an ambiguous identification code guessed (that is, an identification code that has not been registered in the database or not).
[0013]
The user will query the drawing management server for an ambiguous identification code and from the response will determine whether the identification code is present in the database. If the ambiguous identification code does not exist in the database, an error is returned from the drawing management server, and the user recognizes from the response that the input identification code does not exist. In that case, the user would again query for a different identification code (probably similar to the one previously entered) and see the response. As a result of such trial and error, the user may be able to obtain the correct identification code, but the trial and error of the user requires a great deal of effort.
[0014]
Therefore, a search means suitable for a large number of scattered identification codes is required. Even if the user does not know the exact identification code and only knows the ambiguous identification code, there is a need for a drawing management system that can appropriately search the identification code registered in the database.
[0015]
SUMMARY OF THE INVENTION It is an object of the present invention to provide a new identification code search means in a drawing management system that manages drawing files using identification codes.
[0016]
[Means for Solving the Problems]
In order to solve the above-mentioned problems, a drawing management system of the present invention is a drawing management system for searching a drawing database for a corresponding drawing file in response to input of an identification code for uniquely identifying a drawing file, Means for determining and storing an identification code assigned to a drawing file stored in a drawing database in a magnitude relation, and responding to a search code input by a user, the identification code storage means based on the magnitude relation Means for searching for an identification code having a value smaller than and closest to the search code.
[0017]
According to the present invention, since the identification code having the closest value smaller than the search code is searched based on the magnitude relation of the identification codes, the identification code having a large mismatch with the characters included in the search code is presented to the user. Can be.
[0018]
According to one embodiment of the present invention, in the drawing management system, the identification code search means searches a plurality of identification codes in order of a larger value from the searched identification codes, and searches the plurality of identification codes. Is configured to be determined by the number specified by the user.
[0019]
According to this aspect, it is possible to search for the number of identification codes as desired by the user, and the identification codes to be searched are selected in ascending order from the identification code having the value closest to the search code.
[0020]
According to one embodiment of the present invention, in the drawing management system, the identification code includes a main number, a classification number, and a type number, and the parent drawing is represented by the main number and the classification number. The means is configured to retrieve an identification code by the main number and the classification number.
[0021]
According to this aspect, the registered identification code is searched based on the main number and the classification number, so that the identification code representing the parent drawing can be searched.
[0022]
According to one embodiment of the present invention, in the drawing management system, the identification code is composed of a combination of 36 types of characters 0 to 9 and A to Z, and the magnitude relation of the identification code is 16 in the EBCDIC code. It is configured to be determined by the magnitude relation of hexadecimal notation.
[0023]
According to this embodiment, the identification code is made up of numbers from 0 to 9 and alphabets from A to Z, and the magnitude of the identification code is represented by a value when those characters are expressed in hexadecimal notation of EBCDIC code.
[0024]
BEST MODE FOR CARRYING OUT THE INVENTION
Next, embodiments of the present invention will be described with reference to the drawings. FIG. 2 shows an outline of an embodiment of the drawing management system of the present invention. FIG. 2 shows a drawing management room 11 in a certain company. In this example, the drawing management room 11 is specifically one room existing in the company premises.
[0025]
A drawing management server 15 connected to a drawing database 17 is installed in the drawing management room 11, and the drawing database 17 is provided with a drawing that has been officially registered in the company (that is, given a formal number and approved). (A completed drawing) is stored as an electronic drawing file.
[0026]
For example, a drawing file is an image file such as a TIFF file, a BMP file, or a JPEG file, and is created by electronically importing a drawing drawn on an actual paper with a scanner or the like. In another embodiment, the format of the drawing file may be a file format based on coordinate data used in a CAD system or the like, instead of an image file.
[0027]
The drawing management server 15 and the drawing database 17 are maintained by the management person in the drawing management section via the management terminal 13. For example, when registering a new part drawing in the drawing database 17, the manager assigns an identification code that can be uniquely identified to the drawing, registers the drawing as an image file in the drawing database 17.
[0028]
When the manager wants to refer to an arbitrary part drawing, he accesses the drawing management server 15 via the management terminal 13 and searches the drawing database 17 using the identification code as a key to manage the drawing corresponding to the identification code. It can be displayed on the monitor of the terminal 13. Further, a printing device such as a printer or a plotter 19 is connected to the drawing management server 15 so that the drawing can be printed out.
[0029]
The drawing management server 15 installed in the drawing management room 11 is connected to a user terminal 27 installed in another place via an arbitrary network. Since it is necessary to protect the drawing files stored in the drawing database 17 from unauthorized access, an in-house dedicated line is usually used for a network connecting the user terminal 27 and the drawing management server 15.
[0030]
In the case of FIG. 2, the user terminals 27 connected to the drawing management server 15 are grouped and shown based on the installation location. For example, a user terminal 27 installed in the same premises 21, a user terminal 27 installed in a remote location 23 in Japan, and a user terminal 27 installed in a foreign country 25 are grouped and shown.
[0031]
The same premises 21 is a room different from the drawing management room 11, but is a user terminal 27 installed in the same building or the same office. The domestic remote location 23 is a user terminal 27 installed in an affiliated company or office of this company, which is located in a place different from the office where the drawing management room 11 is located. The foreign country 25 is a user terminal 27 installed in an affiliated company or office of this company, which is located in a country different from the country where the drawing management room 11 is located.
[0032]
The plurality of user terminals 27 provided at these various places are connected to the drawing management server 15 via a network. As described above, the drawing database 17 itself exists in the drawing management room 11, and the registered drawings in the company are centrally managed here. Therefore, an in-house user located at each place accesses the drawing management server 15 via the nearest user terminal 27 and outputs a drawing file in the drawing database 17 at each user terminal 27.
[0033]
Generally, not all employees have the authority to view or print the registered drawings. That is, only the employees of the departments that need the drawings have the authority to view the registered drawings, and only specific employees in those departments generally have the authority to print the registered drawings. .
[0034]
Therefore, access from the user terminal 27 to the drawing management server 15 requires authentication for specifying an employee user. After the connection with the drawing management server 15 is established through the user authentication, the search, display, printing, etc. of the drawing are executed by the logged-in user.
[0035]
In order to process a series of these operations, application software dedicated to drawing output processing is installed in the user terminal 27. In this specification, the application software installed on the user terminal 27 is referred to as “user terminal software”.
[0036]
The software installed on the drawing management server 15 with respect to the “user terminal software” is called “drawing management software”. The drawing management software includes functions for searching, displaying, and printing drawings in the user terminal software, as well as functions for maintaining the entire drawing management system such as authentication processing of each user and management processing of the drawing database. In.
[0037]
The user terminal software installed on the user terminal 27 and the drawing management software installed on the drawing management server 15 operate in cooperation with each other, and can provide various functions via a network.
[0038]
FIG. 3 is a detailed functional block diagram of the drawing management server 15 and the user terminal 27 having the fuzzy search function of the present invention. In the following description, it is assumed that the connection between the user terminal 27 and the drawing management server 15 has already been established.
[0039]
The user terminals 27 installed at the respective locations include an input device 49 such as a keyboard and a mouse. In one embodiment, these user terminals 27 may be general personal computers.
[0040]
When the user wants to output (display or print) a drawing, the user correctly inputs the identification code of the part drawing to be output and transmits it to the drawing management server 15. The transmission of the identification code is processed by the drawing request transmission unit 57 of the user terminal 27 shown in FIG.
[0041]
The identification code transmitted by the drawing request transmitting unit 57 is received by the drawing request receiving unit 35 of the drawing management server 15 and transmitted to the drawing file searching unit 37 therefrom. The drawing file search unit 37 searches the drawing database 17 for a corresponding drawing file using the received identification code as a key.
[0042]
When the drawing file search unit 37 finds a corresponding drawing file from the drawing database 17, the drawing file is sent to the drawing transmitting unit 39. The drawing transmission unit 39 receives the drawing file from the drawing file search unit 37 and transmits the drawing file to the user terminal 27 that has requested the drawing.
[0043]
The drawing receiving section 59 of the user terminal 27 receives the drawing file transmitted from the drawing management server 15 and temporarily stores the drawing file. The drawing file is stored in the drawing receiving unit 59 until the connection between the user terminal 27 and the drawing management server 15 is disconnected.
[0044]
When receiving the drawing file, the drawing receiving unit 59 temporarily stores the drawing file and notifies the user of the search result through the screen of the monitor 51. If the drawing file corresponding to the input identification code does not exist in the drawing database 17, an error is displayed on the screen of the monitor 51. Therefore, when the user wants to output a desired drawing in the drawing management system, it is necessary to know in advance the exact identification code corresponding to the drawing file.
[0045]
The drawing management system according to the present invention includes a search means called "fuzzy search" for allowing a user to search for an identification code when the above-mentioned 15-digit accurate identification code is not known. The ambiguous search is a function of presenting an identification code registered in the drawing database 17 to a user in response to input of an ambiguous identification code. The user can find out the correct identification code by using the fuzzy search function.
[0046]
In the fuzzy search of this embodiment, only the main number and the classification number among the identification codes composed of four types of numbers (main number, classification number, type number, and supplementary number) are used. That is, only the identification code corresponding to the parent drawing is to be searched. However, in another embodiment, a fuzzy search including up to the identification code corresponding to the child drawing, including the type number or the supplementary number, may be performed.
[0047]
In order to more specifically explain the fuzzy search, the magnitude relation of the identification codes defined in this embodiment will be described first. The magnitude relation between the identification codes is determined by the magnitude of hexadecimal notation in a character code system known as an EBCDIC code. In the fuzzy search, an identification code is converted into an EBCDIC code, and an identification code existing in the drawing database 17 is searched based on the magnitude relation.
[0048]
As described above, each digit of the identification code is assigned a number from 0 to 9 and a letter from A to Z as a value. FIG. 4 shows a correspondence table in hexadecimal notation of the numbers 0 to 9 and the characters A to Z in the EBCDIC code.
[0049]
Since the magnitude relation of the identification codes is determined based on the magnitude relation in hexadecimal notation in the EBCDIC code, the magnitude relation of each number and character is determined as shown in Table 1. That is, “9” is the largest value, the next smallest value after “0” is “Z”, and “A” is the smallest value.
[0050]
[Table 1]
9>8>...>1>0>Z>Y>...>B> A
[0051]
FIG. 5 shows a specific example in which a main number consisting of a five-digit value is converted into a hexadecimal notation of an EBCDIC code. As is clear from FIG. 5, in the case of a main number having a five-digit value, the maximum code is "99999" and the minimum code is "AAAAA". In the same manner, the magnitude relation of the classification numbers composed of three-digit codes is determined.
[0052]
In this embodiment, since only the 5-digit main number and the 3-digit classification number are used, the number of digits of the identification code used for the search is eight in total. In the case of a magnitude relationship between codes obtained by combining a main number and a classification number, the classification number is determined as a number higher than the main number. This can be determined by the magnitude relationship of an 8-digit code with the classification number being the upper three digits and the main number being the lower five digits.
[0053]
For example, a magnitude relationship between a first identification code having a main number of “17555” and a classification number of “999” and a second identification code having a main number of “17535” and a classification number of “998” is compared. Think about it. In this case, the first identification code is represented by “99917555”, and the second identification code is represented by “99817353”. Therefore, the magnitude relationship between the first identification code and the second identification code is expressed as “99917555”> “99817353”. This relationship also holds when converted to hexadecimal notation according to the EBCDIC code.
[0054]
FIG. 6 shows a list of identification codes arranged in descending order based on the magnitude relation. As shown in FIG. 6, the largest code in the code composed of the main number and the classification number is the classification number “999” −the main number “99999”, and the minimum code is the classification number “AAA” −the main number “AAAAA”. It is.
[0055]
The value assigned to each digit of the identification code is a total of 36, consisting of 10 numbers and 26 English characters, and the number of digits of the identification code is a total of 8 digits consisting of 3 digits of the classification number and 5 digits of the main number. Digits. Therefore, the total number of possible combinations of identification codes is 36 ⁸ It becomes street.
[0056]
As mentioned above, 36 ⁸ Not all drawing codes are associated with drawing files. The codes actually used as the identification codes are only a part of them. Further, the way of assigning the identification code to the part drawing does not depend on the magnitude relation described above. For this reason, when the identification codes are arranged in accordance with the magnitude relation, the actually registered identification codes are scattered without being continuous.
[0057]
In order to collectively store these discontinuous identification codes (that is, identification codes corresponding to drawings stored in the drawing database 17), in this embodiment, the identification code table 41 shown in FIG. 3 is used. .
[0058]
In the identification code table 41, a serial number is assigned to each registered identification code in an order having a larger value and stored. By referring to the identification code table 41, it is possible to confirm the registered identification codes and the rank of the identification codes.
[0059]
The identification code table 41 is generated by sequentially adding newly registered identification codes. When a new drawing file is newly registered in the drawing database 17, the table generation unit 45 of FIG. 3 adds the identification code given to the drawing file to the identification code table 41. At that time, the table generation unit 45 updates all the serial numbers in the identification code table 41 and updates the magnitude relation of each identification code in the table.
[0060]
In the ambiguous search, the ambiguous identification code input by the user is compared with the identification code table 41, and an arbitrary number of registered identification codes are presented to the user based on the rank of the input identification code. In this specification, an ambiguous identification code input by a user for a search is referred to as a search code.
[0061]
Next, the fuzzy search in the drawing management system will be described according to the procedure performed by the user. FIG. 7 shows a menu screen displayed on the monitor 51, where the user selects a search method. The user who wants to use the fuzzy search function selects the ambiguous search button 75 on the menu screen 71 and clicks the execute button 77.
[0062]
When the ambiguous search is selected on the menu screen 71, an ambiguous search screen 79 shown in FIG. 8 is displayed. The fuzzy search screen 79 is provided with search code input forms 81 and 83, a search number input form 85, a fuzzy search start button 87, a menu button 89, and a search result window 91.
[0063]
The search code input form is divided into a main number input form 81 and a category number input form 83. The main number in the identification code is input in the main number input form 81, and the category number is input in the category number input form 83. Fill out the input form.
[0064]
As described above, the main number and the classification number in the identification code represent the code of the parent drawing. In the fuzzy search in this embodiment, the identification codes registered in the drawing database 17 are obtained by the specified number of searches based on the input search codes (main number, classification number).
[0065]
The search number input form 85 is used to specify the search number of the identification code. For example, if the user inputs a value of “10” in the input form 85, ten identification codes existing in the identification code table 41 are acquired.
[0066]
The ambiguous search start button 87 is clicked when the search code entered in the identification code input forms 81 and 83 is determined and the search is started. The search result window 91 displays the identified identification codes in a list. The menu button 89 is clicked when returning from the fuzzy search screen 79 to the menu screen 71.
[0067]
Hereinafter, the fuzzy search will be described with a specific example. In this specific example, the user inputs "17555" in the main number input form 81, "S04" in the category number input form 83, and "10" in the search number input form on the fuzzy search screen 79, and based on this input, the vague Consider a situation where you perform a search.
[0068]
In this case, the user clicks the fuzzy search button 87 to transmit the search code and the number of searches to the drawing management server 15. The transmission of the search code and the number of searches is processed by the search code transmission unit 61 of the user terminal 27 shown in FIG.
[0069]
The transmitted identification code and search number are received by the search code receiving unit 45 of the drawing management server 15 shown in FIG. The fuzzy search unit 43 refers to the identification code table 41 storing the registered identification codes, and obtains the identification codes as many as the number of searches input from the identification code table 41. At this time, the identification code obtained by the fuzzy search unit 43 is selected in an order smaller than the search code and closest to the value of the search code.
[0070]
FIG. 9 shows an example of the identification code table 41 generated from the drawing database 17, and shows a part near the input "17555-S04" as a specific example. With reference to FIG. 9, the description of the processing of the fuzzy search unit 43 will be continued.
[0071]
First, the search code “17555-S04” input by the user is compared with the identification code table 41. As a result, it can be seen that the identification code that matches “17555-S04” does not exist in the identification code table 41 of FIG. That is, it is determined that the parent drawing corresponding to “17555-S04” does not exist in the drawing database.
[0072]
If there is no identification code matching the search code in the identification code table 41, the identification code next to “17555-S04” is searched from the identification code table 41. In the case of FIG. 9, the identification code next to “17555-S04” in the identification code table 41 is “17550-S04”. Therefore, “17550-S04” is the first identification code acquired. That is, this identification code is searched for as an identification code having a value smaller than and closest to “17555-S04”.
[0073]
In this specific example. The number of searches specified by the user is “10”. Therefore, the identification code having the next smaller value is searched in the identification code table 41. In this case, the next smallest identification code after “17550-S04” is “17538-S04”, which is the second identification code acquired.
[0074]
Similarly, a total of ten identification codes are obtained from the identification code table 41 in order. That is, the identification codes from serial numbers “309” to “318” in the identification code table 41 are acquired by the fuzzy search unit 43, and the obtained ten identification codes are the search results of the fuzzy search.
[0075]
The search result of the fuzzy search unit 43 is transmitted to the search request source user terminal 27 by the search result transmission unit 47 of FIG. The transmitted search result is received by the search result receiving unit 63 of the user terminal 27 and displayed on the search result window 91 through the monitor 51.
[0076]
A search result by the fuzzy search is different from a search result based on a conventional search unit based on matching of characters in a code. For example, in a conventional search unit using a wild card, a code is searched for by a front match, a back match, a partial match, or the like. However, in a search based on such character matching, it is difficult to search for the identification code from “99953-S03” to “99951-S03” in the above example because the characters in the code have large mismatches. .
[0077]
In the fuzzy search of the present invention, the magnitude relation of the identification codes is determined instead of the character match, and the identification code having the closest value is searched based on the magnitude relation. Even if it is large, the registered identification code can be reliably presented to the user.
[0078]
FIG. 10 shows an example of a flowchart of the fuzzy search. First, in step 101, each parameter is initialized. n is the number of searches specified by the user. INPUTCODE is a search code (category number, main number) input by the user, with the classification number being the upper three digits and the main number being the lower five digits (for example, “S0417555” in the above specific example). . k represents a serial number indicating the size of the identification code in the identification code table 41, and is initialized to “0” in step 101. m is a parameter used to obtain n identification codes, and is also initialized to “0”.
[0079]
In step 103, a value of 1 is added to the serial number k, and in step 105, the identification code corresponding to the serial number k in the identification code table 41 is compared with INPUTCODE. If the k-th identification code in the identification code table 41 is larger than INPUTCODE, the process returns to step 103, and a series of processing is repeated. That is, in step 105, the identification codes in the identification code table 41 are compared with INPUTCODE in ascending order.
[0080]
As an example, a case where the value of INPUTCODE is “S0417555” and the identification code table 41 of FIG. 9 is used will be described. In this case, INPUTCODE is larger than the identification code in the identification code table 41 up to k = 308 (identification code “S0417556”). However, since k = 308 + 1 = 309 in the next step 105, the corresponding identification code is “S0417550”. At this time, since the k-th identification code is smaller than INPUTCODE, the process proceeds to step 107.
[0081]
In steps 109 to 113, the identification codes are acquired from the identification code table 41 by the number of searches specified by the user. In step 109, the (k + m) th identification code is added as a search result. Since the initial value of m is set to "0" in step 101 and 1 is added to the value of m in step 113, the loop from step 107 to step 113 is repeated to identify the search result from the identification code table 41. Code is added. In step 111, (n-1) is compared with the value of m, whereby the identification codes are obtained by the number of searches specified by the user.
[0082]
Although the present invention has been described with respect to specific embodiments, the present invention is not limited to such embodiments, and various modifications that can be easily made by those skilled in the art are also included in the scope of the present invention.
[0083]
【The invention's effect】
According to the present invention, an identification code registered based on a predetermined magnitude relation is presented to the user in response to the input search code. Thereby, even if the user does not know the exact identification code and only knows the ambiguous identification code, the appropriate identification code closest to the ambiguous identification code is presented.
[Brief description of the drawings]
FIG. 1 is an example of an identification code.
FIG. 2 is an embodiment of a drawing management system according to the present invention.
FIG. 3 is a functional block diagram of a drawing management server having a fuzzy search function and a user terminal according to the present invention.
FIG. 4 is a correspondence table of numbers and alphabetic EBCDIC codes.
FIG. 5 is an example of conversion of a main number to an EBCDIC code in hexadecimal notation.
FIG. 6 is a list in which identification codes are arranged in a large order.
FIG. 7 is an example of a menu screen for selecting a search method.
FIG. 8 is an example of a fuzzy search screen.
FIG. 9 is a diagram showing a part of an identification code table as an example.
FIG. 10 is a flowchart of a fuzzy search.
[Explanation of symbols]
13 Management terminal
15 Drawing management server
17 Drawing database
27 User terminal
49 Input device
51 monitors

Claims (2)

A drawing management system that retrieves a corresponding drawing file from a drawing database in response to input of an identification code that uniquely identifies the drawing file,
Means for storing the identification code given to the drawing file stored in the drawing database, determining the magnitude relationship,
In response to ambiguous search identification code entered by the user, based on the magnitude relation, from the smaller identification code from the identification code for the search from the identification code storage means, a plurality of identification codes in the order of large values Means for searching ,
The number of the plurality of identification codes to be searched is determined by the number specified by the user,
The identification code includes a main number, a classification number, and a type number, and the parent drawing is represented by the main number and the classification number,
A drawing management system for searching for a drawing based on an ambiguous search identification code, wherein the identification code search means searches for the identification code by the main number and a classification number set higher than the main number . 2. The drawing management according to claim 1, wherein the identification code comprises a combination of 36 types of characters 0 to 9 and A to Z, and the magnitude relation of the identification code is determined by the magnitude relation of hexadecimal notation in the EBCDIC code. system.

Images