JP2007148574A - Tree structure display program, tree structure display method, tree structure display device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To improve user's operability by providing an improved tree structure display program, a method and a device. <P>SOLUTION: A user selects a node in a closed state by fitting a mouse cursor to it and performing a single click etc. When an input processing part 21 receives this user's operation, an expansion reference node setting processing section 22 sets up the node as an expansion reference node of a display tree. After selection of the expansion reference node, the user inputs and specifies the number of the expansion display nodes by using a keyboard etc. A tree structure display processing part 23 automatically performs expansion display only for the number of expansion reference nodes inputted from low rank nodes of the expansion reference node sequentially from a shallow node of the hierarchy using the expansion reference node as a root. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to display of nodes having a tree structure in a system that handles information forming a hierarchical relationship, such as a file management system of a computer.

  Conventionally, when storing a file in a storage device such as a hard disk connected to a computer, the user uses a function of the file management system to store the file in a directory that is hierarchically related based on the file type, content, etc. Categorize and save. Since a set of information elements such as directories and files has a hierarchical relationship, elements displayed in a tree are collectively referred to as “nodes”.

  Information elements held and managed in the storage device can be displayed on the screen by a function such as an operating system (OS) file management system. However, when a large amount of information elements are stored in the storage device, all the nodes are connected to each other. They cannot be displayed on the screen at the same time. So, for example, if the node is a folder, closing the folder hides the folder in the lower layer called the child or grandchild and displays more information in the limited screen display area. A function that can be used is provided. For example, Patent Document 1 discloses a technique for displaying a tree having nodes in a hierarchical relationship so that the hierarchical relationship can be grasped. Further, as a known tool, there is an explorer provided as standard in Microsoft Windows (registered trademark).

  When a large amount of information elements are stored in the storage device, not only the display problem described above but also an operation problem occurs. For example, when displaying a target node from a state in which a folder is closed and more information is displayed on the screen, it is necessary to reach the target node while expanding and displaying the folder in the upper layer of the target node. . In addition, the child nodes of the folder to be expanded are displayed on the screen by the expanded display of the folder. However, if the number of child nodes is large, a screen scroll operation or the like becomes necessary. Thus, as the number of information elements and the number of hierarchies increase, the operation to reach the target node becomes troublesome.

  In order to solve such a problem, there is, for example, Patent Document 2 as a prior art that employs simplification of the display tree. Patent Document 2 creates and displays a partial tree composed only of elements designated by the user. In particular, even when the hierarchy is deep, elements in the intermediate hierarchy can be omitted and displayed, and a tree including necessary elements can be displayed very compactly.

