JPH08329156A - Organization chart processor - Google Patents

Abstract

PURPOSE: To provide an organization chart processor displaying an organization chart by a tree structure so that the position of a specified employee in the whole belonging organization and the personal information of the employee can be simultaneously observed. CONSTITUTION: At the time of inquiry processing, a CPU 2 allows an organization chart preparing processing part 8 to prepare a hierarchical table based upon various data stored in a section table file 9a and an employee master file 9b in a file memory 9 and related to an organization, develop the table in an image memory 10 and display the table on a display part 12. An inquiry processing control part 7 reads out an employee's face image or personal information from a face photograph file 9c or the employee master file 9b in accordance with a display position specification by a pointing device 4, displays the read contents on an organization chart, and in response to an end position specification, specifies a retrieving range, retrieves data corresponding to an input retrieving condition in the retrieving range from the file 9b and changes the display color of the employee's name concerned on the organization chart.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention, when displaying an organization chart having a tree structure, has a function of displaying information corresponding to designated items and a function of identifying and displaying items corresponding to designated search conditions. Regarding the device.

[0002]

2. Description of the Related Art Conventionally, many application programs equipped with a database search function are used, and a personnel information system is one of them. In this personnel information system, when a specific employee is designated, the personal information is searched from the personnel database and displayed / printed, or a list of the employees who match the specified search condition is displayed / printed. It has an information inquiry function such as.

In these information inquiry functions, conventionally, a method of inputting an employee number from a keyboard, retrieving corresponding data from a personnel database, and displaying the contents is generally used. In addition, when displaying a list of employees according to a specific qualification or a joining year, by entering the search condition from the keyboard, the names and affiliations are often displayed as a list as a search result.

[0004]

However, in such a personnel information system as an application program equipped with a conventional database search function, it is possible to display the contents of specific employees and the list of employees who meet the inspection conditions. However, there was a problem as described below.

That is, in a company, employees and organizations (affiliations) have a close relationship, and in many cases, it is desired to see the capabilities, qualifications, years of enrollment, etc. of members of a certain department in relation to their position in the organization. There is a problem in that it is difficult to grasp the relationship between the organization and the detailed personal information by simply displaying the list in a flat manner as described above.

An object of the present invention is to display an organization chart in a tree structure, to position the designated specific employee in the entire organization to which it belongs, and to display information of individual employees so that they can be viewed at the same time. It is to provide a device.

[0007]

The organization chart processing apparatus according to the present invention is divided into a plurality of organizations, and organization information storage for storing organization code and connection relationship information between other organizations for each organization. Means and affiliation information storage means for storing, for each organization member, affiliation information indicating to which organization each organization member is connected, and for each said organization member, information regarding the organization member is stored. Based on the personal information storage means, the connection relation information of each of the organizations, and the affiliation information of the organization members, each organization is hierarchically represented, and to which organization each individual organization member belongs. The organization chart display means for creating and displaying the clearly defined organization chart, the instruction means for instructing the organization member displayed on the displayed organization chart, and the personal information corresponding to the instructed organization member are described above. Call from the personal information storage means and display It is characterized with the personal information display means for, by comprising a.

The organization chart processing apparatus according to the invention of claim 2 is
The organization information storage means for storing the organization code and connection relationship information with other organizations is divided into a plurality of organizations, and affiliation information indicating to which organization each organization member connects to each organization. Affiliation information storage means for storing each member, personal information storage means for storing information about the organization member for each of the organization members, connection relation information of each organization, and affiliation information of the organization member An organization chart display means for creating and displaying an organization chart in which each organization is hierarchically expressed based on the above and each organization member clearly indicates to which organization, and the displayed organization chart. In the above, the position designating means for designating the display position of the target organization, the designating means for designating the search condition using the personal information about the organizational member, and the organizational member matching the designated search condition are described above. Personal exemption storage means Extraction means for al extraction, is characterized in that the identification means for identifying and displaying the display position of the extracted tissue members, equipped with a.

[0009]

