JP4936369B2 - Information processing apparatus, information processing apparatus control method, program, and recording medium - Google Patents

Description

  The present invention relates to an information processing apparatus that hierarchically manages data and folders storing the data, a control method for the information processing apparatus, a program, and a recording medium.

  Conventionally, in the tree display of the search result display of files and folders, if the hierarchy is deep, the tree becomes redundant and it is difficult to identify the target folder.

In Patent Document 1, when displaying the search result of a document, the user needs to display only the folder including the searched document (or the folder including the searched document and their upper folder) in the tree. A technique has been proposed in which only a hierarchy related to a document to be displayed is displayed and a necessary document can be accessed without being disturbed by other unrelated hierarchies.
Japanese Patent Laid-Open No. 2002-333938

  However, in the method of displaying only the folder containing the searched document in Patent Document 1, since the intermediate hierarchy is not displayed, the hit folder has good accessibility, but when the folder with the same name is hit, Since the upper hierarchy is unknown, there is a problem that it is difficult to identify the target folder.

  Further, in the method of displaying a folder including a searched document and the upper hierarchy thereof in Patent Document 1, since the upper hierarchy is displayed when a folder with the same name is hit, the identification becomes easy. In the case where the depth is deep, there is a problem that the display becomes complicated and the accessibility to the hit target folder is deteriorated.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to make it possible to easily grasp the hierarchical structure of the upper folder while maintaining the accessibility to the folder hit by the search. Thus, even if the target folder has a deep hierarchy, a mechanism for constructing a comfortable operation environment for easily accessing the target folder is provided.