Japanese Patent Laid-Open No. 1-156843 Japanese Patent Laid-Open No. 11-45197

  However, in this prior art, the user must specify a target node and create a partial tree structure in advance. Further, since the hierarchical structure of the designated portion is formed, it is not possible to access nodes other than those designated in advance.

  As described above, conventionally, initial setting is necessary, or access to other than the target node is impossible. In addition, when trying to solve these problems, there is a possibility that new problems may occur in other parts such as a large processing load and cost on the system side.

  An object of the present invention is to improve user operability by solving at least one of the above problems by providing an improved tree structure display program, method or apparatus.

  In order to achieve the above object, a tree structure display program according to the present invention provides a computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure. An expansion reference node setting processing means for setting the specified element as an expansion reference node of the display tree, which is an element displayed in a closed state in which elements located in lower layers are hidden, and at least numerical data is input The input unit functions as a tree structure display processing unit that uses the input numerical data as a node expansion condition, and expands and displays an expansion reference node and a lower node that matches the node expansion condition.

  Further, the tree structure display processing means sequentially expands and displays from the shallowest node of the expansion reference node by the number of input numerical data.

  Further, the tree structure display processing means excludes lower nodes of the expansion reference node having child nodes equal to or more than the number of input numerical data from being subjected to expansion display.

  A tree structure display program according to another invention does not display a computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure, and does not display elements located in a lower layer from the set of elements in a hierarchical relationship Expansion reference node setting processing means for setting the specified element as the expansion reference node of the display tree, the history information of the access when the user has accessed the element Access record means for recording the history information in the history information storage means, with reference to the access history information recorded in the history storage means among the lower nodes of the expansion reference node, the lower order that matches the expansion reference node and the set node expansion condition It functions as a tree structure display processing means for bringing a node into a display state.

  The tree structure display processing means expands and displays only the nodes located on the route from the expansion reference node to the lower node of the expansion reference node accessed most recently by referring to the access history information. Features.

  Further, the computer further functions as an input means for inputting an access frequency for the display target node, and the tree structure display processing means refers to the access history information to thereby input the access frequency input from the expansion reference node. Only the nodes located on the route to the lower node of the expansion reference node corresponding to are expanded and displayed.

  The tree structure display method according to the present invention is implemented by a computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure, and an element located in a lower layer is hidden from the set of elements in a hierarchical relationship. An element that is displayed in a closed state and is designated as a display tree expansion reference node, a step that inputs at least numeric data, and the numeric data that is input as a node expansion condition And a step of expanding and displaying the expansion reference node and the lower nodes that match the node expansion condition.

  A tree structure display method according to another invention is implemented by a computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure, and an element located in a lower layer is selected from the set of elements in a hierarchical relationship. Set the specified element as a display tree expansion reference node that is displayed in a closed state to be hidden, and history information of the access when the user accesses the element A step of recording in the information storage means, and referring to the access history information recorded in the history storage means among the lower nodes of the expansion reference node, displaying the expansion reference node and the lower nodes matching the set node expansion conditions And a step of making a state.

  A tree structure display device according to the present invention is a tree structure display device having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure. An element located in a lower layer is selected from a set of elements in a hierarchical relationship. An expansion reference node setting processing means for setting a specified element as a display tree expansion reference node, which is an element displayed in a closed state to be hidden, an input means for inputting at least numeric data, and an input It is characterized by having tree structure display processing means for displaying numerical data as node expansion conditions and expanding reference nodes and lower nodes that match the node expansion conditions.

  A tree structure display device according to another invention is a tree structure display device having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure, and is located in a lower layer from the set of elements in a hierarchical relationship Expansion reference node setting processing means for setting the designated element as the expansion reference node of the display tree, which is an element that is displayed in a closed state that is hidden, history information storage means for storing access history information, An access recording means for recording the access history information in the history information storage means when the user accesses the element; and access history information recorded in the history storage means among the lower nodes of the expansion reference node. A tree structure display processing means for displaying, as a reference, a display state of a subordinate node that matches the expansion reference node and the set node expansion condition; Characterized in that it has.

  According to the present invention, each node in the closed state located between the expansion reference node in the closed state and the node to be displayed can be manually manually input only by inputting the node expansion condition or by referring to the access history information. It is possible to automatically expand and display without expanding and displaying. Thereby, user operability at the time of node display can be improved. Further, in order to improve operability, it is not necessary to perform a special initial setting, and it is not necessary to set a display target node in advance.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