According to the organization chart processing apparatus of the present invention, the organization chart is divided into a plurality of organizations, and the organization code and the connection relation information with other organizations are stored in the organization information storage means for each organization. Affiliation information indicating which organization the organization member connects to is stored in the affiliation information storage means for each organization member, and the information about the organization member is stored in the personal information storage means for each organization member. The organization chart display means hierarchically represents each organization based on the connection relationship information of each organization and the affiliation information of the organization member, and where each organization member belongs. When an organization chart is created and displayed, the instruction means indicates the organization member displayed on the displayed organization chart, and the personal information display means indicates to the instructed organization member. Corresponding personal information is the individual Is displayed is called from the information storage unit.

Therefore, the personal information of the designated members can be simultaneously displayed on the hierarchically displayed organization chart,
The relationship between the position on the organization and the personal information can be displayed in an easy-to-understand manner, and the data inquiry function using the personnel information database can be improved and effectively used.

According to the organization chart processing apparatus of the present invention, the organization code is divided into a plurality of organizations, and the organization code and the connection relation information with other organizations are stored in the organization information storage means for each organization. Affiliation information indicating which organization the organization member connects to is stored in the affiliation information storage means for each organization member, and the information about the organization member is stored in the personal information storage means for each organization member. The organization chart display means hierarchically represents each organization based on the connection relationship information of each organization and the affiliation information of the organization member, and where each organization member belongs. Is displayed and displayed, and the display position of the target organization is specified on this displayed organization chart by the position designation means, and the personal information about the organization members is used by the instruction means. Search conditions When instructed by the extraction means,
An organization member matching the designated search condition is extracted from the individual removal storage means, and the identification display means identifies and displays the extracted display position of the organization member.

Therefore, it is possible to easily display the organization members who match the search conditions within the search target department on the hierarchically displayed organization chart, and improve and effectively use the data inquiry function using the personnel information database. Can be achieved.

[0013]

Embodiments of the present invention will be described in detail below with reference to FIGS. 1 to 13 are diagrams showing an embodiment of a computer system to which the present invention is applied. First, the configuration will be described. FIG. 1 shows a computer system 1.
FIG. 3 is a block diagram of the main part of FIG. In FIG. 1, the computer system 1 includes a CPU 2, a key input unit 3, a pointing device 4, a ROM 5, a RAM 6, an inquiry processing control unit 7, an organization chart creation processing unit 8, a file memory 9, an image memory 10, a printing unit 11, and The display unit 12 is configured, and each unit is connected to the bus 13.

CPU (Central Processing Unit) 2
Controls various parts in the computer system 1 in accordance with various control programs stored in the ROM 5 to execute various information processes, and displays the processing steps and processing results thereof on the display part 1.
Display on 1.

Further, the CPU 2 causes the organization chart creation processing unit 8 to execute the hierarchy table creation processing and the hierarchy image development processing in the inquiry processing described later, and the belonging table file 9a and the employee master file 9b in the file memory 9 are executed.
A hierarchical table is created based on various data related to the organization stored in the image memory 10 and expanded in the image memory 10 to display the data on the display unit 12.
After that, the inquiry processing control unit 7 reads the face image or personal information of the designated employee from the face photograph file 9c or the employee master file 9b according to the display position designation by the pointing device 4 and displays it on the organization chart. Further, the search target range is specified according to the end position designation by the pointing device 4, the data corresponding to the search condition input in the search target range is searched in the employee master file 9b, and based on the search result. Change the display color of the employee name on the organization chart.

The key input section 3 is provided with cursor keys, numeral input keys, various function keys, etc., and outputs a depression signal of the depressed key to the CPU 2. Pointing device 4
Is a pointing device that assists the input of the key input unit 3, and outputs an operation signal to the CPU 2.

A ROM (Read Only Memory) 5 is a CPU
In addition to storing various control programs to be executed from step 2, an inquiry processing program and a hierarchy table creation processing program and a hierarchy image development processing program executed by the organization chart creation processing unit 8 at the time of the inquiry processing are stored.
A RAM (Random Access Memory) 6 forms a memory area in which various data are expanded when the CPU 2 executes the various processing programs.