According to the present invention, in an information processing apparatus that manages a node group as a tree structure, a tree display means for displaying a plurality of different nodes in the node group in a tree structure in a display area, and a target to be displayed by a user Or, a node identification unit that identifies a plurality of nodes, a branch determination unit that determines whether or not there are a plurality of nodes that are one level lower than the node in the tree structure, and a display in the display area For each of the plurality of different nodes to be processed , a process of abstracting a group of nodes of a plurality of hierarchies determined to have no branching by the branch determination unit into one node from each node specified by the node specification unit and a node abstraction means for repeatedly executed for a node of the upper layer, respectively, the tree display unit, said node In the tree structure of the abstract node by Zoka means, said plurality of different nodes, and displaying in the display area.

  According to the present invention, even when the hierarchy of a target folder such as a folder hit in a search is deep, it is possible to easily grasp the hierarchical structure of the upper folder while maintaining accessibility to the target folder. In this way, it is possible to construct a comfortable operation environment for easily accessing a target folder.

  FIG. 1 is a block diagram showing an example of a hardware configuration of an information processing apparatus showing an embodiment of the present invention.

  In FIG. 1, reference numeral 1 denotes a computer as an information processing apparatus.

  Reference numeral 1b denotes a CPU which executes a program read from the external memory 1e to the memory 1a and controls the computer 1 in an integrated manner.

  1a1 is a work area of the CPU 1b secured in the memory 1a. Reference numeral 1a2 denotes a search system (program) having a control function for creating and displaying a tree having a specific folder read from the external memory 1e into the memory 1a and each folder in the upper hierarchy by the CPU 1b as nodes.

  Reference numeral 1c denotes an input device such as a keyboard or a pointing device (PD). 1d is a display.

  Actually, there are a system bus, an interface circuit, a chip set, etc. in addition to the above, but they are omitted in FIG.

  The computer 1 is an information processing apparatus capable of hierarchically managing data stored in the external memory 1e and the like and a folder storing the data. Hereinafter, the CPU 1b when such a computer 1 creates a tree (tree structure diagram) in which each folder is a node (node) of a specific folder and a folder in a hierarchy higher than the specific folder and displays it on the display. Control will be described.

  FIG. 2 is a block diagram illustrating an example of a software configuration of the information processing apparatus according to the present invention.

  In FIG. 2, reference numeral 2a1 denotes a search keyword input processing unit, which accepts an input of a keyword for performing a search from the input device 1c. Reference numeral 2a2 denotes a search processing unit which executes a search process using the keyword input by the search keyword input processing unit 2a1 and stores the search result in the search result storage DB 3a.

  A branch determination processing unit 2a3 executes a process of determining a branch node based on the search result stored in the search result storage DB 3a, and stores the branch determination result in the node information storage DB 3b.

  An abstraction unit 2a4 is an abstraction process that abstracts together nodes that can be omitted based on the search result stored in the node information storage DB 3b. Information relating to the abstracted node is stored in the abstracted node information storage DB 3c.

  2a5 is a size measuring unit that measures (calculates and acquires) the display width of the folder tree, measures (acquires) the width of the tree window, and stores the width of the folder tree in the size measurement DB 3d as the measurement result. Store and control whether the abstraction unit 2a4 executes the abstraction process. Reference numeral 2a6 denotes a tree display unit, which displays a tree of search results.

  The units 2a1 to 2a6 are realized by the CPU 1b shown in FIG. 1 reading out the search system program from the external memory to the memory 1a and executing it. Each database shown in 3a to 3d is realized in the work area 1a1 in the memory 1a by the CPU 1b.

  Hereinafter, the structure of a database used in the information processing apparatus of the present invention will be described with reference to FIGS.

  FIG. 3 is a database configuration diagram showing the configuration of the search result storage DB 3a shown in FIG.

  As shown in FIG. 3, the search result storage DB 3a includes items of a search result ID 3a1 and a search result path 3a2.

  The search result ID 3a1 stores the ID assigned to the search result. The search result path 3a2 stores the search result path.

  FIG. 4 is a database configuration diagram showing the configuration of the node information storage DB 3b shown in FIG.

  As shown in FIG. 4, the node information storage DB 3b includes items of a node ID 3b1, a path 3b to the node, a parent node ID 3b 3, a branch flag 3b 4, a checked flag 3b 5, and a hit flag 3b 6.

  The node ID 3b1 stores the ID assigned to each node. The path 3b2 to the node stores the path to the node. The parent node ID 3b3 stores the ID of the parent node of the node.

  In addition, the branch flag 3b4 stores ON / OFF of the branch flag possessed by the node. The checked flag 3b5 stores ON / OFF of the checked flag that the node has. The hit flag 3b6 stores ON / OFF of whether the node hits the search.

  FIG. 5 is a database configuration diagram showing the configuration of the abstraction node information storage DB 3c shown in FIG.

  As shown in FIG. 5, the abstract node information storage DB 3c is composed of items of abstract node ID 3c1, abstract display data 3c2, and parent node ID 3c3.

  The abstract node ID 3c1 stores the ID assigned to the abstract node. Further, the abstracted display data 3c2 stores the path of the node that is abstractly displayed. The parent node ID 3c3 stores the ID of the parent node of the node.

  FIG. 6 is a database configuration diagram showing the configuration of the size measurement DB 3d shown in FIG.

  As shown in FIG. 6, the size measurement DB 3d is composed of items of search result ID 3d1 and tree width 3d2.

  The search result ID 3d1 stores the ID assigned to the search result. The tree width 3d2 stores the measured tree width.

  Hereinafter, the search and the folder tree display process of the search result according to the present invention will be described with reference to FIGS.

  7A and 7B are schematic diagrams for explaining a folder tree displayed by the search and the folder tree display process of the search result according to the present invention.

  In FIG. 7A, reference numeral 5a1 denotes a folder tree of a conventional search result. Conventionally, all nodes up to hit files or folders are displayed in a tree view.

  In FIG. 7B, reference numeral 5a2 denotes a search result folder tree of the present invention. The present invention is characterized in that a tree is displayed in a state where all nodes up to a hit file or folder are abstracted together at a branch node. To do. 5a3 is an abstract display of the branch nodes together.

  FIG. 8 is a schematic diagram illustrating an example of a search screen displayed on the display 1d by the search keyword input processing unit 2a1 illustrated in FIG. 2, and corresponds to a state before the search.

  In FIG. 8, reference numeral 5b denotes a search screen, which is displayed on the display 1d by the search keyword input processing unit 2a1. Reference numeral 5b1 denotes a search keyword input unit.

  By instructing to press “display” 5b5, by selecting “display selection” (not shown) in the “display” menu displayed by the search keyword input processing unit 2a1, a display selection screen 5c shown in FIG. 9 is displayed. The user can make a display selection. Here, the display selection screen 5c will be described with reference to FIG.

  FIG. 9 is a schematic diagram illustrating an example of a display selection screen displayed on the display 1d by the search keyword input processing unit 2a1 illustrated in FIG.

  As shown in FIG. 9, the display selection screen 5c has selection buttons 5c1 to 5c3, selects any one of 5c1, 5c2, and 5c3, and designates the display method by instructing to press the OK button 5c4. be able to.

  The radio button 5c1 is selected when the tree is displayed as it is without abstracting between the branch nodes regardless of the width of the tree window. 5c2 is selected when the folder tree is displayed in accordance with the width of the tree window. The item 5c3 is selected when all the branch points of the folder tree are displayed together regardless of the width of the tree window.

  When the OK button 5c4 is instructed to be pressed, the search keyword input processing unit 2a1 stores the display selection result on the display selection screen 5c in the work area 1a1 and the external memory 1e of the memory 1a, and closes the display selection screen 5c. . The display selection result stored in the external memory 1e is used as a default value for display selection thereafter.

  Returning to the description of FIG.

  Reference numeral 5b2 denotes a search start button for instructing start of search. When the search start button 5b2 is instructed to be pressed, the search processing unit 2a2 shown in FIG. 2 starts the search and search result folder tree display processing shown in FIG. 11, which will be described later, and the user inputs to 5b1 on the search screen 5b. Search for a file or folder that matches the file name or folder name from the specified search location.

  After the search is completed, the window 5b3 becomes a tree window for displaying the search result (folder tree shown by 5a2 in FIG. 7B) as shown in FIG. Further, as shown in FIG. 10, the file 5 or folder name, folder name, related information, size, etc. as a search result are displayed in the window 5b4.

  FIG. 10 is a schematic diagram showing an example of a search screen displayed on the display 1d by the search keyword input processing unit 2a1 shown in FIG. 2, and corresponds to the state after the search is completed.

  As shown in FIG. 10, when the mouse cursor is over the abstract node 5d1 in the tree window 5b3, the tree display unit 2a6 displays the abstract display in-display data 3c2 in the abstract node information storage DB 3c shown in FIG. Based on the above, a pop-up 5d2 is displayed to indicate the grouped (abstracted) folder.

  Instead of the pop-up display as shown in 5d2, the path of the abstracted folder (for example, “eee \ fff \ ggg \ hhh”) is always displayed next to the abstract node 5d1. May be.

  The search and search result folder tree display processing according to the present invention will be described below with reference to FIGS.

  FIG. 11 is a flowchart showing an example of a first control processing procedure in the present invention, which corresponds to the search and search result folder tree display processing. The processing of this flowchart is executed by the search processing unit 2a2, the branch determination processing unit 2a3, the abstraction unit 2a4, the size measurement unit 2a5, and the tree display unit 2a6 shown in FIG. That is, it is realized by the CPU 1b shown in FIG. 1 reading the retrieval system program from the external memory to the memory 1a and executing it. In the figure, reference numerals 4a1 to 4a12 denote steps.

  In step S4a1, the search processing unit 2a2 searches the designated search location for a file or folder that matches the file name or folder name input by the user on 5b1 of the search screen 5b shown in FIG.

  Next, in step S4a2, the search processing unit 2a2 issues a search result ID to all the folder paths hit in the search process of step S4a1, and the search result ID and the folder path shown in FIG. The result is stored in the result storage DB 3a.

  Next, in step S4a3, the search processing unit 2a2 determines whether or not the search result is 0. If it is determined that the search result is 0, the search result is 0 in step S4a12. Is displayed on the search screen 5b, and the process of this flowchart is terminated.

  On the other hand, if it is determined in step S4a3 that the search result is not 0, the search processing unit 2a2 advances the process to step S4a4.

  In step S4a4, the branch decision processing unit 2a3 creates the node information storage DB 3b shown in FIG. 4 from the path information 3a2 of the search result storage DB 3a shown in FIG. The node information storage DB 3b is created for all nodes on the tree.

  At this time, the branch determination processing unit 2a3 issues a node ID that is a unique value for each node to the node ID 3b1 (regardless of how the value is assigned) and stores it. The branch determination processing unit 2a3 stores the path from the root node to each node in the path 3b2 to the node.

  The branch determination processing unit 2a3 stores the ID of the entry corresponding to the parent node in the parent node ID 3b3. Further, the branch determination processing unit 2a3 stores “ON” in a node having a plurality of child nodes and “OFF” in a node having one child node in the branch flag 3b4. The branch determination processing unit 2a3 creates an entry for each child node for a node having a plurality of child nodes.

  The branch determination processing unit 2a3 stores “OFF” as an initial value in the checked flag 3b5. Further, the branch determination processing unit 2a3 stores “ON” in the value corresponding to only the node corresponding to the node hit in the search processing in step S4a1, and stores “OFF” in the value of the other entries in the hit flag 3b6. To do.

  As described above, when the creation of the node information storage DB 3b is completed, the abstraction unit 2a4 determines whether to abstract the folders in the upper hierarchy for each branch point in the display of the search result file or folder in step S4a5. To do.

  If it is determined in step S4a5 that the folders in the upper hierarchy are not abstracted together for each branch point (ie, if “display folder tree as it is” 5c1 is selected in FIG. 9), the abstraction unit In 2a4, the process proceeds to step S4a8.

  In step S4a8, the tree display unit 2a6 displays all folder trees in the tree view, and proceeds to step S4a10.

  On the other hand, if it is determined in step S4a5 that the upper-level folders are abstracted together for each branch point (ie, “display partial folders collectively based on the tree view width” in FIG. 9 or “folders” If “5c3 is selected to display the tree collectively for each branch point”), the abstraction unit 2a4 advances the process to step S4a6.

  In step S4a6, the abstraction unit 2a4 determines whether to partially abstract or display for each branch point in the tree display of the search result displayed in the tree view of the window.

  In step S4a6, when it is determined that each branch is abstracted and displayed (that is, when “Display folder tree collectively for each branch point” 5c3 in FIG. 9 is selected), the abstraction unit is displayed. In 2a4, the process proceeds to step S4a9.

  In step S4a9, the abstraction unit 2a4 executes folder abstraction processing shown in FIGS. 12 and 13 described later, and proceeds to step S4a10.

  On the other hand, if it is determined in step S4a6 that a part is abstracted and displayed (that is, if “display a part of folders collectively based on the width of the tree view” 5c2 is selected in FIG. 9), The abstraction unit 2a4 advances the process to step S4a7.

  In step S4a7, the size measurement unit 2a5 executes a size measurement process shown in FIG. 15 to be described later, and the process proceeds to step S4a10.

  Next, in step S4a10, the tree display unit 2a6 hides folders and files not related to the search result.

  Next, in step S4a11, the tree display unit 2a6 changes the display of the hit folder so that the hit folder and the non-hit folder can be visually distinguished. Specifically, the visual form such as changing the color or shape is changed.

  When the process of step S4a11 ends, the tree display unit 2a6 ends the process of this flowchart.

  With reference to FIGS. 12 and 13, the folder abstraction process shown in step S4a9 of FIG. 11 will be described in detail.

  12 and 13 are flowcharts showing an example of the second control processing procedure according to the present invention, which corresponds to the search execution tree display processing. Note that the processing of this flowchart is executed by the abstraction unit 2a4 and the tree display unit 2a6 shown in FIG. That is, it is realized by the CPU 1b shown in FIG. 1 reading the retrieval system program from the external memory to the memory 1a and executing it. In addition, 4b1-4b13 in FIG. 12, 4c1-4c4 in FIG. 13 shows each step.

  Note that all nodes in the folder tree have three flags: a checked flag, a branch flag, and a hit flag. Each of these flags holds values such as the branch flag 3b4, the checked flag 3b5 and the hit flag 3b6 of the node information storage DB 3b shown in FIG. In either case, the value is “ON” or “OFF”, and only the checked flag 3b5 is “OFF” at the start. The checked flag 3b5 indicates whether or not the node is determined to be displayed on the screen. The initial state is “OFF”, and the determination is changed to “ON” when the determination is finished. The branch flag 3b4 indicates whether there are a plurality of child nodes under the node (whether the tree branches). “ON” has a plurality of child nodes, and “OFF” has one child node. Or the node itself is the end. The hit flag 3b6 represents a node that has been hit by the search, “ON” represents a hit folder, and “OFF” represents a folder that has not been hit.

  Hereinafter, each step of FIGS. 12 and 13 will be described.

  First, in step S4b1 in FIG. 12, the abstraction unit 2a4 starts processing by setting a check target node as a root node (a root node is a node positioned at the top of a folder tree).

  Next, in step S4b2, the abstraction unit 2a4 sets an initial value “0” in the end flag. The end flag is a flag for determining whether or not to end the entire display process. The initial value is “0”, and the end is ended when it is “1”. The end flag is stored in the memory.

  Next, in step S4b3, the abstraction unit 2a4 determines whether or not the end flag is “1”. If it is determined that the end flag is not “1”, the abstraction unit 2a4 advances the process to step S4b4.

  In step S4b4, the abstraction unit 2a4 determines whether even one check target node (root node if immediately after start) has a child node whose checked flag 3b5 is “OFF”. If it is determined that the flag 3b5 has a “OFF” child node, the process proceeds to step S4b5.

  In step S4b5, the abstraction unit 2a4 determines whether or not the branch flag of the node of the check target node is “ON”, and if it is determined to be “ON”, the process proceeds to step S4b6.

  In step S4b6, the tree display unit 2a6 executes a node display process shown in FIG. 14 to be described later, and the process proceeds to step S4b7.

  In step S4b7, the abstraction unit 2a4 moves the check target node to one of the checked flags 3b5 of “OFF” among a plurality of child nodes (how to select the child node to be the destination). The process is returned to step S4b4.

  On the other hand, in step S4b5, when the abstraction unit 2a4 determines that the branch flag of the node of the check target node is not “ON”, the process proceeds to step S4c1 in FIG.

  In step S4c1 of FIG. 13, the abstraction unit 2a4 determines whether or not the hit flag 3b6 of the node to be checked is “ON”. If it is determined that the hit flag 3b6 is not “ON”, the abstraction unit 2a4 proceeds to step S4c2. .

  In step S4c2, since the check target nodes are collected as an abstract folder, the abstraction unit 2a4 stores the information of the node in the abstract node information storage DB 3c. At this time, if the abstraction node ID 3c1 of the entry currently processed (hereinafter referred to as the current entry) is not stored in the abstraction node information storage DB 3c in the memory 1a, the abstraction unit 2a4 is abstracted as the current entry. A new entry is created in the storage node information storage DB 3c, a unique ID is assigned, and it is stored in the abstract node ID 3c1. Also, the abstraction unit 2a4 acquires the current node name from the path information (3b2 in FIG. 4) to the node of the check target node, and the data item in the abstract display on the corresponding current entry in the abstract node information storage DB 3c. Add to 3c2 (for example, add “bbb” after “aaa” to obtain “aaa ¥ bbb”). If the parent node ID 3c3 of the current entry in the abstract node information storage DB 3c is not stored, the abstraction unit 2a4 stores the parent node ID (3b3 in FIG. 4) of the check target node in the parent node ID 3c3. To do.

  Next, in step S4c3, the abstraction unit 2a4 sets the checked flag 3b5 of the node to be checked to “ON”, and advances the process to step S4b9 in FIG.

  On the other hand, if it is determined in step S4c1 of FIG. 13 that the hit flag 3b6 of the node is “ON”, the abstraction unit 2a4 advances the process to step S4c4.

  In step S4c4, the tree display unit 2a6 executes the node display process shown in FIG. 14, and advances the process to step S4b9 in FIG.

  Next, in step S4b9 in FIG. 12, the abstraction unit 2a4 moves the check target node to a child node of the check target node, and returns the process to step S4b3.

  If it is determined in step S4b4 that no check target node has any child nodes whose checked flag 3b5 is “OFF”, the abstraction unit 2a4 advances the process to step S4b10.

  In step S4b10, the tree display unit 2a6 executes a node display process shown in FIG.

  Next, in step S4b11, the abstraction unit 2a4 goes back to the parent direction from the check target node, and whether there is a node whose branch flag 3b4 is “ON” (including the root node) up to the root node. If it is determined that there is a node whose branch flag 3b4 is “ON”, the process proceeds to step S4b12.

  In step S4b12, the abstraction unit 2a4 sequentially goes back from the check target node toward the parent node until the branch flag 3b4 reaches the node where the branch flag 3b4 is “ON”, and checks the node where the branch flag 3b4 is “ON”. The target node is moved, and the process returns to step S4b3.

  On the other hand, if it is determined in step S4b11 that there is no node whose branch flag 3b4 is “ON” between the check target node and the root node going back to the parent direction (including the root node), the abstraction unit In 2a4, the process proceeds to step S4b13.

  In step S4b13, the abstraction unit 2a4 sets “1” in the end flag, and returns the process to step S4b3.

  If it is determined in step S4b3 that the end flag is “1”, the abstraction unit 2a4 ends the process of this flowchart.

  Hereinafter, the node display processing shown in FIGS. 12 and 13 will be described in detail with reference to FIG.

  FIG. 14 is a flowchart showing an example of a third control processing procedure according to the present invention, and corresponds to the node display processing. The processing of this flowchart is executed by the tree display unit 2a6 shown in FIG. That is, it is realized by the CPU 1b shown in FIG. 1 reading the retrieval system program from the external memory to the memory 1a and executing it. In addition, 4d1-4d4 in FIG. 12 shows each step.

  First, in step S4d1, the tree display unit 2a6 determines whether or not the checked flag 3b5 of the node to be checked is “ON”. The process ends.

  On the other hand, when it is determined in step S4d1 that the checked flag 3b5 of the check target node is not “ON”, the tree display unit 2a6 advances the process to step S4d2.

  In step S4d2, the tree display unit 2a6 collects the information in the buffer (the abstracted display data 3c2 of the current entry in the abstracted node information storage DB 3c on the work area 1a1 of the memory 1a) as an abstract node in the tree window 5b3. indicate. At this time, the tree display unit 2a6 associates the abstract node ID 3c1 of the current entry of the abstract node information storage DB 3c with the displayed abstract node. As a result, since the corresponding entry in the abstract node information storage DB 3c is associated with the displayed abstract node, the abstract node information is stored by an operation such as hovering the mouse cursor over the displayed abstract node. The abstracted display data 3c2 (abstracted node group path) can be obtained from the DB 3c and displayed as shown in 5b2 of FIG. Further, the tree display unit 2a6 moves the entry (current entry) currently being processed in the abstract node information storage DB 3c on the memory 1a to the next entry.

  Next, in step S4d3, the tree display unit 2a6 displays the check target node in the tree window 5b3.

  Next, in step S4d4, the tree display unit 2a6 sets the checked flag 3b5 of the node to be checked to “ON”, and ends the process of this flowchart.

  Hereinafter, the size measurement process shown in step S4a7 of FIG. 11 will be described in detail with reference to FIGS.

  FIG. 15 is a flowchart showing an example of the fourth control processing procedure in the present invention, and corresponds to the size measurement processing shown in step S4a1 of FIG. Note that the processing of this flowchart is executed by the abstraction unit 2a4, the size measurement unit 2a5, and the tree display unit 2a6 shown in FIG. That is, it is realized by the CPU 1b shown in FIG. 1 reading the retrieval system program from the external memory to the memory 1a and executing it. In the figure, reference numerals 4e1 to 4e11 denote steps.

  First, in a step (not shown), the size measurement unit 2a5 stores the number of search results held in the search result storage DB 3a shown in FIG. 3 in the work area 1a1 of the memory 1a.

  Next, in step S4e1, the size measuring unit 2a5 measures how many pixels (for example, 180 pixels) the window width of the tree window 5b3 is (in the case of Microsoft Windows (registered trademark), a folder icon using the API). And measure the width of the tree window).

  Next, in step S4e2, the size measuring unit 2a5 stores the width of the tree window 5b3 measured in step S4e1 in the work area 1a1 of the memory 1a.

  Next, in step S4e3, the size measuring unit 2a5 measures how many pixels the width of the folder icon is (for example, 15 pixels).

  Next, in step S4e4, the size measurement unit 2a5 acquires one search result from the search result storage DB 3a shown in FIG. 3 (hereinafter, the current search result), and the folder that has been hit by the search in the current search result. Measure how many pixels the name of has (eg 25 pixels).

  Next, in step S4e5, the size measurement unit 2a5 sets the measurement result in steps S4e3 and 4e4 and the maximum number of folders (for example, 13 folders) from the root folder to the folder hit in the search in the current search result. Based on this, the length of the tree that hits the search is measured (for example, 13 × 15 + 25 = 220 pixels) and stored in the work area 1a1 of the memory 1a.

  Next, in step S4e6, the size measurement unit 2a5 uses the search result ID 3a1 of the current search result and the tree width measured in step S4e5 as the search result ID 3d1 of the size measurement DB 3d shown in FIG. 6 and the tree width 3d2. Save to.

  Next, in step S4e7, the size measuring unit 2a5 compares the width of the tree window 5b3 measured in step S4e1 with the width of the tree measured in step S4e5, and compares and determines which is longer. This is shown in FIG.

  FIG. 16 is a schematic diagram schematically showing how the width of the tree window 5b3 is compared with the width of the tree.

  In FIG. 16, 5e1 indicates the width of the tree window 5b3. Reference numerals 5e2 and 5e3 denote trees.

  As shown in FIG. 16, since the width of the tree 5e2 is longer than the width 5e1 of the tree window 5b3, the tree 5e2 cannot be displayed as it is and is difficult to refer to. Therefore, the tree 5e2 is abstracted and displayed as shown in 5e4.

  On the other hand, since the width of the tree 5e3 is shorter than the width 5e1 of the tree window 5b3 and can be displayed as it is, it is displayed as it is without being abstracted.

  That is, FIG. 16 shows a state in which the folder tree is displayed with a partial abstraction in accordance with the width 5e1 of the tree window.

  Returning to the flowchart of FIG.

  If it is determined in step S4e7 in FIG. 15 that the width of the tree window 5b3 is longer than the width of the tree, it can be displayed as it is, so that the size display unit 2a5 displays the current search in the tree display unit 2a6. The resulting folder tree is displayed in the tree window 5b3 without being abstracted as shown by 5e3 in FIG. 16, and the process proceeds to step S4e10.

  On the other hand, if it is determined in step S4e7 that the width of the tree window 5b3 is shorter than the width of the tree, it cannot be displayed as it is and it is difficult to refer to it. In step S4e9, the abstraction unit 2a4 A folder abstraction process (FIGS. 12 and 13) is executed on the search result, and the folder is abstracted and displayed as indicated by 5e2 in FIG. 16, and the process proceeds to step S4e10.

  In step S4e10, the size measurement unit 2a5 decrements the number of search results stored in the work area 1a1 of the memory 1a (stores a value obtained by subtracting 1 from the number of search results as a new number of search results).

  Next, in step S4e11, the size measurement unit 2a5 determines whether or not the search result stored in the work area 1a1 of the memory 1a is 0. If it is determined that the search result is not 0, the process proceeds to step S4e3. To proceed to the next search result.

  On the other hand, if it is determined in step S4e11 that the search result stored in the work area 1a1 of the memory 1a is 0, the size measuring unit 2a5 ends the process of this flowchart.

  In the above embodiment, the case where the presence / absence of the abstraction process is determined by comparing the width of the tree window 5b3 with the width of the tree has been described. However, the number of hierarchies that can be displayed without abstraction is set in advance and stored in the external memory 1e, and the abstraction process is performed when the tree hierarchy exceeds the set hierarchy number. May be.

  In the above-described embodiment, a description is given of a configuration in which a folder that is hit by a search process or a folder that includes hit data is used as a target folder, and the target folder and a folder in a hierarchy higher than the target folder are displayed in a tree view. did. However, the target folder is not limited to the folder hit by the search, and may be a folder designated by the user or a folder specified by another application program.

  In the above-described embodiment, a configuration has been described in which display selection setting is performed in advance using the display selection screen 5c illustrated in FIG. 9, and tree display is performed based on the display selection setting. However, after the tree display, in response to changing the display selection setting on the display selection screen 5c shown in FIG. 9, the display form of the tree is changed according to the changed display selection setting and displayed again. It may be configured.

  As described above, when creating and displaying a tree with each folder as a node of a specific folder (one or a plurality of folders hit in the search) and a folder that is an upper hierarchy of the specific folder, the tree By combining multiple nodes existing between nodes that become branch points into an abstract node, the display does not become complicated even when the hierarchy is deep, and the target folder can be reached quickly. It becomes possible.

  Also, by leaving the upper folder of the target folder (specific folder) without deleting it (for example, by displaying a path next to the abstracted folder), the user can easily know the hierarchical structure. it can.

  When the pointer of the input device (mouse) is placed on the abstracted folder, a pop-up displaying the hierarchical structure is displayed, so that the user can easily know the hierarchical structure.

  In addition, by changing the way the target folder (specific folder) and the upper folder are displayed (by changing the visual form such as the color and shape of the folder), it is possible to identify the folder that has been searched and the other folders. It can be done easily.

  Therefore, in the conventional tree display in the search result display of files and folders, when there are a plurality of search results or when the hierarchy is deep, it is difficult to identify the target folder. Therefore, it is possible to construct a comfortable operating environment that allows easy access to the target folder.

  An abstraction from the root node is also possible.

  Further, the configuration and contents of the various data described above are not limited to this, and it goes without saying that the various data and configurations are configured according to the application and purpose.

  Although one embodiment has been described above, the present invention can take an embodiment as, for example, a system, apparatus, method, program, or recording medium, and specifically includes a plurality of devices. The present invention may be applied to a system including a single device.

  The configuration of a data processing program that can be read by the information processing apparatus according to the present invention will be described below with reference to the memory map shown in FIG.

  FIG. 17 is a diagram for explaining a memory map of a recording medium (storage medium) for storing various data processing programs readable by the information processing apparatus according to the present invention.

  Although not specifically shown, information for managing a program group stored in the recording medium, for example, version information, creator, etc. is also stored, and information depending on the OS on the program reading side, for example, a program is identified and displayed. Icons may also be stored.

  Further, data depending on various programs is also managed in the directory. In addition, when a program or data to be installed is compressed, a program to be decompressed may be stored.

  The functions shown in FIGS. 11, 12, 13, 14, and 15 in this embodiment may be performed by a host computer by a program installed from the outside. In this case, the present invention is applied even when an information group including a program is supplied to the output device from a recording medium such as a CD-ROM, a flash memory, or an FD, or from an external recording medium via a network. Is.

  As described above, a recording medium in which a program code of software for realizing the functions of the above-described embodiments is recorded is supplied to the system or apparatus, and the computer (or CPU or MPU) of the system or apparatus is stored in the recording medium. It goes without saying that the object of the present invention can also be achieved by reading and executing the program code.

  In this case, the program code itself read from the recording medium realizes the novel function of the present invention, and the recording medium storing the program code constitutes the present invention.

  As a recording medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, DVD-ROM, magnetic tape, nonvolatile memory card, ROM, EEPROM, A silicon disk or the like can be used.

  Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) or the like running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Furthermore, after the program code read from the recording medium is written in a memory provided in a function expansion board inserted in the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.

  Further, the present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or apparatus. In this case, by reading a recording medium storing a program represented by software for achieving the present invention into the system or apparatus, the system or apparatus can enjoy the effects of the present invention.

  Furthermore, by downloading and reading out a program represented by software for achieving the present invention from a server, database, etc. on a network using a communication program, the system or apparatus can enjoy the effects of the present invention. It becomes.

  In addition, all the structures which combined each embodiment mentioned above and its modification are also included in this invention.

  As described above, according to the present invention, even when the hierarchy of a target folder such as a folder hit in the search is deep, the hierarchy of the upper folder is maintained while maintaining the accessibility to the target folder. The structure can be easily grasped, and a comfortable operation environment for easily accessing a target folder can be constructed.