Embodiment 1 FIG.
FIG. 1 is a hardware configuration diagram of a computer corresponding to a tree structure display device according to the present invention. The computer 1 used in the present embodiment can be realized with a general-purpose hardware configuration that has existed in the past. That is, as shown in FIG. 1, the computer 1 is provided with a CPU 2, a ROM 4, a RAM 6, an HDD controller 10 connected to a hard disk drive (HDD) 8, a mouse 12 and a keyboard 14 provided as input means, and a display device. An input / output controller 18 for connecting each display 16 is connected to an internal bus 20.

  FIG. 2 is a functional block configuration diagram of the computer 1 in the present embodiment. The computer 1 includes an input processing unit 21, an expansion reference node setting processing unit 22, a tree structure display processing unit 23, and a node information storage unit 24. The input processing unit 21 inputs various data input by the user using an input unit. The expansion reference node setting processing unit 22 sets the element displayed in the closed state designated by the user as the expansion reference node of the display tree. The closed state is a display state when the element is displayed without displaying an element located in a lower layer of the element because of the hierarchical relationship. An “element” is an element that forms a hierarchical structure such as a folder or a file. Since a set of elements has a hierarchical relationship, elements displayed in a tree are collectively referred to as “nodes”. The tree structure display processing unit 23 displays all or part of the tree structure of elements having a hierarchical relationship on the screen in accordance with data input from the user. In particular, the tree structure display processing unit 23 in the present embodiment treats input numerical data as the number of expanded display nodes, and expands and displays lower nodes of the expanded reference node by the number of expanded display nodes input. The node information storage unit 24 stores information regarding each node such as attribute information including the name of the node and the like, and tree structure information indicating the hierarchical relationship between the nodes.

  In the present embodiment, the node information storage unit 24 holds information necessary for implementing the present embodiment. However, the necessary information is stored in the node information storage unit 24 in the computer 1. The configuration is not limited, and may be configured to be acquired via a network, for example. Further, it is assumed that the node information storage unit 24 illustrated in FIG. 2 is realized by the HDD 8 illustrated in FIG. Of course, necessary data may be copied to the RAM 6 before use.

  In addition, the processing functions in the components 21 to 23 are realized by a cooperative operation between the computer 1 and one or more tree structure programs that realize the processing functions.

  Subsequently, the operation in the present embodiment will be described. The tree structure display example used in the following description is based on the explorer in Windows (registered trademark) of Microsoft Corporation. For example, as shown in FIG. 3, each node is arranged according to its position in the hierarchical structure, and is displayed by connecting the nodes with a line (hereinafter also referred to as “branch”). Thus, in the tree display representing the hierarchical structure, the lines connecting the nodes have a parent-child relationship direction. A generally vertical branch indicating a sibling relationship and each node are connected by a plus icon indicating a closed state of a folder or a minus icon indicating an open state. In each drawing, display elements that are not necessary for explanation such as folder names are omitted as appropriate.

  The present invention is characterized in that the expansion of the lower layer of the node (expansion reference node) designated by the user is automatically performed according to the set node expansion condition. The present embodiment is characterized in that, in particular, lower nodes of the expansion reference node are expanded and displayed based on the number of nodes as a criterion.

  For example, when a node P (hereinafter referred to as “target node”) P that the user wants to refer to on the display tree is in a non-display state because an upper node of the target node P is in a closed state, the user is As shown in FIG. 3A, the uppermost node 30 in the closed state on the display screen or the plus icon 31 of the node 30 is selected and clicked to expand and display. That is, it displays in an open state. If the child nodes 32 and 33 of the selected node 30 are displayed in the closed state as illustrated in FIG. 3B, the target node P is not displayed yet, so the user sets the target node P as a child. Further, the child node 32 is expanded and displayed by selecting and clicking. The user can display the target node P by repeatedly performing such selection of a node and a click operation for expanding and displaying the node.

  On the other hand, in the present embodiment, the lower nodes of the expansion reference node are automatically expanded and displayed by the number of expansion display nodes designated by the user. That is, when the operation in the present embodiment is described with reference to FIG. 3, the user selects the node 30 in a closed state by moving the mouse cursor to the closed node 30 and selecting it by a single click. When the input processing unit 21 accepts this user operation, the expansion reference node setting processing unit 22 sets the node 30 displayed in the closed state selected by the user as the expansion reference node of the display tree. After selecting the expansion reference node, the user inputs and designates the number of nodes to be expanded and displayed by pressing a numeric key on the keyboard 14. For example, when the target node P is to be displayed, an approximate number of expanded display nodes is input and designated. Since the tree structure display processing unit 23 can grasp the hierarchical relationship between the elements by referring to the node information storage unit 24, it can naturally grasp the tree structure of the lower nodes of the expansion reference node 30. Therefore, when the input processing unit 21 receives the numerical data input by this user operation, the tree structure display processing unit 23 sets the numerical data input among the lower nodes of the expansion reference node as the number of expanded display nodes. Expand and display only minutes. In the present embodiment, the expansion reference node is used as a root, and the expansion display is sequentially performed from the shallowest node. A tree display example when the user inputs “5” as the number of expanded display nodes is shown in FIG.

  In FIG. 3C, the numbers in parentheses shown beside each folder icon indicate the order in which the folders are selected for expansion display. The numbers in parentheses are shown for convenience of explanation and are not actually displayed on the screen. According to the present embodiment, in order to display the target node 34, according to the present embodiment, the closed node 35 located between the expansion reference node 30 and the node 34 must be clicked. Then, the target node P can be displayed without performing multiple selections and clicking operations by simply inputting the number of expansion display nodes to be automatically expanded at one time.

  By the way, in the above-described example, the optimum example in which the target node P corresponds to the fifth node displayed in an expanded manner has been described. If the number of nodes is small or if the hierarchical structure is grasped in detail, such a target node P may be displayed, but if the number of elements increases and the hierarchical structure becomes complex, Normally, it is not known what number the order in which nodes P are expanded and displayed. Therefore, in such a case, the user selects the expansion reference node 30 and inputs the approximate number of expansion display nodes. If the target node P is not displayed, the selection of the expansion reference node 30 and the input of the number of expansion display nodes (usually a larger number than the previous time) may be performed again.

  According to the present embodiment, only by inputting the number of expanded display nodes, the target node is displayed without manually expanding and displaying each of the closed nodes positioned between the closed expanded reference node and the target node. It becomes possible. Thereby, user operability at the time of node display can be improved. Further, in order to improve operability, it is not necessary to perform a special initial setting, and it is not necessary to set a target node to be displayed in advance. This embodiment in which the number of expanded display nodes is set as the node expansion condition is suitable when the number of elements is relatively small.