The inquiry processing control unit 7 reads the face image or personal information of the designated employee from the face photograph file 9c or the employee master file 9b in accordance with the display position designation by the pointing device 4 in the inquiry processing executed by the CPU 2. The search target range is specified according to the display on the organization chart and the end position designation by the pointing device 4, and the data corresponding to the search condition input in the search target range is searched in the employee master file 9b, Based on the search result, the display color of the employee name on the organization chart is changed.

When the CPU 2 executes the inquiry process, the organization chart creation processing unit 8 executes a hierarchy table creation process and a hierarchy image development process, which will be described later, and the affiliation table file 9a and the employee master in the file memory 9 are processed. File 9
A hierarchy table is created based on various data related to the organization stored in b and stored in the hierarchy table memory 9a. Based on the hierarchy table stored in the hierarchy table memory 8a, hierarchy diagram image data is stored in the hierarchy number counter 8b. Use image memory 10
Then, the expanded organization hierarchy image is displayed on the display unit 12.

The file memory 9 stores an affiliation table file 9a, an employee master file 9b and a face picture file 9c as shown in FIG. As shown in FIG. 2, the affiliation table file 9a is a table that stores various pieces of information related to the departments that belong to the organization in association with the hierarchical structure of the organization. The information of the higher department code to which the department belongs directly, the hierarchy number (indicating the hierarchy position), and the manager's employee number is stored in association with each other. Further, the employee master file 9b is a master file that stores various kinds of information relating to the employees of the department to which the employee belongs in the belonging table file 9a as shown in FIG. As information, information such as a job title, date of joining the company, age, and family is stored in association with each other. Further, the face photograph file 9c stores face photograph data corresponding to the employee number stored in the employee master file 9b.

The image memory 10 forms a memory area in which the image data of the organizational processing chart created by the organizational chart creation processing unit 8 is expanded in block units for each department. The printing unit 11 prints the print data input from the CPU 2 on a predetermined recording paper and outputs it, and the display unit 12 displays the CR data.
The display data is composed of a T (Cathode Ray Tube) or the like and displays the display data input from the CPU 2.

Next, the operation of this embodiment will be described. The inquiry process executed by the computer system 1 of the present embodiment will be described based on the flowchart shown in FIG. When the inquiry process is started in FIG. 4, first, the organization chart creation processing unit 8 executes a hierarchy table creation process based on various data related to the organization stored in the belonging table file 9a and the employee master file 9b in the file memory 9. Yes (step S1). This hierarchy table creation processing will be described based on the flowchart shown in FIG.

First, the first row of the hierarchy table shown in FIG. 6 to be expanded in the hierarchy table memory 7a is designated (step S101), and the affiliation code without the higher affiliation code is searched from the affiliation table file 9a shown in FIG. , The retrieved belonging code is stored in the register SHO in the RAM 6 (step S
102). In the case of the belonging table file 9a shown in FIG.
Since the affiliation code 100 corresponds to an affiliation code without a higher affiliation code, this affiliation code 100 is registered in the register SHO.
Stored in.

Then, the hierarchy number "1" and the belonging name "Clock Division" of the belonging code 100 stored in the register SHO are read from the belonging table file 9a, and the read data are designated in step S101 in FIG. It is set in the first row of the hierarchy table shown (step S10).
3). Next, referring to the employee master file 9b shown in FIG. 3 based on the corresponding employee number 0100 of the employee table file 9a, the employee name “A” is assigned to the first row of the designated row of the hierarchical table of FIG. Set (Step S10
4).

Next, the second line which is the next line of the hierarchy table of FIG. 6 is designated (step S105), and the employee master file 9
It is checked whether or not there is another employee data belonging to the same group in b (step S106). If there is employee data belonging to the same department, the name of the relevant employee data is read from the employee master file 9b, set in the second line of the hierarchy table designated in step S105 (step S107), and the process returns to step S105.

If there is no employee data of the same affiliation, there is no other employee data of the same affiliation code 100 in the employee master file 9b of FIG.
Assigned code 1 stored in register SHO in RAM6 by
An unsearched affiliation code having a higher affiliation of 00 is searched from the affiliation table file 9a (step S108), and it is determined whether or not there is a corresponding affiliation code based on the search result (step S109). If there is no corresponding affiliation code, the higher affiliation code of the affiliation code 100 stored in the register SHO in the RAM 6 is assigned to the affiliation table file 9
It is searched from a (step S110), and it is determined from the search result whether or not there is a corresponding affiliation code (step S111).

