JP3754111B2 - Method for generating hierarchically related information and computer-controlled display system - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates generally to the field of information display, and more particularly to providing a visual display of database search results.
[0002]
[Prior art and problems to be solved by the invention]
It is well understood that information visualizations provide insight into the underlying data. For example, for any given set of information, new information about patterns or relationships can be obtained by searching information attributes. It is often useful to view the attributes of information in a hierarchical structure. However, it is difficult to display a large hierarchical structure in a limited display area.
[0003]
EP 0 435 601 A2 (Robertson et al.) Entitled “Display of Hierachical Three-Dimensional Structures”, assigned to the assignee of the present invention, is a tree having a rotating substructure. A technique for displaying and manipulating a three-dimensional representation of a structure is disclosed.
[0004]
US Pat. No. 4,752,889 (Rapport et al.) Entitled “Dynamic, Interactive Display System For A Knowledge Base” provides a link between chunks of knowledge. The graphic display shown is described. The user can use a mouse click to obtain a display of links from the displayed chunk of knowledge to other chunks of knowledge, and this other chunk is added to the display. The screen scrolling mechanism can move from one region of the entire graph to another.
[0005]
EP 0 535 986 A2 (Robertson et al.) Entitled “Method of Operating A Processor”, assigned to the assignee of the present invention, is a selected node of the node link structure along the centering line. A method for centering is described. Nodes are in rows, and each row extends across a centering line that has a link between nodes in adjacent rows. When the user requests a centering operation for the indicated node, an image sequence is presented. Each image includes a row that includes a series of designated nodes where the designated nodes and columns appear to be continuous and the indicated nodes appear to be continuous. The row appears to be shifted until the last shift (reposition) locks the continuous indicator node to the centering line position and carries the continuous indicator node towards the centering line. The indicator node position and the subset of consecutive indicator nodes together define an asymptotic path that asymptotically approaches the centerline starting from the indicator node position until a final shift occurs. Repositioning between positions can follow a logarithmic function where each repositioning is a percentage of the distance from the preceding position to the centering line. Each node is rectangular and the nodes in each row can be separated by equal offsets to provide a compact row. Each node is a selectable unit, and the user can request a centering operation by selecting a node using a mouse click or the like.
[0006]
Furnas, G. W. (Furnas, GW) 's "Generalized Fisheye Views" (April 1986, ACM CHI'86 Minutes, pages 16-23) Describes providing an overall context (context, context) balance. Section 1 looks at the remote world roughly and continuously looking at the entire world, as in the caricature of the poster of “New Yorker's View of the United States” Discuss the fisheye lens to see the details of a nearby place. Section 3 describes the degree of interest (DOI) function that assigns a number to each item (point) in the structure that indicates how interested the user is in the item given the current task. . The display can then be made by showing the most interesting items indicated by the DOI function. A fisheye view can obtain a logarithmically compressed display of a tree, as shown in FIG. 4 of Furnas, for example, for a tree-structured text file. Section 4 also describes a botanical taxonomy, code, text outline, decision tree, phone book, corporate directory, and fish-eye view of the UNIX file hierarchy listing. Section 5 differs from the geographical example where the more important display-related concepts are reminiscent of the “New Yorker View” metaphor where the underlying structure does not necessarily have to be a spatial or graphical output. , Lists, trees, acyclic directed graphs, general graphs, and Euclidean spaces. FIG. 6 of Furnas' literature shows a fisheye calendar.
[0007]
EP 0447 095A (Robertson et al.) Entitled “Workspace Display” assigned to the assignee of the present invention is stretched to allow the user to see a portion of the workspace in greater detail. A processor for presenting an image sequence of a workspace is disclosed. The work space includes an intermediate section and two peripheral sections in contact with both ends of the intermediate section. Each of the sections appears to be a rectangular two-dimensional surface, and the sections are perceivable in three dimensions. When the user is looking at the intermediate section as if it were parallel to the display screen surface, each peripheral section appears to extend away from the user by turning at an angle from the edge of the intermediate section. Occupies relatively little screen. When the user requests stretching, the middle section is stretched and the peripheral section is compressed to provide stretching. When the user requests to release the extension, the extension of the intermediate section is released and the compression of the peripheral portion is released accordingly.
[0008]
[Means for Solving the Problems]
According to the present invention, database search results can be organized and visualized independently of search parameters. The tree structure of the present invention is created based on search results and parameters specified by the user. User-specified parameters represent the attributes of documents stored in the database, and the parameters may be different from the search parameters. The tree structure is then mapped to a static reference plane that is visually perceived as three-dimensional. The reference plane includes a detail area where details of the tree structure are displayed and a context area for displaying other parts of the tree that have less detail but convey the feeling of the context to the viewer (viewer). The tree structure can be scrolled around a reference plane to bring a portion of the structure into a direct detail view while maintaining a context view of the entire tree.
[0009]
  The first aspect of the present invention is:A method for generating hierarchically related information of query results to a database for storing documents, the method comprising: a) performing a database search to obtain a set of documents; b) N Receiving an ordered set of user-specified view priorities, wherein each of the user-specified view priorities defines characteristics of information stored in the database; c) the set of documents and Generating an N + 1 level tree structure based on the ordered set of N ordered user-specified view priorities; d) displaying a reference plane on which the tree structure is displayed, the reference plane Lacks details of a first region detailing the first part of the tree structure and a second part of the tree structure. E) determining a layout of the tree structure with respect to the reference plane; and f) mapping the tree structure to the reference plane based on the layout to generate tree display data. And g) displaying the tree structure on the reference plane.When a node of the tree structure having a descendant node at least partially included in the second area is selected, the reference plane is set so that the node and the descendant node are included in the first area. Re-determining the layout of the tree structure with respect to.