Embodiment 2. FIG.
In the first embodiment described above, the number of expanded display nodes is input as the node expansion condition by the user, and the corresponding number of nodes are automatically expanded and displayed. On the other hand, in this embodiment, by letting the user input the number of expansion upper limit child nodes as the node expansion condition, the lower nodes of the expansion reference node having child nodes greater than or equal to the upper limit number of expansion child nodes can be expanded and displayed. It is characterized by being outside. Hereinafter, the operation of the present embodiment will be described with reference to FIG. The apparatus configuration in the present embodiment may be the same as that in the first embodiment, and only the processing contents in the tree structure display processing unit 23 are different.

  Also in the present embodiment, the user operation is the same as that of the first embodiment, that is, the user selects the closed node 30 by moving the mouse cursor to the node 30 and making a single click or the like, and then pressing the numeric key on the keyboard 14. Press to specify the node expansion condition.

  The expansion reference node setting processing unit 22 sets the node 30 selected by the user as the expansion reference node of the display tree. Subsequently, the tree structure display processing unit 23 in the present embodiment interprets numerical data input as a node expansion condition by the user as the expansion upper limit child node number. Then, the tree structure display processing unit 23 sequentially expands only the lower nodes of the expansion reference node 30 having the number of child nodes smaller than the number of expansion upper limit child nodes input by the user among the lower nodes of the expansion reference node toward the lower layer. Display. When a lower node of the expansion reference node 30 having child nodes equal to or larger than the expansion upper limit child node appears, the expanded display from the node toward the lower layer is stopped. FIG. 4 shows a tree display example when the user inputs “2” as the expansion upper limit child node number.

  In FIG. 4, the numbers in parentheses shown beside each folder icon indicate the number of child nodes that each folder has. The numbers in parentheses are shown for convenience of explanation and are not actually displayed on the screen. In this example, since the number of upper limit child nodes for expansion is “2”, only nodes having only one child node are expanded and displayed toward the lower layer. Therefore, as illustrated in FIG. 4, each lower node 36 of the expansion reference node 30 has only one child node, so that the tree structure display processing unit 23 automatically expands and displays the lower nodes 36 sequentially. Go. Since the node 37 has four child nodes equal to or larger than the number of expansion upper limit child nodes and does not meet the node expansion condition of the number of expansion upper limit child nodes “2”, the tree structure display processing unit 23 Stop expanding the display to lower layers. Subsequently, the tree structure display processing unit 23 tries to perform the above-described expansion display on the other child nodes 38 of the expansion reference node 30, and the child node 38 has three children equal to or greater than the number of expansion upper limit child nodes. Since the node has a node and does not match the node expansion condition, the tree structure display processing unit 23 does not expand and display the node. That is, the child node 38 is displayed with the closed state maintained.

  The present embodiment is characterized in that the expanded display of nodes having more child nodes than the upper limit number of expanded child nodes set as described above is not performed. In general, when managing source files in software development, there are many cases in which files are managed without having a plurality of child nodes in each node as illustrated in FIG. This embodiment is suitable for displaying a node located in a lower layer in such a hierarchical structure, because it is not necessary to sequentially expand and display closed nodes, thereby improving operability. Can do.