If there is no corresponding belonging code, this process is terminated, and if there is a corresponding belonging code, the searched belonging code is stored in the register SHO in the RAM 6 (step S112), and step S108 is executed. Return.

If there is a corresponding affiliation code in step S109, that is, in the affiliation table file 9a of FIG. 2, since the affiliation code 110 having the affiliation code 100 as a higher affiliation is in the second line, the corresponding affiliation code is found. The code 110 is stored in the register SHO in the RAM 6 (step S113), and the process returns to step S103.

Returning to step S103, step S11
The hierarchy number “2” and the organization name “development department” of the organization code 110 stored in the register SHO in 3 are read from the organization table file 9a, and the respective read data are designated as 2 in the hierarchy table of FIG. 6 specified in step S105. Set on the line. Next, the employee master file 9b of FIG. 3 is referred to based on the corresponding employee number 0501 of the employee table file 9a, and the employee chief name “B” is set to the second line of the designated row of the hierarchical table of FIG. (Step S104).
As a result, the data is expanded as shown in the second line of the hierarchy table of FIG.

Next, the third line which is the next line of the hierarchy table of FIG. 6 is designated (step S105), and the employee master file 9
It is checked whether or not there is another employee data of the same department 110 in b (step S106). Since there is no other employee data of the same department 110 in the employee master file 9b of FIG. 3, the register S in the RAM 6 is stored in the step S113.
An unsearched affiliation code having the affiliation code 110 stored in the HO as a higher affiliation is searched from the affiliation table file 9a (step S108), and it is determined whether or not there is a corresponding affiliation code based on the search result (step S10).
9).

Since the affiliation table file 9a in FIG. 2 has the affiliation code 111 having the affiliation code 110 as a higher-level affiliation, the affiliation code 111 is stored in the register S in the RAM 6.
Store in HO (step S113), step S10
Return to 3. Returning to step S103, step S113
The hierarchical number “3” and the organizational name “development section” of the affiliation code 111 stored in the register SHO at are read from the affiliation table file 9a, and the respective read data are designated by the three rows of the hierarchical table of FIG. 6 designated at step S105. Set on the eyes. Next, the employee master file 9b of FIG. 3 is referred to based on the corresponding employee number 1201 of the employee table file 9a, and the employee chief name “E” is set in the third row of the designated row of the hierarchical table of FIG. (Step S104). As a result, the data is expanded as shown in the third line of the hierarchical table of FIG.

Next, the fourth line, which is the next line of the hierarchy table of FIG. 6, is designated (step S105), and the employee master file 9
It is checked whether or not there is another employee data belonging to the same group in b (step S106). In the employee master file 9b of FIG. 3, the employee number 2 is stored as employee data of the same department 111.
Since there is 501, the name “I” of the corresponding employee data is set in the fourth line of the hierarchy table of FIG. 6 (step S10).
7) and returns to step S105.

Returning to step S105, the fifth line of the next line of the hierarchy table of FIG. 6 is designated, and it is checked whether or not there is another employee data of the same department in the employee master file 9b (step S106). The employee master file 9b in FIG.
Since there is 502, the name “J” of the corresponding employee data is set in the fifth row of the hierarchy table of FIG. 6 (step S10).
7) and returns to step S105.

Returning to step S105, the sixth line of the next line of the hierarchy table of FIG. 6 is designated, and it is checked whether or not there is another employee data of the same department in the employee master file 9b (step S106). In the employee master file 9b of FIG. 3, the employee number 250 is stored as employee data of the same department 111.
No. 1 and 2502 exist, so that the affiliation code 11 stored in the register SHO in the RAM 6 in the above step S113
An unsearched affiliation code having a higher affiliation of 1 is searched from the affiliation table file 9a (step S108), and it is determined whether there is a corresponding affiliation code based on the search result (step S109).