It is a block diagram which shows an example of the hardware constitutions of the information processing apparatus which shows one Embodiment of this invention. It is a block diagram which shows an example of the software structure of the information processing apparatus of this invention. It is a database block diagram which shows the structure of search result preservation | save DB3a shown in FIG. It is a database block diagram which shows the structure of node information preservation | save DB3b shown in FIG. It is a database block diagram which shows the structure of abstraction node information storage DB3c shown in FIG. It is a database block diagram which shows the structure of size measurement DB3d shown in FIG. It is a schematic diagram for demonstrating the folder tree displayed by the search and the folder tree display process of a search result of this invention. It is a schematic diagram for demonstrating the folder tree displayed by the search and the folder tree display process of a search result of this invention. It is a schematic diagram which shows an example of the search screen displayed on the display 1d by the search keyword input process part 2a1 shown in FIG. It is a schematic diagram which shows an example of the display selection screen displayed on the display 1d by the search keyword input process part 2a1 shown in FIG. It is a schematic diagram which shows an example of the search screen displayed on the display 1d by the search keyword input process part 2a1 shown in FIG. It is a flowchart which shows an example of the 1st control processing procedure in this invention. It is a flowchart which shows an example of the 2nd control processing procedure in this invention. It is a flowchart which shows an example of the 2nd control processing procedure in this invention. It is a flowchart which shows an example of the 3rd control processing procedure in this invention. It is a flowchart which shows an example of the 4th control processing procedure in this invention. It is the schematic diagram which showed typically a mode that the width | variety of the tree window 5b3 and the width | variety of a tree were compared. It is a figure explaining the memory map of the recording medium (storage medium) which stores the various data processing program which can be read by the information processing apparatus which concerns on this invention.