Embodiment 3 FIG.
In the first and second embodiments, the nodes on the display tree are automatically expanded and displayed while paying attention to the number of nodes. In the present embodiment and the fourth embodiment described below, the nodes on the display tree are automatically expanded and displayed by paying attention to the access history of the nodes.

  FIG. 5 is a functional block configuration diagram of the computer 1 according to the present embodiment. The same components as those in FIG. 1 are denoted by the same reference numerals, and the description thereof is omitted as appropriate. In the present embodiment, in addition to the configuration of the first embodiment, an access recording unit 25 and an access history information storage unit 26 are provided. The access recording unit 25 records the access history information in the access history information storage unit 26 when the user accesses the element. The history information recorded in the access history information storage unit 26 includes at least the identification information of the accessed user, the access time, and the identification information of the accessed node. The access history information storage unit 26 is assumed to be realized by the HDD 8 shown in FIG. Of course, necessary data may be copied to the RAM 6 before use. The processing function in the access recording unit 25 is realized by a cooperative operation between the computer 1 and a tree structure program that realizes the processing function.

  Next, the operation in this embodiment will be described with reference to FIG. The user moves the mouse cursor to the closed node 30 and selects it by single clicking. When the input processing unit 21 accepts this user operation, the expansion reference node setting processing unit 22 sets the node 30 displayed in the closed state selected by the user as the expansion reference node of the display tree. The tree structure display processing unit 23 in the present embodiment performs the following processing using a single click by the user as a trigger. In addition, as a trigger for the tree structure display processing unit 23 to start processing, the user may separately make some key input or the like.

  First, the tree structure display processing unit 23 refers to the access history information storage unit 26 to check the latest access time for each subordinate node of the expansion reference node 30, and the most recently accessed node Is identified. Note that the hierarchical relationship between elements can be grasped by referring to the node information storage unit 24 as in the above embodiments. Then, the tree structure display processing unit 23 expands and displays only the nodes located on the route from the expansion reference node 30 to the identified node, and sets the display state. A tree display example at this time is shown in FIG.

  In FIG. 6, the numbers in parentheses shown beside each folder icon indicate the time when the folder was most recently accessed. For convenience, the date is omitted assuming that all accesses were made on the same day. The numbers in parentheses are shown for convenience of explanation and are not actually displayed on the screen. Of course, it may be displayed. As apparent from FIG. 6, the node 39 accessed most recently at the subordinate node of the expansion reference node 30 is the node 39 accessed at 6:30. Therefore, the tree structure display processing unit 23 changes the node 39 to In order to display, each node 40 located on the path from the expansion reference node 30 to the node 39 is automatically expanded and displayed. Since the node 41 is not a lower node of the expansion reference node 30 accessed most recently, it is excluded from the expansion display target.

  For example, when managing a source file in software development, the source file is generally held and managed in a predetermined folder. Therefore, it is considered that the user often accesses the same folder continuously during development of the source file. In the present embodiment, as described above, in accordance with the latest access time to each lower node of the expansion reference node 30, the expansion is performed automatically from the expansion reference node 30 to the node 39 that has been accessed most recently among the lower nodes. Since the display is made, the expanded display can be performed without clicking each node 40 existing between the expanded reference node 30 and the node 39. As described above, this embodiment is particularly effective when it is desired to continuously access the latest accessed node, and the operability of the user can be improved.