[0010]
  The second aspect of the present invention is:A computer-controlled display system for displaying the results of a query to a database, said means for receiving a set of document indicators, wherein said set of document indicators corresponds to a query result of a database, and one or more searches Means for specifying priority; means for constructing a tree structure based on the set of one or more search priorities and document indicators; and means for generating a reference plane on which the tree structure is displayed, Means for said reference plane to have a first area showing in detail a first part of the tree structure and a second area showing in detail a second part of said tree structure; and a layout of said tree structure with respect to said reference plane Layout generation means for generating the tree structure Was mapped to the reference surface based on out, the tree display dataTheMeans for creating and means for displaying the tree structure on the reference plane.When a node of the tree structure having a descendant node at least partially included in the second area is selected, the reference plane is set so that the node and the descendant node are included in the first area. Again, the layout of the tree structure is determined.
[0011]
DETAILED DESCRIPTION OF THE INVENTION
A portion of the disclosure of this application includes copyrighted content. Since it is in the JPO file or record, there are no objections to the copyright owners in copying the original manuscript or patent disclosure, but in all other cases all copyrights are fully reserved To do.
[0012]
Hierarchically related information is often expressed as a tree. As used herein, the term node refers to a point on the tree structure. Each node includes pointers (indicators) to parent nodes, child nodes and sibling nodes to create a tree structure. The root node is the highest level node. The leaf node is the lowest level node.
[0013]
As the tree structure grows, it may be difficult to present the entire tree on the display in sufficient detail. Therefore, it can be difficult to keep track of the path of the node. Furthermore, it is often desirable to know where a particular node in the tree structure is located in order to understand the context of the data. The present invention addresses this node by providing a 3D context view that can be scrolled.
[0014]
It should be noted that the tree has a general class of node link structures. As will become apparent in the description below, the present invention may be implemented to support other node link structures.
[0015]
Various techniques for rendering (rendering) 3D images on 2D display screens are well known in the prior art. On the other hand, manipulating three-dimensional images increases computation. Expensive 3-D (three-dimensional) graphics hardware is often used to draw within an acceptable time frame. The present invention avoids the need to use complex hardware and provides operable 3D visualization. In the present invention, a three-dimensional reference plane on which information moves around is created. This 3D reference plane provides for searching the entire structure of the tree structure or the path to the end node.
[0016]
A computer-based system in which this preferred embodiment of the invention can be implemented will be described with reference to FIG. With reference to FIG. 1, a computer-based system includes a plurality of components coupled by a bus 101. Bus 101 may consist of a hierarchy of buses (eg, processor bus, local bus, and I / O bus) along with multiple parallel buses (eg, address, data and status buses). In any case, the computer system further includes a processor 102 that executes instructions provided by bus 101 from internal memory 103 (internal memory 103 is typically a combination of random access memory and read-only memory). Please note.) The processor 102 is used to support the creation of tree visualizations and perform various operations. Such operations performed by the processor 102 are described with reference to FIGS. The processor 102 and internal circuit 103 may be a single integrated device, such as discrete components or an application specific integrated circuit (ASIC) chip.
[0017]
Also coupled to the bus 101 is a keyboard 104 for inputting alphanumeric input, an external storage device 105 for storing data, a cursor control device 106 for operating a cursor, and a display 107 for displaying visual output. The keyboard 104 is typically a standard QWERTY keyboard, but may be a keypad such as a telephone. The external storage device 105 can be a fixed or removable magnetic or optical disk drive. For example, a cursor control device 106, such as a mouse or trackball, typically has buttons or switches associated with it, and can program the performance of certain functions.
[0018]
This preferred embodiment of the present invention is designed for use with commercially available IBM compatible computer systems available from a variety of vendors, which include Microsoft's Windows 3.1 operating system (Microsoft Windows 3.1). Operating System). The Windows operating system provides the use of multiple workspaces simultaneously. The operation of operating systems such as Windows is well known to those skilled in the art.
[0019]
In operation, this preferred embodiment of the present invention also uses various user interface functions (equipment). A cursor control device is used to position the cursor positioned on the display at the desired location (ie, “point to” the desired location). When the cursor control device positions (points) to something on the display, it presses and releases the button associated with the cursor control device to invoke an action. This is called “clicking”. Different functions can be invoked by pressing and releasing the button twice in succession. This is called “double-click”. When the user points to an object on the display and presses and holds the button down, the object follows the cursor and is placed in a position on the display where the button is released. This is called a “drag and drop” or “drag” operation.
[0020]
2A and 2B show the visualization of the tree structure of this preferred embodiment. FIG. 2A shows a tree structure 201 projected on a plane 202. Referring to FIG. 2B, the same tree structure 201 ′ is mapped on the reference plane 203. The reference surface 203 has a center panel 204 that shares an edge with the top panel 205 and the bottom panel 206. The center panel 204 is rectangular and the top panel 205 and bottom panel 206 are trapezoidal.
[0021]
Although not shown, the reference plane can be rotated up to 180 °. This rotation can be done when it is desirable to represent the tree structure vertically. Further, the various levels of the tree structure of FIGS. 2A and 2B are aligned with columns. As will become apparent from the description below, such alignment reduces processing computations that scroll the tree structure across the reference plane and does not affect the properties underlying the tree structure. On the other hand, as will be apparent to those skilled in the art, the present invention is implemented with a tree structure in which the various levels are not vertically aligned with the columns.
[0022]
The reference plane provides a visual cue so that the visualization is perceived as three-dimensional. 3A and 3B show the reference surface in more detail. FIG. 3A shows the displayed reference plane. The reference plane 300 includes a center panel 301, a top panel 302 and a bottom panel 303. The top panel 302 is perceived as being folded back from the center panel 301 at the folding edge 304. The bottom panel 303 is perceived as being folded back from the center panel 301 at the folding edge 305. The top panel 302 and the bottom panel 303 have a different fill pattern than the center panel 301 to provide a visual cue for three dimensions (ie, folded back). Further, the back of the reference plane may also be shaded to provide a three-dimensional visual effect.
[0023]
FIG. 3B is a side view related to the viewpoint (viewpoint) 306 of the user on the reference plane 300. As can be readily observed from FIG. 3B, the user's viewpoint 306 is orthogonal to the center panel 301, but it is not orthogonal to the information on the top panel 302 and the bottom panel 303. Thus, the information in the top panel 302 or the bottom panel 303 is viewed (seen) in perspective.
[0024]
Furthermore, it should be noted that the size of the display area of the reference plane can be changed. In this preferred embodiment, as the width of the display area changes, the overall panel width changes correspondingly. On the other hand, if there is a change in the height of the display area, only the center panel changes the height. This is done to show the maximum number of nodes in detail while maintaining the context. And, as described in more detail below, eliminates the need for an updated look-up table that was used to provide the three-dimensional effect of the tree structure.
[0025]
FIG. 4 is a flow chart describing the general steps performed to render the visualization of the present invention in a tree structure. First, a perspective transformation lookup table for the top and bottom panels is created (step 401). These look-up tables are for creating display data for parts of the tree structure on the top and bottom panels. The lookup table is static during visualization time. In this preferred embodiment, each lookup table stores 3000 sample points to convert the orthogonal view into a perspective view. Values between sample points are obtained by interpolation. Methods for creating such look-up tables for generating perspective views are well known in the prior art. Therefore, no further description of the generation of sample points in the look-up table seems necessary. Next, a tree structure (ie, node / link pointer data) is created or obtained (step 402). The creation of a tree structure depends on what the structure represents. In this preferred embodiment, the hierarchical view resulting from the database search is included in the tree structure. A description of the creation of the tree structure of this preferred embodiment is provided below. Once the tree structure is created or obtained, it is mapped to a reference plane by the following steps. First, the tree structure is laid out on a two-dimensional surface (step 403). The first layout of the tree structure centers the tree on the reference plane. The position of the layout is moved by the next layout, for example, a scrolling effect. In the layout step, each node gets a planar (planar) address. Next, the tree is rendered on the reference plane (step 404). This is done by converting the surface coordinates for the nodes to screen coordinates using the lookup table generated for the nodes in the top and bottom panels in step 401 and the direct scaling for the nodes in the center panel. Is done.
[0026]
When the visualization is presented to the user, the reference plane is displayed and the tree structure is overlaid. The user call of the tree structure and its scrolling process will be described in more detail below.
[0027]
Visualization does not add much computation. The reason is that the user's viewpoint is constant, i.e. orthogonal to the center panel and the top and bottom panels are symmetrical. However, the visualization depiction retains the advantage of a 3D representation of viewing both context and detail simultaneously.
[0028]
The present invention will be described with reference to this preferred embodiment for viewing the results of a database search. However, as will be apparent to those skilled in the art, the visualization of the present invention can be used to view any information that can be represented in a tree structure.
[0029]
In this preferred embodiment of the invention, the database maintains a collection of documents. Each document has a number of indexes (indexes), and the documents can be referred to by the indexes. The present invention can organize and view the results of the database search by a method based on these indexes. The index used for organization and view may be different from the index used for database searching. The index that the user specifies and wants to view the search results is called the preference.
[0030]
Priorities specified by the user are ordered. Use the first priority to create the top level of the tree structure, create the second level with the second priority, and the bottom level of the structure that is a representation of the individual items of the search result (ie, document) Create up to. The tree structure created from the search results is typically shallow (number of priorities specified + 1) and broad (wide) (number of documents in the search results). The label of each node indicates a value corresponding to the priority. FIG. 5 shows an example of a search result view. In this view, the first priority is Author (writer), the second priority is Type (type), and the third priority is Date (date). Referring to FIG. 5, the top level 500 identifies three authors, Allen (node 501), Bowers (node 502), and Card (node 503). According to Allen's branch, in the second level Type of the hierarchy, the document types are grouped 504: Spreadsheet (spreadsheet) (node 504a), Report (report) (node 504b), and Memo. (Memo) (node 504c) is designated. From the third level of the hierarchy, Spreadsheet is dated 6/15/93 (June 15, 1993) (Node 505a) and Report is 12/1/93 (December 1, 1993) (Node 505b). ) And Memo is observed to be dated 6/30/94 (June 30, 94) (node 505c). Finally, it can be seen from the bottom level of the hierarchy that Document (nodes 506-508) is associated with the Allen branch.
[0031]
Following the Bowers branch, it is observed from the second level that the document authored by Bowers is of type Graphics (node) 509a or Code (node) 509b. Graphics type documents are dated 1/1/93 (January 1, 1993) (Node 510a) and Code is dated 5/15/94 (May 15, 1994) (Node 510b). It was attached. Finally, the Document associated with the Bowers chain is shown at nodes 511-514.
[0032]
Following the Card branch, it is observed from the second level that the document authored by Card is of type Audio (node) 515a or Image (node) 515b. According to the third level, Audio type documents will be dated 3/24/94 (March 24, 94) (node 516a) and Image type documents will be dated 2/16/94 (February 16, 94). ) (Node 516b). Finally, the Document associated with the Card branch is defined at nodes 517-519.
[0033]
In this preferred embodiment, each database that can be searched has a default priority that can be used to view the tree structure.
[0034]
It is worth noting that the preferred embodiment operates within the parameters of the window system. For example, since the window is sized to be smaller than the actual size of the window display area, the display view merely shows a portion of the tree structure.
[0035]
Furthermore, a preferred embodiment of the present invention will be described with reference to the flowchart of FIG. Referring to FIG. 6, the user first selects a database and executes a database search (step 601). Once the search is complete, the user then specifies how he wants to view the search results. In this preferred embodiment, the user can view the results as a list of documents or in a tree structure. The user selects a tree view (step 602). In this preferred embodiment, the various view options are represented as icons that the user selects with a point click action. Other means of view selection can be used, for example, via a pull-down menu. Once the user selects the tree view, he must specify the priority with which the tree structure can be built (step 603). In this preferred embodiment, up to five priorities can be selected. The main limitation of priority is the typical display size. As will be apparent to those skilled in the art, a lower or higher number of priorities can be tolerated.
[0036]
A view tree structure is then created and displayed based on the search results and priorities (step 604). The method for constructing the tree structure is described in further detail below. At this point, the user can highlight (highlight) the document path and view the document or retrieve the document from the database. In this preferred embodiment of the present invention, each node can be selected by a point operation using a cursor control device. For any operation, the user first points to the desired node (step 605). The highlighting of the document path in the tree structure is invoked by clicking once on the cursor control device. Emphasis is performed by displaying a path with an inverted image (see FIG. 12). Before highlighting, it must be checked whether the document node corresponding to the pointed node is in the center panel (step 606). If the document node is in the center panel, the document path is highlighted (step 608). If the document node is not in the center panel, the tree view is rotated (ie, scrolled) to bring the document node to the center of the center panel (step 607). This scrolling is automatic. When finished, the document node is centered in the center panel and the path is highlighted at step 608.
[0037]
Viewing the document is invoked by double clicking on the cursor control device in step 609. The view mechanism of this preferred embodiment retrieves the corresponding document and presents it in a window in the display. Retrieving a document for editing is performed at step 610 by a drag and drop operation (into a predetermined work area). Note that in this preferred embodiment, the node pointed to is not necessarily a document node. It can be any node in the tree hierarchy that ultimately points to the desired document.
[0038]
The creation and description of the tree structure of this preferred embodiment will be described with reference to FIG. Referring to FIG. 7, the underlying tree representation is created from the search results and the provided priority (step 701). In this preferred embodiment, the tree is a virtual node that is an inner node corresponding to the priority value, and a leaf (displayed in the rightmost column) corresponding to the document obtained from the result of the search. It consists of real nodes that are nodes. In this preferred embodiment, the creation of the tree is obtained by a recursive call to a software program called an AddNode. A flowchart outlining the functionality of the add node is provided in FIG. An add node takes a parent node and a document as input. When creating a tree, an add node is called for each document and designates a root node as a parent node. Referring to FIG. 8, the priority value, X, is obtained for the current depth of the hierarchy (step 801). This involves checking the database and determining the value of the index corresponding to the priority. A search is then performed to determine whether any child node has the value X (step 802). If no child node has the value X, a new virtual child node having the value X is created (step 803). Next, the depth of the hierarchy is incremented (step 804). Next, a check is made to determine if the hierarchy has reached maximum depth (step 805). If so, then create a real node whose next parent is a child with value X (ie, the current child) (step 806). If there is a child with the value X, then the add node is recursively called with that child as the new parent (step 807).
[0039]
Referring again to FIG. 7, the tree structure is laid out on a plane (step 702). It should be first noted that in this preferred embodiment, each level in the hierarchy is in a (invisible) column of the display window. The steps for laying out the tree structure on the plane are shown in the flowchart of FIG. Referring to FIG. 9, the number of nodes at each level of the hierarchy is counted across the tree (step 901). Since each level forms a column, a node count for each column is created. In this preferred embodiment, each node when displayed is 80 × 20 pixels in size. Therefore, the column size can be easily determined. The size of this column corresponds to the number of nodes in the column. Next, a rectangle serving as a boundary is determined for each column (step 902). The bounding rectangle is based on the number of columns, the number of nodes in each column, and the size of the display window. The bounding rectangle encloses all nodes at the level of the hierarchy. Next, across the tree, nodes are arranged on a plane by plane coordinates (step 903). For placement, the x coordinate is determined by the node depth of the hierarchy and the number of levels in the hierarchy. The y coordinate is determined by the position of the node in a row that traverses the tree structure.
[0040]
Referring again to FIG. 7, the tree layout is then depicted on the reference plane (step 703). This is obtained by converting planar coordinates to display screen coordinates. The conversion performed depends on the panel. As described above, the reference plane relates to a plane that simply folds at a predetermined vertical folding position (location) (ie, particularly in the Y coordinate of the plane). Thus, the determination of the transformation to use requires an inspection of the node's Y coordinate. For the center panel, the plane coordinates are normalized (scaled) to the coordinates of the reference surface. For the top and bottom panels, a perspective transformation is applied to the planar coordinates using a look-up table. Two lookups are used for each of the top and bottom panels. The first look-up table maps the plane y distance from the panel fold to the screen y distance. The second lookup table maps the plane x distance from the center to the screen x distance from the center.
[0041]
As described above with respect to FIG. 6, tree scrolling can occur when a leaf node is in the top or bottom panel and a path to that leaf node is selected. FIG. 10 is a flowchart describing the scrolling steps. This preferred embodiment scrolling is intended to provide animation. It has been confirmed that animations help users perceive what is happening. To provide animation, scrolling occurs at an animation step having a total animation time of 0.6 seconds (determined to be optimal). Referring to FIG. 10, first, the distance required for movement of each column of the tree is determined (step 1001). In this preferred embodiment, the selected node, its ancestors, and its children are centered on the reference plane. Next, the distance that the farthest column must be moved in each animation step to reach its destination is determined (step 1002). This distance is based on the time required to draw the recent tree. This distance provides an offset for each column at each animation step. Next, an animation step is executed (step 1003). Now draw the tree on the reference plane by incrementing the offset of each column towards that destination at each step until all columns reach their final destination.
[0042]
FIG. 11 shows the data structure of the nodes in the tree structure of this preferred embodiment of the present invention. The structure includes a plurality of pointers 1101 to 1104 and a layout address 1105 for a node. A pointer 1101 indicates a parent node, a pointer 1102 indicates a child node, a pointer 1103 indicates a sibling node, and a pointer 1104 indicates document information. Pointers 1101 to 1103 are typical for tree structure representation. Pointer 1104 is used to point to the document itself. The layout address 1105 includes an address for the node with respect to the plane generated in the layout plane step described in FIG.
[0043]
“Copyright 1994, Xerox Corporation” (17 USC) in FIGS. 12-14 is a screen display showing information visualization of database search. Referring to FIG. 12, a search result tree is shown. Here, it can be seen that various nodes are depicted on the top and bottom panels. FIG. 13 shows the descendant nodes with node emphasis. Referring to FIG. 13, node 1301 is selected and highlighted. As a result, the descendant nodes 1302 to 1305 are also emphasized. Finally, FIG. 14 shows a selection that results in scrolling. As shown in FIG. 12, assuming the starting position, the node 1401 is selected. Next, the descendant nodes 1402 to 1411 are scrolled to the center panel and highlighted. Note that the center panel node has been scrolled off and scrolled to the bottom panel.
[0044]
【The invention's effect】
According to the present invention, database search results can be organized and visualized independently of search parameters.
[Brief description of the drawings]
FIG. 1 shows a block diagram of a computer control system of this preferred embodiment of the present invention.
FIG. 2A is a tree structure laid out on a plane, and FIG. 2B shows the tree structure of (A) mapped to the reference plane of this preferred embodiment of the present invention.
FIG. 3A shows a three-dimensional perceived reference plane used in this preferred embodiment of the present invention, and FIG. 3B shows the aspect of the reference plane of FIG. The figure is shown.
FIG. 4 shows a flowchart of the general steps performed when creating a visualization in the tree structure of this preferred embodiment of the present invention.
FIG. 5 shows an example of a tree structure showing database search results organized based on priorities designated by a user.
FIG. 6 shows a flowchart of user interaction that can be performed in this preferred embodiment of the present invention.
FIG. 7 shows a flowchart of the steps performed for the visualization generation of the tree structure of this preferred embodiment of the present invention.
FIG. 8 shows a flowchart of the steps for creating a tree structure in this preferred embodiment of the present invention.
FIG. 9 shows a flow chart of steps for laying out a tree structure on a plane in this preferred embodiment of the present invention.
FIG. 10 shows a flowchart of steps for scrolling a tree structure around a reference plane that may be performed in this preferred embodiment of the invention.
FIG. 11 shows the data structure for a node of this preferred embodiment of the present invention.
FIG. 12 shows a screen display of a tree view of the results of a database search of this preferred embodiment of the present invention.
FIG. 13 shows a screen display showing the highlighted path of this preferred embodiment of the present invention.
FIG. 14 shows a screen display showing the highlight path after scrolling to the view of this preferred embodiment of the present invention.
[Explanation of symbols]
201 Tree structure
202 plane
203 Reference plane
204 Center panel
205 Top panel
206 Bottom panel