Since the affiliation table file 9a in FIG. 2 has no affiliation code having the affiliation code 111 as a higher affiliation,
The higher affiliation code of the affiliation code 111 stored in the register SHO is searched from the affiliation table file 9a (step S110), and it is determined whether or not there is a corresponding affiliation code based on the search result (step S111). Since the affiliation code 110 exists as a higher-level affiliation code of the affiliation code 111, the affiliation code 110 is stored in the register SHO (step S112), and the process returns to step S108.

Then, steps S108 to S1.
When the belonging code 100 is stored in the register SHO by repeating the processing of 12, the steps S108 and S1 are performed.
In 09, the affiliation code 120 is searched from the affiliation table file 9a of FIG. 2 as an unsearched affiliation code having the affiliation code 100 as a higher affiliation, the affiliation code 120 is stored in the register SHO, and the process returns to step S103.

By repeating the above steps S103 to S107, the layer number "2" and the upper layer "1" are set as the data relating to the belonging code 120 on the seventh and eighth lines in the hierarchical table of FIG. ", Department name" design department ", department chief name" C "and department member name" K "are developed.

Further, by repeating the above steps S103 to S113, each data on the 9th line and thereafter in the hierarchical table of FIG. 6 is stored in the belonging table file 9a of FIG. 2 and the employee master file 9b of FIG. Then, the hierarchy table is created and the hierarchy table creation process ends.

When this hierarchical table creating process is completed, steps S1 to S2 in the hierarchical diagram display process of FIG.
Proceed to the hierarchical image development process of Regarding the hierarchical image expansion process executed by the organization chart creation processing unit 7, FIG.
It will be described based on the flowchart shown in FIG.

First, the horizontal counter m of the hierarchical number counter 7b used when setting the position where the hierarchical image is developed is set to "1" and the vertical counter n is set to "0" (step S201). . Next, the top block of the hierarchy table of FIG. 6 is designated (step S202), and it is determined whether the hierarchy number of the designated block is larger than the numerical value set in the vertical counter n (step S20).
3).

In this case, since the layer number of the first block in the layer table of FIG. 6 is "1" and is larger than the numerical value "0" of the vertical counter n set in step S201, the layer number of the specified first block. 1 for vertical counter n
(Step S204). Then, the data expanded to the block corresponding to the designated hierarchy number 1 in the hierarchy table of FIG. 6 (affiliation name: clock division, chief name: A)
A block image is generated based on (step S20
5), the block image generated from the block with the layer number 1 is set at the development block position of the coordinate (1, 1) in the layer image development area as shown in FIG. 8 in the image memory 10 (step S206). Then, the position information (position number and row) of the generated block image is also set in the hierarchical table memory 8a (step S2).
07).

The hierarchical image development area shown in FIG. 8 in the image memory 10 has coordinates (m, n) corresponding to the count numbers counted by the vertical counter m and the horizontal counter n in the hierarchical number counter 7b. The hierarchical table data expansion area for each block shown is formed. In each block, as shown in FIG. 9, a department name and four lines of data (first line: department chief name, second line to fourth line: member name) under the department name are stored. It is designed to be deployed.
Then, in the block-based hierarchical table data expansion area of FIG. 8, block-unit data delimited by the hierarchical number of the hierarchical table of FIG. 6 is expanded.

Next, it is checked whether or not the upper layer data is set in the head block delimited by the layer number 1 in the designated layer table of FIG. 6 (step S20).
8). Since the upper layer data is not set in the leading block, the process proceeds to step S211, and the block of the layer number next to the leading block of the layer table of FIG. 6 is designated to determine whether or not there is the next block. (Step S2
11). Since there is a block delimited by the layer number 2 next to the first block in the layer table of FIG. 6, step S203
Return to