Embodiment 4 FIG.
While the third embodiment focuses on the access time in the access history information, the present embodiment is characterized by focusing on the access frequency. The apparatus configuration in the present embodiment may be the same as that in the third embodiment, and only the processing contents in the tree structure display processing unit 23 are different.

  The operation in this embodiment will be described with reference to FIG. The user moves the mouse cursor to the closed node 30 and selects it by single clicking. When the input processing unit 21 accepts this user operation, the expansion reference node setting processing unit 22 sets the node 30 displayed in the closed state selected by the user as the expansion reference node of the display tree. The tree structure display processing unit 23 performs the following processing with a single click by the user as a trigger. In addition, as a trigger for the tree structure display processing unit 23 to start processing, the user may separately make some key input or the like.

  First, the tree structure display processing unit 23 refers to the access history information storage unit 26 to calculate the access frequency for each lower node of the expansion reference node 30. The access frequency is calculated by accumulating the number of accesses in a certain period, but in this embodiment, the end of the period is the current time, the start is the end and a predetermined period before, for example, one month. It is not necessary to set a period because it is fixedly determined in advance. However, a system administrator, a user, or the like may be provided with a means for changing the target period so that it can be changed as appropriate. Further, the access frequency may be obtained for each user by comparing the identification information of the currently operated user with the user identification information stored in the access history information.

  As described above, the tree structure display processing unit 23 obtains the access frequency of each lower node of the expansion reference node 30 in a predetermined period, and identifies the node having the highest access frequency from among them. Then, the tree structure display processing unit 23 expands and displays only the nodes located on the route from the expansion reference node 30 to the identified node, and sets the display state. A tree display example at this time is shown in FIG.

  In FIG. 7, the numbers in parentheses shown beside each folder icon indicate the frequency of access to the folder within a predetermined period. The numbers in parentheses are shown for convenience of explanation and are not actually displayed on the screen. Of course, it may be displayed. As is clear from FIG. 7, the node 42 most accessed in the lower nodes of the expansion reference node 30 is the node 42 accessed 30 times. Therefore, the tree structure display processing unit 23 displays the node 42 in order to display it. Each node 43 located on the path from the expansion reference node 30 to the node 42 is automatically expanded and displayed. Since the node 44 does not correspond to a lower node of the most accessed expansion reference node 30, it is excluded from the expansion display target.

  According to the present embodiment, it is possible to automatically expand and display the nodes existing between the expansion reference node 30 and the target node with priority on the access frequency, that is, the node having the highest access frequency.