Claims (4)

A method for generating hierarchically related information of query results to a database for storing documents, the method comprising:
a) performing a database search to obtain a set of documents;
b) receiving a set of N ordered user-specified view priorities, wherein each of the user-specified view priorities defines characteristics of information stored in the database;
c) generating an N + 1 level tree structure based on the set of documents and the set of N ordered user-specified view priorities;
d) displaying a reference plane on which the tree structure is displayed, wherein the reference plane shows in detail the first part of the tree structure in detail and the second part of the tree structure in detail. possess a second region, the first region and the second region is a plane, are arranged so as to be able to view the entire the first region and the second region from at least one position , Steps and
e) determining a layout of the tree structure with respect to the reference plane;
f) mapping the tree structure to the reference plane based on the layout to create tree display data;
g) displaying the tree structure on the reference plane;
Including
When a node of the tree structure having a descendant node at least part of which is included in the second area is selected, the node and the descendant node are included in the first area so that the node and the descendant node are included in the first area. Re-determining the layout of the tree structure,
A method for generating hierarchically related information.   2. The hierarchically related information generation method according to claim 1, wherein when a node having the tree structure is selected, the node and descendant nodes of the node are highlighted. A computer-controlled display system for displaying the results of a database query,
Means for receiving a set of document indicators, wherein the set of document indicators corresponds to a query result of a database;
Means for specifying one or more search priorities;
Means for constructing a tree structure based on the set of one or more search priorities and document indicators;
Means for generating a reference plane on which the tree structure is displayed, wherein the reference plane shows a first region detailing a first part of the tree structure and a second part of the tree structure in detail. possess a second region, the first region and the second region is a plane, are arranged so as to be able to view the entire the first region and the second region from at least one position, Means,
Layout generating means for generating a layout of the tree structure with respect to the reference plane;
Means for mapping the tree structure to the reference plane based on the layout and creating tree display data;
Means for displaying the tree structure on the reference plane;
Including
When a node of the tree structure having a descendant node at least part of which is included in the second area is selected, the node and the descendant node are included in the first area so that the node and the descendant node are included in the first area. Re-determining the layout of the tree structure,
Computer controlled display system.   The computer-controlled display system according to claim 3, wherein when a node having the tree structure is selected, the node and a descendant node of the node are highlighted.

Images