In step S203, since the hierarchical number "2" of the designated next block is larger than the numerical value "1" set in the vertical counter n in the processing of step S204, the hierarchical number "2" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated based on the data (affiliation name: development department, affiliation chief name: B) expanded in the hierarchy number 2 block of the hierarchy table in FIG. 6 (step S205), and the block image in the image memory 10 shown in FIG. The block image generated from the block with the layer number 2 is set at the block position of the coordinate (1, 2) in the layer image development area as shown in (step S206). Then, the position information (position number and row) of the generated block image is also set in the hierarchy table memory 8a (step S207).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S208). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
209), the block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block having the layer number 2 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is the next block (step S21).
2). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is larger than the numerical value "2" set in the vertical counter n in the processing of step S204, the hierarchical number "3" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated on the basis of the data (affiliation name: development section, affiliation manager name: E, affiliation member name: I, J) developed in the block of hierarchical number 3 (step S20).
5), the block image generated from the block with the layer number 3 is set at the block position of the coordinates (1, 3) in the layer image development area as shown in FIG. 8 in the image memory 10 (step S206). The position information (position number and line) of the generated block image
Is also set in the hierarchy table memory 8a (step S20).
7).

Then, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S208). Since “2” is set as the upper layer data in the layer number 3 block of FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image of FIG. 8 (step S
209), the hierarchy number 3 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block with the layer number 3 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is the next block (step S21).
2). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 2, the process returns to step S203.

In step S203, since the hierarchical number "2" of the designated next block is smaller than the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up (m + 1).
→ m) to set m = 2 (step S212), and the layer number "2" of the designated block is set in the vertical counter n (step S204). Then, a block image is generated on the basis of the data (affiliation name: design department, affiliation chief name: C, affiliation name: K) expanded in the block of hierarchical number 2 (step S205), and a diagram in the image memory 10 In the hierarchical image development area as shown in FIG. 8, the block image generated from the hierarchical number 2 block is set at the block position of the coordinate (2, 2) (step S
206). Then, the position information (position number and row) of the generated block image is also set in the hierarchy table memory 8a (step S207).

Next, it is checked whether or not upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S208). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
209), the hierarchy number 2 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block having the layer number 2 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is the next block (step S21).
2). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 2, the process returns to step S203.

In step S203, since the hierarchical number "2" of the designated next block is the same as the numerical value "2" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
(1 → m) to set m = 3 (step S212), and the layer number “2” of the designated block is set in the vertical counter n (step S204). And the layer number 2
A block image is generated based on the data (affiliation name: sales department, affiliation chief name: D) developed in the block (step S205), and the coordinates (in the hierarchical image development area as shown in FIG. The block image generated from the block having the layer number 2 is set at the block position of (3, 2) (step S206). Then, the position information (position number and row) of the generated block image is also set in the hierarchy table memory 8a (step S207).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 2 block of the specified hierarchy table of FIG. 6 (step S208). Since "1" is set as the upper layer data in the layer number 2 block of FIG. 6, the block position corresponding to the upper layer "1" is searched in the layer image of FIG. 8 (step S
209), the hierarchy number 2 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block having the layer number 2 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is the next block (step S21).
2). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is larger than the numerical value "2" set in the vertical counter n in the process of step S204, the hierarchical number "3" of the designated block is set. The vertical counter n is set (step S204). Then, a block image is generated on the basis of the data (affiliation name: first sales section, affiliation manager name: F, affiliation member name: L) developed in the block of the hierarchy number 3 (step S20).
5) The block image generated from the block with the layer number 3 is set at the block position of the coordinate (3, 3) in the layer image development area as shown in FIG. 8 in the image memory 10 (step S206). The position information (position number and line) of the generated block image
Is also set in the hierarchy table memory 8a (step S20).
7).

Then, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S208). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
209), the hierarchy number 3 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block with the layer number 3 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is a next block (step S21).
0). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is the same as the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
1 → m) to set m = 4 (step S212), and the hierarchical number “3” of the designated block is set in the vertical counter n (step S204). And the layer number 3
A block image is generated based on the data (affiliation name: second sales section, affiliation manager name: G, affiliation member name: M) developed in the block (step S205), and the image memory 1
The block image generated from the block with the layer number 3 is set at the block position of coordinates (4, 3) in the layer image development area in 0 as shown in FIG. 8 (step S206). Then, the position information (position number and row) of the generated block image is also set in the hierarchy table memory 8a (step S207).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S208). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
209), the hierarchy number 3 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the layer number 3 block in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is a next block (step S21).
2). Since the hierarchy table of FIG. 6 includes blocks delimited by hierarchy number 3, the process returns to step S203.