Explanation of symbols

1 Computer 1a Memory 1b CPU
1c input device 1d display 1e external memory 2a1 search keyword input processing unit 2a2 search processing unit 2a3 branch decision processing unit 2a4 abstraction unit 2a5 size measurement unit 2a6 tree display unit 5b search screen 5c display selection screen 3a search result storage DB
3b Node information storage DB
3c Abstraction node information DB
3d size measurement DB

Claims (8)

In an information processing apparatus that manages a group of nodes as a tree structure,
Tree display means for displaying a plurality of different nodes in the node group in a tree structure in a display area;
Node specifying means for specifying one or more nodes to be displayed by the user;
Branch determination means for determining whether or not there are a plurality of nodes branching one level below the node in the tree structure;
For the plurality of different nodes to be displayed in the display area, the node specifying unit specifies processing for abstracting a group of nodes of a plurality of hierarchies determined to have no branch by the branch determination unit as a single node. Node abstraction means for repeatedly executing a node in a higher hierarchy than each node ,
The tree display means displays the plurality of different nodes in a display area in a tree structure of nodes abstracted by the node abstraction means. The information processing apparatus further includes:
A search condition specifying means for specifying a search condition;
Node search means based on the search condition specified by the search condition specifying means, and a node search means that makes a search result a node that matches the search condition among the nodes of the tree structure,
The information processing apparatus according to claim 1, wherein the node specifying unit sets a node as a search result by the node searching unit as the specified node . When the information processing apparatus further displays the tree structure in the display area, a node group of a specific portion of the tree structure can be displayed in the display area without being abstracted by the abstraction unit. A display enable determination means for determining whether or not
The tree display means includes:
When the display possibility determination means determines that a node group of a specific part of the tree structure can be displayed in the display area, the tree is displayed without performing the abstraction. The information processing apparatus according to any one of claims 1 and 2. Node instruction means for indicating a node on the tree displayed in the display area by the tree display means;
A node group display means for displaying a node group corresponding to one abstracted node when an abstracted node is indicated by the node indicating means;
The information processing apparatus according to claim 1, further comprising:   The information processing apparatus according to claim 1, wherein the node is a file or a folder. In a control method of an information processing apparatus that manages a node group as a tree structure,
A tree display step in which the tree display means of the information processing apparatus displays a plurality of different nodes in the node group in a display area in a tree structure;
A node specifying step in which the node specifying means of the information processing device specifies one or more nodes to be displayed by the user;
A branch determination step of determining whether or not the branch determination means of the information processing apparatus has a plurality of nodes branching one level below the node in the tree structure;
The node abstraction unit of the information processing apparatus abstracts a plurality of hierarchical node groups determined to have no branch in the branch determination step into one node for the plurality of different nodes to be displayed in the display area. A node abstraction step that repeatedly executes a process to be performed on a node in a higher hierarchy than each node specified in the node specification step ,
The method of controlling an information processing apparatus, wherein the tree display step displays the plurality of different nodes in a display area in a tree structure of nodes abstracted by the node abstraction step.   A program for causing a computer to execute the control method of the information processing apparatus according to claim 6.   A computer-readable recording medium on which a program for causing a computer to execute the control method of the information processing apparatus according to claim 6 is recorded.

Images