Embodiment 5. FIG.
In the present embodiment, the processing contents described in each of the above embodiments can be selectively performed, and a modification of the user input method of the above-described first, second, and fourth embodiments is shown. In the present embodiment, any one of the node expansion display methods described in the first to fourth embodiments can be selected from the pop-up menu list.

  FIG. 8 is a diagram for explaining a user input method corresponding to the first embodiment. After the selection of the expansion reference node 30, in the first embodiment, the number of expanded display nodes is input by pressing a numeric key from the keyboard 14, but in the present embodiment, the expanded display node is as follows. Enter a number. That is, after selecting the expansion reference node 30, the user right-clicks the expansion reference node 30 to display the pop-up menu 50. Then, a window 51 for inputting the number of expanded display nodes is displayed by bringing the mouse cursor (not shown) to a menu item expanded from the pop-up menu 50 by the expanded display node number. Then, the number of expanded display nodes is input to the input field in the window 51 by operating the keyboard 14. Thereafter, the tree structure display processing unit 23 expands and displays lower nodes of the expansion reference node by the number of input expansion display nodes as described in the first embodiment in response to a predetermined trigger operation by the user.

  FIG. 9 is a diagram for explaining a user input method corresponding to the second embodiment. After the selection of the expansion reference node 30, in the second embodiment, the number of expansion upper limit child nodes is input by pressing a numeric key from the keyboard 14, but in this embodiment, the upper limit of expansion is performed as follows. Enter the number of child nodes. That is, after selecting the expansion reference node 30, the user right-clicks the expansion reference node 30 to display the pop-up menu 50. Then, a window 51 for inputting the number of expansion upper limit nodes is displayed by putting a mouse cursor (not shown) on a menu item to be expanded with the number of expansion upper limit nodes from the pop-up menu 50. Then, the number of expansion upper limit child nodes is input to the input field in the window 51 by operating the keyboard 14. Thereafter, the tree structure display processing unit 23, as described in the second embodiment according to a predetermined trigger operation by the user, only the lower nodes of the expansion reference node having a number of child nodes less than the input upper limit number of child nodes. Are expanded and displayed sequentially toward the lower layer.

  After the selection of the expansion reference node 30, in the third embodiment, only the nodes located on the route from the expansion reference node 30 to the latest accessed lower node are expanded and displayed according to a predetermined trigger. In the present embodiment, the number of expanded display nodes is input as follows. That is, after selecting the expansion reference node 30, the user right-clicks the expansion reference node 30 to display the pop-up menu as described with reference to FIGS. Then, a menu item to be expanded from the pop-up menu to the latest node is selected by double-clicking the mouse cursor (not shown) on the menu item. As described in the third embodiment, the tree structure display processing unit 23 performs only the node located on the route from the expansion reference node 30 to the latest accessed lower node according to a predetermined trigger operation such as a double click by the user. Is expanded and displayed.

  FIG. 10 is a diagram for explaining a user input method corresponding to the fourth embodiment. After the selection of the expansion reference node 30, in the fourth embodiment, only the nodes located on the route from the expansion reference node 30 to the lower order node having the highest access frequency within a predetermined period are displayed in an expanded manner in response to a predetermined trigger. In the present embodiment, the number of expanded display nodes is input as follows. That is, after selecting the expansion reference node 30, the user right-clicks the expansion reference node 30 to display the pop-up menu 50. Then, a mouse cursor (not shown) is set to the menu item expanded from the pop-up menu 50 with the access frequency. When the tree structure display processing unit 23 detects that the mouse cursor is placed on the menu item to be expanded at this access frequency, the tree structure display processing unit 23 refers to the access history information storage unit 26 to determine a predetermined period for each lower node of the expansion reference node 30. Calculate the access frequency within. Note that the setting of the predetermined period is as described above in the fourth embodiment. When the access frequency of each lower node is obtained, the tree structure display processing unit 23 extracts a predetermined number of lower nodes in descending order of the access frequency, and displays the menu item described by the node name and the access frequency to the node. A sub menu 52 including a predetermined number of menu items is created and displayed. The predetermined number shown in FIG. 10 is “4”, but it is not necessary to limit to this number. In addition, the number of menu items included in the submenu 52 can be appropriately changed. The user selects a node to be referred to from the created and displayed submenu 52. The tree structure display processing unit 23 expands and displays only the nodes located on the route from the expansion reference node 30 to the lower node selected by the user according to the selection operation by the user. In the fourth embodiment, the subordinate nodes to be expanded and displayed are limited to the subordinate nodes having the highest access frequency, but in this embodiment, a predetermined number of subordinate nodes having the high access frequency can be selected. did. Of course, as in the fourth embodiment, when a menu item to be expanded with the access frequency is selected from the pop-up menu 50, only the nodes located on the route from the expansion reference node 30 to the lower-level node with the highest access frequency are selected. May be expanded and displayed.

It is a hardware block diagram which showed position embodiment of the tree structure display apparatus which concerns on this invention. It is a functional block block diagram of the tree structure display apparatus in this Embodiment. It is the figure which showed the tree display example of the low-order node of the expansion | deployment reference | standard node which the user selected in this Embodiment. FIG. 10 is a diagram showing a tree display example of lower nodes of an expansion reference node selected by a user in the second embodiment. FIG. 10 is a functional block configuration diagram of a tree structure display device in a third embodiment. FIG. 10 is a diagram showing a tree display example of lower nodes of an expansion reference node selected by a user in the third embodiment. FIG. 16 is a diagram showing a tree display example of lower nodes of an expansion reference node selected by a user in the fourth embodiment. It is a figure used in order to explain the modification of the user input method explained in each embodiment in Embodiment 5. It is a figure used in order to explain the modification of the user input method explained in each embodiment in Embodiment 5. It is a figure used in order to explain the modification of the user input method explained in each embodiment in Embodiment 5.