In step S203, since the hierarchical number "3" of the designated next block is the same as the numerical value "3" set in the vertical counter n in the processing of step S204, the horizontal counter m is counted up ( m +
1 → m) to set m = 5 (step S212), and the layer number “3” of the designated block is set in the vertical counter n (step S204). And the layer number 3
A block image is generated based on the data (affiliation name: third sales section, affiliation manager name: H, affiliation member name: N) developed in the block (step S205), and the image memory 1
The block image generated from the block of hierarchical number 3 is set at the block position of coordinates (5, 3) in the hierarchical image development area as shown in FIG. 8 within 0 (step S206). Then, the position information (position number and row) of the generated block image is also set in the hierarchy table memory 8a (step S207).

Next, it is checked whether or not the upper hierarchy data is set in the hierarchy number 3 block of the specified hierarchy table of FIG. 6 (step S208). Since “2” is set as the upper layer data in the layer number 2 block in FIG. 6, the block position corresponding to the upper layer “2” is searched in the layer image in FIG. 8 (step S
209), the hierarchy number 3 block image is combined with the retrieved upper layer block image and line segment image as shown in FIG. 8 (step S210).

Next, the block next to the block with the layer number 3 in the layer table of FIG. 6 is designated (step S211), and it is determined whether or not there is the next block (step S21).
2). Since there is no next block in the hierarchy table of FIG. 6, the hierarchy image expansion processing shown in FIG. 8 ends.

Then, in step S3 in FIG. 4, after displaying the organizational hierarchy image data expanded in the image memory 10 by the display unit 11 by the hierarchical image expansion processing, the display position designation on the organizational hierarchy image by the pointing device 4 is designated. Is confirmed (step S4).
It is determined whether or not this display position designation is the employee position (step S5). When it is determined that the position is the employee position, the hierarchy table memory 8a is associated with the position information corresponding to the employee position.
The name stored in is specified (step S6), and a menu for selecting the information type (face image or personal information) to be displayed for the designated employee is displayed on the image of the organizational hierarchy displayed on the display unit 12 (step S6). S7).

When "face image" is selected in this display information type menu display, the employee number is designated from the corresponding name in the employee master file 9b (step S
8) Then, the face image corresponding to the employee number is called from the face photograph file 9c (step S9), the face image is displayed in the sub window as shown in FIG. 10 (step S10), and the process returns to step S4.

When "Personal Information" is selected in the display information type menu display in step S7, the personal information of the employee in the employee master file 9b is called (step S11), and the personal information is shown in FIG. It is displayed in the sub-window as shown (step S10), and the process returns to step S4.

When it is determined in step S5 that the display position designation is not the employee position, the end position designation is prompted, and when the end position is designated (step S12), the organization surrounded by the designated end position. The blocks in the specified range as shown in FIG. 12 on the hierarchical image are specified as the search target range (step S13). Next, when the search condition is prompted within the designated range and the search condition (for example, the date of joining the company) is entered (step S14), the search condition (the date of joining the company) entered in the employee master file 9b.
A search process is performed based on (step S15).

Then, a flag is set in the search flag column of the data row shown in FIG. 6 in the hierarchy table memory 8a corresponding to the employee in the hierarchy block specified as the above-mentioned search range among the employees who match the search conditions. (Step S1
6) As shown in FIG. 13, the display color of the display portion of the employee name for which the flag is set is changed and displayed on the displayed organizational hierarchy image (step S17), and step S4
Return to The flag set in the search flag column of the data row in the hierarchical table memory 8a is reset when a new search condition is input and the search process is started.

As described above, by repeatedly executing the inquiry process, the face image and personal information of the designated employee can be confirmed on the organizational hierarchy image displayed on the display unit 12, and the search condition is met. You can check the employees who do. Therefore, it is possible to display the position of the designated employee in the entire organization and the personal information of the designated employee and the relationship of the target employee on the same screen, and to display the inquiry information to the operator in an easy-to-understand manner. You can

