JP2754538B2 - Hierarchical database search system - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a hierarchical database search system,
In particular, the present invention relates to a hierarchical database search system capable of graphically displaying the location of a search object including position information on a display two-dimensionally displayed in a multi-window. (Related Art) In a search system such as a relational database, a visual database, or an outline processor, a search condition corresponding to a search condition, that is, a search result can be displayed on a display as a document. Assume that there is a card-type hierarchical database as shown in FIG. 5 (for example, Note Cards
system). That is, card a, which is one node, has a relationship with cards b, c, and d, card b has a relationship with cards 1, 2, and 3, card c has a relationship with card 4, and card d has a relationship with card 4. Is related to cards 5 and 6. It is assumed that the card 1 further has a relationship with cards α, β, and γ. FIG. 5 schematically shows a hierarchical database, and in an actual apparatus, this relationship is indicated by an icon as shown in FIG. For example, looking at the card b in FIG. 6, since the card b is related to the cards 1, 2 and 3, the icon 1 is displayed in the card b as shown in FIG. 2, 3 are displayed. When the mouse is clicked after designating the icon 1 in the card b, the card corresponding to the icon 1 is expanded, and as shown in FIG. The icon α of the lower card concerned,
β and γ are displayed. Therefore, if any search is performed on the hierarchical database and the card α satisfies the search condition, the card α as the search result is displayed on the display in the conventional apparatus. (Problems to be Solved by the Invention) As described above, in the conventional search system, only the document corresponding to the search result, that is, the card, is displayed on the display. There was a problem that I do not know where it exists. For example, the card a in FIG. 5 has information on the entire map of Tokyo, the cards b, c, d have information on the map of each ward in Tokyo, and the cards 1, 2, and 3 have information on, for example, Shinjuku-ku. Has the map information of each town in, and it is assumed that the cards α, β, and γ have more detailed map information of the respective towns, the card α is displayed on the display by the search. However, there is a problem that it is difficult to understand which map information this is. An object of the present invention is to eliminate the problems of the prior art,
It is an object of the present invention to provide a hierarchical database search system in which a search object is displayed in a hierarchical database in a graphical manner and can be searched. (Means and Actions for Solving the Problems) The present invention seeks a node that satisfies a search condition relating to substantial data provided to a node, and sequentially ranks upper nodes linked to the found node. It is characterized in that a search can be performed to display a relationship between a node satisfying the search condition and the higher-order node. According to the present invention, it is possible to graphically display where in the hierarchical database the search result node is located, so that the operator can easily and visually understand the meaning of the search result. (Example) Hereinafter, the present invention will be described in detail with reference to the drawings. FIG. 1 shows a functional block diagram of one embodiment of the hierarchical database search system of the present invention. In the figure, 1 is a means for inputting a search condition, 2 is a means for searching a card that meets the search condition from the hierarchical database, and 3 is a top-level node by sequentially tracing the upper node (parent card) of the card. The means 4 for obtaining the card up to and 4 are means for displaying a signal of the link icon of the card obtained by the search means 2 and the parent card search means 3. The “card” described above is a specific example of a “node”, and the same applies to the following. Next, the operation of this embodiment will be described with reference to the flowchart of FIG. First, a search condition is set from the search condition input means 1 (step S1). Then, the search means 2 performs a search to determine whether there is a search target that satisfies the search condition, that is, a card in the hierarchical database (step S2). When there is no search target satisfying the search condition, the search is terminated. On the other hand, when it exists, the link icon of the card to be searched is signal-displayed on the display means 4 (step S3). Next, the parent card searching means 3 searches for the parent card of the card (step S4). When it is determined by this search that the parent card does not exist, the search is terminated. On the other hand, when it is determined that the parent card exists, the link icon of the parent card is signal-displayed on the display means 4 (step S5). Next, the parent card searching means 3
Determines whether or not the parent card is the highest card (step S6). If no, the process returns to step S4 to search for a further upper parent card. As a result of this operation, when the top card is obtained, the search ends. As the signal display, it is effective to perform any of a highlight, a blink, and a display with a shadow.
Here, if the signal display in step S3 is different from the signal display in step S5, the search target itself and the upper link icon linked to it can be identified. Further, when there are a plurality of search targets, each link icon displayed as a signal may be different for each search target (for example, a color may be changed on a display). As described above, according to this embodiment, cards that match the search conditions are displayed hierarchically in a multi-window, and the link icon of each card is signal-displayed. Therefore, where the search target exists in the hierarchical database can be graphically displayed, and the operator can easily understand visually. For example, as shown in FIG. 3, the hierarchical database is a map of Japan where the top card has link icons in each region such as Hokkaido, Tohoku, Kanto, and Chubu (FIG. 3A). Yes, the next card is a map of each region having a link icon to a city (FIG. (B)), and the next card is population data of each city (FIG. (C)). In this case, as a search condition, for example, if a city of 10 million or more is selected, a card that satisfies the search condition is selected from cards of population data of each city, a parent card is searched from the card, and finally the top card is searched. Desired. Each card that satisfies the search condition is displayed in a multi-window on the display device, and the link icon in the card is signal-displayed. In the above example, as shown in FIG.
A card in the Kanto region, which is the parent card of the card having more than one million data, and a card representing the map of Japan as the top card are displayed in a multi-window on the display device, and the card of the Tokyo in the Kanto region card is displayed. A link icon is displayed as a signal, and a link icon corresponding to the Kanto region in the card representing the map of Japan of the top card is displayed as a signal. Therefore, it can be understood that the city having a population of 10 million or more is Tokyo, and Tokyo is located in the Kanto region of Japan. Next, as a second embodiment, consider a case where the top card (for example, the map of Japan in FIG. 3 (a)) is displayed on the display. Here, if the same search conditions as those in the previous embodiment are input, a link icon of the Kanto region where the search target Tokyo that satisfies the conditions exists (is linked) is displayed as a signal, and the link icon is clicked with a mouse. If you do (open), a card in the Kanto region will be displayed, where a link icon for Tokyo will be signaled. When the link icon of Tokyo is further opened, the population data of Tokyo is displayed as shown in FIG. 3 (c). Thus the second
In this embodiment, a card that matches the search condition can be obtained by sequentially opening the link icons displayed as signals on the upper card. Note that the above specific example is merely an example, and useful data can be provided by giving various data to a card and displaying the searched cards hierarchically. For example, if the price of a house for sale is given to a card, it can be used for real estate sales. (Effects of the Invention) As is clear from the above description, according to the present invention, the following excellent effects can be obtained. (1) A node satisfying the search condition is automatically searched,
Since the search target is displayed hierarchically, it is possible to graphically display where the search target exists in the hierarchical database. Therefore, there is an effect that the operator can easily understand visually. (2) The user uses the search condition instead of the node name,
Since the substantial data of the node can be used, compared to a system using the node name as a search condition,
There is an effect that the search can be performed easily and more flexibly.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of one embodiment of the present invention, FIG. 2 is a flowchart of the embodiment, FIG. 3 is a diagram showing an example of a hierarchical database, and FIG. FIG. 5 is a diagram showing a display example of search results by example, FIG. 5 is a schematic diagram of a hierarchical database, and FIG. 6 is an explanatory diagram showing links between cards. 1 ... search condition input means, 2 ... search means, 3 ... parent card search means, 4 ... link icon signal display means,

   ────────────────────────────────────────────────── ─── Continuation of front page    (72) Inventor Atsushi Kurabe               3-16-6 Shinjuku-ku, Tokyo Nishi-Shinjuku Water               Nono Building Fuji Xerox Co., Ltd.                (56) References JP-A-62-22141 (JP, A)                 JP-A-62-293360 (JP, A)                 JP-A-61-190639 (JP, A)

Claims (1)

(57) [Claims] In a hierarchical database search system for searching a database having a plurality of nodes linked by a link, search condition input means for inputting a search condition relating to substantial data provided to the node for searching for a desired node; Presence / absence search means for searching for a node having data satisfying the search condition input by the search condition input means; and an upper node linked to the node searched by the presence / absence search means. Upper node search means for sequentially searching; and display means for displaying a relationship between the nodes searched by the presence / absence search means and upper nodes searched by the upper node search means. Hierarchical database search system.