Explanation of symbols

  1 Computer, 2 CPU, 4 ROM, 6 RAM, 8 Hard Disk Drive (HDD), 10 HDD Controller, 12 Mouse, 14 Keyboard, 16 Display, 18 Input / Output Controller, 20 Internal Bus, 21 Input Processing Unit, 22 Deployment Reference Node Setting processing unit, 23 tree structure display processing unit, 24 node information storage unit, 25 access recording unit, 26 access history information storage unit.

Claims (10)

A computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Expanding reference node setting that sets the specified element as the expansion reference node of the display tree that is displayed in a closed state that hides the elements located in the lower layer from the set of elements in a hierarchical relationship Processing means,
Input means for inputting at least numerical data;
Tree structure display processing means for displaying the input numerical data as a node expansion condition, and expanding and displaying an expansion reference node and a lower node that matches the node expansion condition,
Tree structure display program to function as. In the tree structure display program according to claim 1,
The tree structure display processing means sequentially expands and displays from the shallowest node of the expansion reference node by the number of input numerical data. In the tree structure display program according to claim 1,
A tree structure display program characterized in that the tree structure display processing means excludes lower nodes of an expansion reference node having child nodes equal to or more than the number of input numerical data from being subjected to expansion display. A computer having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Expanding reference node setting that sets the specified element as the expansion reference node of the display tree that is displayed in a closed state that hides the elements located in the lower layer from the set of elements in a hierarchical relationship Processing means,
An access recording means for recording the history information of the access to the history information storage means when the user accesses the element;
A tree structure display processing means for displaying a development base node and a subordinate node that matches a set node development condition with reference to access history information recorded in the history storage means among the subordinate nodes of the development base node;
Tree structure display program to function as. In the tree structure display program according to claim 4,
The tree structure display processing means expands and displays only the nodes located on the path from the expansion reference node to the lower node of the expansion reference node that is accessed most recently by referring to the access history information. Tree structure display program. 5. The tree structure display program according to claim 4, further comprising: a computer;
Function as an input means to input the access frequency to be displayed nodes,
The tree structure display processing means expands and displays only the nodes located on the path from the expansion reference node to the lower node of the expansion reference node corresponding to the input access frequency by referring to the access history information. A tree structure display program characterized by that. Implemented on a computer having the function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Setting a specified element as an expansion reference node of a display tree, which is an element displayed in a closed state that hides an element located in a lower layer from a set of elements in a hierarchical relationship;
Entering at least numeric data;
Expanding and displaying input numerical data as node expansion conditions, expansion reference nodes and lower nodes that match the node expansion conditions;
A tree structure display method comprising: Implemented on a computer having the function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Setting a specified element as an expansion reference node of a display tree, which is an element displayed in a closed state that hides an element located in a lower layer from a set of elements in a hierarchical relationship;
Recording the access history information in the history information storage means when the user accesses the element;
Referring to the access history information recorded in the history storage means among the lower nodes of the expansion reference node, setting the expansion reference node and a lower node that matches the set node expansion condition to a display state;
A tree structure display method comprising: In a tree structure display device having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Expanding reference node setting that sets the specified element as the expansion reference node of the display tree that is displayed in a closed state that hides the elements located in the lower layer from the set of elements in a hierarchical relationship Processing means;
An input means for inputting at least numeric data;
Tree structure display processing means for displaying the input numerical data as a node expansion condition, and expanding and displaying an expansion reference node and a lower node that matches the node expansion condition;
A tree structure display device comprising: In a tree structure display device having a function of displaying a set of elements in a hierarchical relationship on a screen in a tree structure,
Expanding reference node setting that sets the specified element as the expansion reference node of the display tree that is displayed in a closed state that hides the elements located in the lower layer from the set of elements in a hierarchical relationship Processing means;
History information storage means for storing access history information;
An access recording means for recording history information of the access to the history information storage means when there is an access to an element by a user;
Tree structure display processing means for referring to the access history information recorded in the history storage means among the lower nodes of the expansion reference node and displaying the expansion reference node and the lower nodes that match the set node expansion condition, as a display state; ,
A tree structure display device comprising:

Images