As a result, by adding the inquiry processing function to the application program having the data inquiry function for searching the personnel information database, the data inquiry function of the application program using the personnel information database can be improved and effectively used. Can be planned.

[0072]

According to the invention described in claim 1, the personal information of the designated members can be simultaneously displayed on the hierarchically displayed organization chart, and the relationship between the position on the organization and the personal information can be grasped. It can be easily displayed, and the data inquiring function using the personnel information database can be improved and effectively used.

According to the second aspect of the invention, it is possible to easily display the organization members who match the search condition within the search target department on the hierarchically displayed organization chart, and use the personnel information database. It is possible to improve and effectively use the data inquiry function.

[Brief description of drawings]

FIG. 1 is a block diagram of a main part of a computer system to which the present invention is applied.

FIG. 2 is a diagram showing an example of a data structure of a table stored in a affiliation table file of FIG.

3 is a diagram showing an example of a data structure of a master file stored in the employee master file of FIG.

FIG. 4 is a flowchart of an inquiry process executed by the computer system of this embodiment.

5 is a flowchart of a hierarchy table creation process executed by the organization chart creation processing unit of FIG. 1 during the inquiry process of FIG.

6 is a diagram showing an example of data stored in the hierarchy table memory of FIG. 1 by the hierarchy table creation processing of FIG.

7 is a flowchart of a hierarchical image expansion process executed by the organizational chart creation processing unit in FIG. 1 during the organizational chart display processing in FIG.

8 is a diagram showing a block image of the hierarchy table expanded in the image memory of FIG. 1 by the hierarchy image expansion processing of FIG.

9 is a diagram showing the contents of hierarchical data expanded in block units within the hierarchical image expansion area of FIG.

FIG. 10 is a diagram showing a display example when the employee position of the organizational hierarchy image is designated and the face image display is selected in the inquiry processing of FIG. 4;

FIG. 11 is a diagram showing a display example when the employee position of the organizational hierarchy image is designated and the personal information display is selected in the inquiry processing of FIG. 4;

FIG. 12 is a view showing a display example when a search target range of an organizational hierarchy image is designated in the inquiry processing of FIG. 4;

13 is a diagram showing a state in which the display color of the employee name that matches the search condition is changed and displayed in the search target range of FIG. 12;

[Explanation of symbols]

 1 Computer System 2 CPU 3 Key Input Section 4 Pointing Device 5 ROM 6 RAM 7 Inquiry Processing Control Section 8 Organization Chart Creation Processing Section 8a Hierarchical Table Memory 8b Hierarchy Number Counter 9 File Memory 9a Department Table File 9b Employee Master File 9c Face Photo File 10 image memory 11 printing unit 12 display unit 13 bus

Claims (2)

[Claims] 1. An organization information storage unit that is divided into a plurality of organizations and stores an organization code and connection relationship information with other organizations for each organization, and affiliation indicating which organization each organization member is connected to. Affiliation information storage means for storing information for each organization member, personal information storage means for storing information about the organization member for each organization member, connection relationship information for each organization, and the organization An organization chart display means for creating and displaying an organization chart in which each organization concerned is hierarchically expressed based on the member affiliation information and which organization each organization member belongs to is created and displayed. An instruction means for instructing an organization member displayed on the displayed organization chart; and a personal information display means for displaying personal information corresponding to the instructed organization member by calling from the personal information storage means. Characterized by Organization Chart processor. 2. An organization information storage unit that is divided into a plurality of organizations and stores an organization code and connection relationship information with other organizations for each organization, and an affiliation indicating which organization each organization member connects to. Affiliation information storage means for storing information for each organization member, personal information storage means for storing information about the organization member for each organization member, connection relation information of each organization, and the organization Organization chart display means for creating and displaying an organization chart in which each organization concerned is hierarchically expressed based on the member's affiliation information, and the organization to which each organization member belongs is created and displayed. Position specifying means for specifying the display position of the target organization on the displayed organization chart, instructing means for instructing search conditions using personal information about the organization members, and matching the instructed search conditions The above mentioned organization members Extraction means for extracting from human division storage unit, organization chart processing apparatus and identification means for identifying and displaying the display position of the extracted tissue members, characterized by comprising a make.