JP2004280849A - Data display method and its system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an environment allowing a user to easily understand a retrieval result by previously classifying the retrieval result by using an object related to a keyword and by three-dimensionally displaying a display form. <P>SOLUTION: Data retrieved by an inputted retrieval keyword are classified by a computer system in response to a registration keyword 302 previously registered out of keywords controlled by a keyword control list 102 for storing keywords provided for data of a retrieval object; the retrieval result of the classified data is mapped on an object in a three-dimensional space allotted to every registration keyword; and an image representing the classified data is displayed on a display screen by a computer system in a display form 1001 corresponding to each object. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a data display method and system, and more particularly, to a data display method and system for registering multimedia data such as documents, still images, moving images, sounds, and graphics in a database, and searching and displaying the data.

  As a conventional technique, there is a database software operating on a personal computer called a catalog software. Catalog software is a database that handles images and graphics as the center of data. The catalog software basically has a reduced image (hereinafter, referred to as a thumbnail image) of the data for each data, and the operator basically looks at the thumbnail image and searches for desired data (referred to as browsing). Operation. These data are provided with keywords (generally referred to as free keywords) having no fields in relational or card type databases. The catalog software can perform a search using the free keyword, and picks up desired data by combining the search result with the previous browsing.

  However, in the conventional catalog software, the display form of the search result cannot immediately know what keyword the displayed data is classified with. The only way to know this is to select data one by one and display detailed information. For example, if you search the database with the search key "Travel to Hawaii", images with the word "Travel in Hawaii" are picked up. There should be various things such as photos. When these photos are displayed, the conventional database displays them without regard to what the photo is (what other keywords are attached). That is, it is unclear what other keywords the retrieved data has.

  That is, in the conventional database software (particularly, catalog software), the result searched by a certain search key is displayed simply in the order of registration or alphabetical order. If the user wishes to view the search results in a desired unit, the user further searches the search results.

  The present invention eliminates the above-described conventional disadvantages, classifies search results using objects associated with keywords in advance, and displays the display form in a three-dimensional manner, so that the search results can be easily understood by a user. I will provide a.

  In order to solve the above-described problem, the data display method of the present invention corresponds to a registered keyword registered in advance among keywords managed by a keyword management list that stores keywords assigned to search target data, A classification step of classifying the data searched by the input search keyword by a computer system, and mapping a search result of the data classified in the classification step to an object in a three-dimensional space assigned to each of the registered keywords; A display step of displaying an image representing the data classified in the classification step on a display screen by a computer system in a display form corresponding to each object.

  A classification step of classifying the data searched by the input search keyword by a computer system based on a data type list for managing the type of data; and a search result of the data classified in the classification step, A display step of mapping to an object in a three-dimensional space allocated for each object and displaying an image representing the data classified in the classification step on a display screen by a computer system in a display form corresponding to each object. It is characterized by.

  Further, the data display system of the present invention performs a search with an input search keyword corresponding to a registered keyword registered in advance among keywords managed by a keyword management list that stores a keyword assigned to search target data. Classifying the classified data, mapping a search result of the classified data to an object in a three-dimensional space assigned to each of the registered keywords, and displaying an image representing the classified data on each object. A memory for loading a program to be displayed on a display screen, and a processing unit for reading and executing the program from the memory.

  Further, based on a data type list for managing the type of data, the data searched by the input search keyword is classified, and the search result of the classified data is displayed in a three-dimensional space assigned to each of the registered keywords. A memory for loading a program that maps an image representing the classified data on a display screen in a display form corresponding to each object, and a program for reading and executing the program from the memory. And a processing unit.

  As described above, according to the present invention, the search results are displayed uniformly in a certain window according to a predetermined order (data registration order, alphabetical order, etc.). By classifying using an object associated with a keyword in advance and displaying the object in three dimensions, it is possible to provide a user with an environment in which a search result is easy to understand.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

  In this embodiment, the configuration and operation of the present invention will be described as database software having the function of catalog software. With the software of this embodiment, multimedia data such as still images, graphics moving images, sounds, and documents can be registered and searched and displayed. The keyword used for the search is not a configuration such as a field column and a field value used in a relational database or a card type database. That is, the keyword is attached without being classified as a field called a free keyword. The registered data does not copy the data itself into the application file and imports the data, but manages the file name (path name) of the data file and refers to the data file as it is.

<Example of system configuration>
FIG. 1 is a diagram showing an example of a system configuration for realizing the data display method of the present embodiment. The hardware configuration of this system includes components similar to those of a general personal computer system. The execution program of the database is stored in the hard disk 3, and is loaded into the RAM 2 and executed by the CPU 1 when an operator instructs to start. The multimedia data serving as the data of the database exists in the hard disk 3, the large-capacity external storage device 9 such as a magneto-optical disk or a CD-ROM via the SCSI board 8, the floppy (registered trademark) disk 4, and the like. Further, it may be external via a network connected by an Ethernet board. The operator performs an operation on the database program using the pointing device 5 composed of a keyboard, a mouse, or the like, and registers, searches, and displays multimedia data in the database. In the display, multimedia data such as a document, a still image, and a moving image is displayed on the display 7 via the video board 6, and the sound is reproduced as sound from the speaker 11 via the sound board 10.

[Example 1]
<Example of database management structure>
FIG. 2 shows a management structure of data registered in the database according to the present embodiment. The data is roughly divided into three parts, and includes a data management list 101, a keyword management list 102, and thumbnail data 103. Hereinafter, the structure of each component will be described in detail (data management list 101).
The registered data is registered in the data management list 101. More specifically, it is composed of a path name to the actual file of the data, the type of the data file, a pointer to the thumbnail data, and a list of keyword IDs attached to the data.

  Next, the meaning and usage of these registration items will be described.

(1) Path Name to Data File The path name to the data file is registered to refer to and display the data.

(2) Types of data files There are various types of data files such as data of still images, moving images, sound, graphics, documents, etc. Among still images, various formats such as Bitmap, Tiff, Pict, etc. It is provided to make this clear. According to the file type stored in this field, the actual file is opened in a reading procedure of a predetermined format.

(3) Thumbnail data pointer The thumbnail data pointer points to the content of the data file of the thumbnail data 103. Thumbnail data 103 is small bitmap data. In the case of a still image or graphics data, it is an image obtained by reducing the still image or graphics. In the case of a moving image, it is an image created by reducing the first frame screen of the moving image, and in the case of a sound or a document, it is generally an icon indicating a sound or a document. The thumbnail data 103 is automatically created and registered from the data when registering the data. When the actual search is performed and the search results are displayed, if the entity file is opened and displayed one by one, the entire search efficiency decreases over time. Therefore, when the thumbnail data 103 is used, the size is managed in a small and centralized manner, so that the display can be performed quickly. When displaying the search results in a list, the visibility of the small thumbnail data 103 is better. Is also expensive.

(4) Keyword ID list The keyword ID list is a list of numbers indicating the keyword names added to the data. When a keyword name is added to data, a character string of the keyword name itself is not added, but a number = ID uniquely corresponding to the keyword name is added. This makes it possible to distinguish between keywords having different meanings in the same character string. Therefore, the search is performed using this keyword ID when searching. This keyword ID list has a variable length because it requires the number added to the data. Therefore, a NULL character is put at the end of the list to indicate the end.

(Keyword management list 102)
As described above, the keyword management list 102 is a list for managing a character string of a keyword for a keyword ID. In the case of a search, for a character string input as a search key on the screen, a match is found from this list, and a corresponding keyword ID is obtained. Then, by searching for data having the acquired keyword ID, the corresponding data can be picked up.

(Example of structure in FIG. 2)
In the example of FIG. 2, a data file of data1.bmp is registered at the beginning of the data management list 101. Here, the type of the data file data1.bmp is indicated from the data file type item “bmp” to be a bitmap file. From the item of the pointer to the next thumbnail data, the thumbnail data corresponding to this data can be obtained. In the keyword ID list from the next section, three ID numbers 123, 10, and 11 are arranged. This order is the order of registration. Referring to the keyword management list 102 based on these ID numbers, it can be seen that the keywords are “Travel in Hawaii”, “March 31, 1994”, and “landscape”.

  The next data file data2.avi indicates that it is a moving image format of “avi” from the file type item. Also, since the keyword ID has the same 123 as the data file data1.bmp, it indicates that the keyword has the same keyword name “Travel to Hawaii” as the data file data1.bmp.

<Display example of search result>
Next, a display example of a search result in the present embodiment will be described with reference to FIG.

  FIG. 3 shows, for the data group searched using the search key “Travel in Hawaii”, these data groups are further divided into keywords “landscape” 20, “event” 21, “map” 22, and “other” 23. This indicates that the display is performed separately for each of the items having. This display is different from the display example of the conventional database software. In other words, the data is not displayed in the order in which the data is found in the search, or is sorted in a certain field order.

  FIG. 4 shows an internal data management method for realizing this display method.

  In the present embodiment, it is possible to have a number of settings for what keyword is registered and in what display form, and these are managed as a background screen list 301. “Type 1” in the list corresponds to the example of FIG.

  When the user selects type 1 as the background screen, the item of type 1 in the list will be referred to thereafter. This type 1 item refers to the background screen keyword ID list 302 with a pointer. Here, among the keyword IDs managed in the keyword management list 102 described above, the keyword IDs registered on the background screen are shown. Here, IDs of 11, 12, and 13 are shown, which indicate that they are "landscape", "event", and "map", respectively.

  A corresponding background object corresponds to each of these keywords, and is managed in the object list 303. In the object list 303, first, an upper left coordinate position (x, y) in the window of the object is shown. To refer to what kind of object, the object file 304 storing the shape information is referred to. Here, the object file is a set of functions for drawing lines and rectangles, and drawing is performed according to these functions. FIG. 4 shows the shape of a figure drawn by an object file for simplicity.

  As described above, the registered keyword “landscape” is drawn from the coordinates (x, y) = (0, 0) on the screen, and the object is a vertically long rectangle in which the character “landscape” is indicated. It indicates that there is. With the registration keyword “event”, drawing is performed from the coordinates (x, y) = (240, 0) on the screen, and the object indicates that the character “event” is indicated in a horizontally long rectangle. ing. With the registered keyword "map", drawing is performed from the coordinates (x, y) = (0, 300) on the screen, and the metaphor indicates that the character "map" is indicated in a rectangle. . Data that does not match these keywords refers to the next keyword ID = -1. That is, drawing is performed starting from the coordinates (x, y) = (240, 300) on the screen, and indicates that the object is a vertically long rectangle with the character [Other] indicated.

  For a data group picked up by a certain search keyword, a thumbnail image is drawn in the object according to the other keywords of the data. In this drawing, the thumbnail images are drawn in a reduced size as necessary so that the thumbnail images do not overlap.

  There is also a method of displaying thumbnails with a fixed size as in the conventional example. In this case, however, a portion that cannot be displayed is scrolled up / down by attaching a scroll bar to the window. In the present embodiment, this method is not used because the main purpose is to display the entire search result of a certain search keyword so as to be easily grasped. As described above, when there are many corresponding images, the image is displayed as small as necessary. However, the enlarged image is not displayed because there is only one image. The reason that the thumbnail image is not enlarged any further up to 1 times is that the thumbnail image is large enough to clearly show what the original data indicates (usually about 64 × 64 to 128 × 128). ) Is sufficient, and when enlarged, the pixels become coarse and difficult to see.

<Example of system operation procedure>
(Keyword ID acquisition procedure)
FIG. 5 is a flowchart showing a processing procedure for obtaining a keyword ID from a character string of a search keyword. The keyword group registered in the database is registered and managed in the keyword management list 102 as shown in FIG.

  For example, if the user inputs “Hawaii travel” as a search key character string, it is checked with reference to the keyword management list 102 whether or not there is a keyword name that matches the character string “Travel in Hawaii”. If not, the process ends. If they match, the ID is stored in the variable keyID, and the process proceeds to the next step.

  The processing procedure of FIG. 5 will be described in detail as follows.

  In step S401, when the user inputs the search keyword "Travel in Hawaii", this is substituted for the variable key. In step S402, a variable n for searching the keyword names of the keyword management list 102 in order from the beginning is initialized. In step S403, a search is performed to determine whether or not the search keyword key input by the user matches the keyword name of KeyList (n) in the keyword management list 102.

  If they do not match, the flow advances to step S404 to add 1 to n. In the next step S405, it is checked whether or not n has exceeded the last Keymax number of the keyword management list 102. If so, "-1" is substituted for keyID in step S407, and the process ends in step S408. If n does not exceed the Keymax number in step S405, the process returns to step S403.

  In step S403, if the search keyword key input by the user matches the KeyList (n) of the keyword management list, the process proceeds to step S406. In step S406, the number n having the matching keyword name is substituted for keyID, and the process proceeds to step S409.

(Acquisition of applicable data from keyword ID)
FIG. 7 is a flowchart showing a processing procedure for obtaining data corresponding to the keyword ID (keyID) obtained by the processing shown in FIG.

  The outline of the processing procedure in FIG. 7 is a procedure for searching a data group in the database with the obtained keyID and obtaining the corresponding data. Here, the data group registered in the database is managed by a data management list 101 as shown in FIG. Each item in the data management list 101 is represented as Data (k, s). Since the keyword ID attached to the data is stored in the fourth and subsequent items of the data management list 101 in FIG. 8, it is searched whether there is a keyword ID matching the variable keyID. If there is a match, the list number s (= data management number) is sequentially entered into Hit (HitMax) of the corresponding data list 510 as shown in FIG. Here, the variable HitMax that manages the number of data in the corresponding data list is checked, and if this is not incremented (if HitMax = 0), the process ends because there is no corresponding data, and if not. Subtracts the extra increment and proceeds to the next process.

  Hereinafter, the processing procedure of FIG. 7 will be described in detail. It should be noted that the keyword ID is substituted into the keyID by obtaining the above-described keyword ID, and the process proceeds to step S409.

  In step S501, in order to handle the data list 510 from the beginning, a variable HitMax for pointing to the data list 510 shown in FIG. 9 is initialized to “0”. The variable s is initialized to “0” in order to search from data. In the next step S502, the variable k is initialized to “4” in order to compare the keyword ID list of the data management list 101. In step S503, it is determined whether or not the keyword ID list Data (k, s) of the data management list 101 (initially k = 4, s = 0 and Data (k, s) is 123) is equal to the keyID. inspect.

  If not equal, the flow advances to step S504 to add "1" to the variable k. In the next step S505, since a NULL code is included at the end of the keyword ID list, it is checked whether Data (k, s) is NULL. If it is not NULL, the process proceeds to step S503, and if it is NULL, the process proceeds to step S508.

  If Data (k, s) is equal to keyID in step S503, that is, if the search input from the user matches Data (k, s) in the data management list 101, the process proceeds to step S506. In step S506, the number s of the data at that time on the data management list 101 shown in FIG. 8 is substituted for Hit (HitMax) of the corresponding data list 510 shown in FIG. In the next step S507, "1" is added to HitMax so that Hit (HitMax) points to the next of the data list, and the process proceeds to step S508.

  In step S508, “1” is added to s for the purpose of referring to the next data. In step S509, it is checked whether or not s exceeds DataMax DataMax, which is the last data. If not, the flow returns to step S502 to check the next data.

If s exceeds DataMax, the process proceeds to step S510. In step S510, if HitMax is not positive, the process ends. If HitMax is positive, step S51
The process proceeds to step 1 and subtracts the extra “1” from HitMax so that Hit (HitMax) points to the end of the corresponding data list 510 in FIG. 9 and proceeds to step S512.

(The relevant data is divided into registered keywords and stored)
After acquiring (pickup) the corresponding data as described in FIG. 7, a process of classifying the acquired data into registered keywords and storing the classified data is performed as shown in FIG.

  The background screen keyword list 302 and the object list 303 in FIG. 4 are combined with the background screen setting list 610 in FIG. The background screen setting list 610 in FIG. 11 stores a keyword ID to which the background screen belongs, coordinates x, coordinates y, and an object file name. If Hit (h) of the corresponding data list 510 matches with the keyword ID stored in the background screen setting list Meta (m, 0), the value (data number ) Are classified and stored as Disp (d, m) in the display classification list 611 shown in FIG. DMax (m) 612 shown in FIG. 13 indicates the number of data stored in Disp (d, m). If there is no corresponding data, it is stored in Disp (MetaMax) (as others).

  Hereinafter, the processing will be described in detail with reference to a flowchart of FIG.

  First, in step S601, DMax (X) in FIG. 13 indicating the number of data stored in Disp (d, m) in the display classification list 611 in FIG. 12 is changed from DMax (0) to DMax (MetaMax). Initialize to “0”. Next, in step S602, a variable h for pointing to the data list 510 is initialized to “0”. Next, in step S603, d is initialized to “4” in order to refer to the keyword ID list in the fourth item of the data content of the data management list 101. In the next step S604, a variable m for referring to the background list in FIG. 11 is initialized to “0”.

  In the next step S605, the data is stored in Data (d, Hit (h)), which is the keyword ID of Hit (h) of the corresponding data list 510 of the data management list 101, and Meta (m, 0) of the background screen list in FIG. Is compared with the specified keyword ID. If they do not match, the process proceeds to the next step S608.

  In step S608, “1” is added to m to refer to the next background screen list. In step S609, it is checked whether the variable m for referring to the background screen list exceeds the final classification MetaMax of the display classification list. If not, the process returns to step S605. If it exceeds, the process proceeds to step S610, and "1" is added to d in order to refer to the next keyword ID in the data management list in FIG. In step S611, it is checked whether or not the keyword ID is NULL indicating the end, and if not, the process returns to step S604. In the case of NULL, the process proceeds to step S612, and Disp (DMax (MetaMax) of the DMax (MetaMax) -th display classification list 611 (FIG. 12) in FIG. 13 corresponding to the MetaMax-th classification in the display classification list shown in FIG. ), MetaMax) and Hit (h). In the next step S613, "1" is added to DMax (MetaMax) in order to point to the next Disp (DMax (MetaMax), MetaMax).

  If Data (d, Hit (h)) and Meta (m, 0) match in step S605, the flow advances to step S606 to substitute Hit (h) into Disp (DMax (m), m). In the next step S607, "1" is added to DMax (m) of Disp (DMax (m), m) in order to substitute the next Hit (h).

  In step S614, “1” is added to h in order to point to the next applicable data list. In step S615, it is checked whether h exceeds HitMax. If it does not exceed, it returns to step S603, and if it does, it proceeds to step S616.

(Set the size of the thumbnail area for each background screen)
After storing the relevant data described in FIG. 10 in the form of registered keywords, the processing shown in FIG. 14, that is, the processing for obtaining the size of the thumbnail area of each background screen is performed.

The general processing is as follows. First, the meta file of the background screen setting list 610 shown in FIG. 11 is opened, and the width and height of the background screen area are obtained from the meta file, and Area (m, 0) of the area information 710 shown in FIG. Area (m, 1). Then obtains the number of thumbnail images entering this background from DMax (m) shown in FIG. 13, to determine which align any number by one in the horizontal and vertical directions (n _x, n _y). Next, Area values divided by the n _x (m, 0) and the display width of the thumbnail image, Area of (m, 1) was divided by n _y value as the display height of the thumbnail images, each Area (m , 2) and Area (m, 3).
The above _nx and _ny are also put in Area (m, 4) and Area (m, 5). This process is performed for all background screens.

  Hereinafter, a detailed description will be given with reference to a flowchart showing a processing procedure for obtaining the size of the thumbnail area of each background screen in FIG.

  In step S701, a variable m for indicating the order of the background screen setting list 610 is initialized to “0”. Next, in step S702, an object file indicated by Meta (m, 3) in the background screen setting list 610 in FIG. 11 is opened. In step S703, the internal display area width of the background screen obtained from the opened file is set to Area (m, 0) shown in FIG. 14, and the internal display area height is set to Area (m, 1). In step S704, the file of Meta (m, 3) opened in step S702 is closed.

In step S705, it is checked whether DMax (m) shown in FIG. 13 is positive. If not, the flow advances to step S711. If DMax (m) is positive, there is a thumbnail image to be displayed for the classification, and the flow advances to step S706. Step S706 arrangement of the thumbnail images in the (number align the horizontal and vertical: n _x, n _y) is calculated. First, the n _x, take the square root of the number DMax (m) of the thumbnail image to be displayed corresponding to each keyword and the integer part and nx. Next, DMax (m) is divided by nx, and its integer part is set to ny. In the next step S707, the multiplying the n _x and n _y, the number of DMax (m) to confirm whether the show. If it can be displayed, the process proceeds to step S709. If you can not see adds "1" to n _y in step S 708.

In step S709, Area and (m, 0) is divided by n _x, and Area (m, 2) f substitutes the integer as the display width of the thumbnail image, Area of (m, 1) divided by n _y, the Substitute an integer into Area (m, 3) as the display height of the thumbnail image. In step S710, the next number n _y of the thumbnail image to be displayed on the background screen Area (m, 4) and F substituted, the vertical number n _y Area (m, 5) to f assignment.

  In step S711, “1” is added to m in order to perform processing for the next background screen. In step S712, in order to check whether or not the background screen is the end, it is checked whether or not m exceeds MetaMax. If not exceeded, the process returns to step S702 to perform the processing for m set in step S711. If it exceeds, the process here ends and the process proceeds to step S713.

(display)
FIG. 16 and FIG. 17 are flowcharts showing the processing procedure for displaying.

The outline is as follows. The background screen file stored in Meta (m, 3) of the background screen setting list 610 shown in FIG. 11 is opened, and the screen coordinates (Meta (m, 1), Meta (m, 2)) are used as the upper left starting point. , Draw the background. Next, the following processing is performed on each thumbnail image to be drawn on the background. First, the corresponding thumbnail file is opened, and the size of the original thumbnail image is obtained therefrom. Then, compared to the thumbnail display width and height of Area (m, 2) and Area (m, 3), the aspect ratio (aspect ratio) of the original thumbnail does not change and is within the thumbnail display width and height. The size of the thumbnail image is determined as described above (x _wid , y _wid ). Also, the display start position (upper left position) of the thumbnail image is determined by calculating the number of the thumbnail image in the horizontal and vertical directions at the display position of the background window screen (x _pos , y _pos ). Next, since the position and size of the display are determined, drawing is performed at the determined position at the determined size.

  The above is repeated for all the thumbnail images belonging to the background, and the process is repeated by repeating for all the backgrounds.

  Hereinafter, a processing procedure for performing the display of FIGS. 16 and 17 will be described in detail.

  In step S801, a variable m for indicating the order of the background screen setting list 610 is initialized to “0”. In step S802, an object file indicated by Meta (m, 3) in the background screen setting list 610 in FIG. 11 is opened. Next, in step S803, the background is drawn using (Meta (m, 1), Meta (m, 2)) in the background screen setting list 610 as the coordinates x and y of the display screen. In step S804, the file of Meta (m, 3) opened in step S802 is closed.

At step S805, the a n _ymax the n _xmax and Area (m, 4) and Area (m, 5). In step S806, a parameter c indicating the order of the same classification is initialized to “0”. In step S807, the order n _y in the y direction of the display screen is initialized to “0”, and in step S808, the order n _x in the x direction of the display screen is initialized to “0”. In other words, it indicates the location of the upper left thumbnail image in a certain background.

In step S809, a thumbnail image file (see FIG. 18) by thumbnail data ID for the c-th screen displayed in the m-th background screen of the display category list 611 Thumb (Data (3, Disp (c, m)) Open). In step S810, the thumbnail size x (horizontal size) is substituted for t _x , and the thumbnail size y (vertical size) is substituted for t _y . In step S811, the f _x by dividing t _x in Area (m, 2) (thumbnail display width), and f _y by dividing t _y in Area (m, 3) (Thumbnail Display height). In step S812, f _x, confirms whether or not f _y both 1.0 or more. For both 1.0 or more process proceeds to step S814, and 1.0 f _t In step S814. In step S812, the process proceeds to step S813 if f _x or with either or both of the f _y 1.0 or less, the smaller f _x and f _y and f _t.

In step S815, Meta (m, 1) i.e. those n _x times to the coordinates x thumbnails width Area (m, 2) to the horizontal in addition, calculates the position x _pos breadth direction. Further, by multiplying the multiple f _t and t _x (horizontal size), calculates the width x _wid thumbnail images to be displayed. Similarly, the position y _pos and the height y _{wid in the} height direction are calculated. In step S816, a thumbnail image corresponding to (x _wid , y _wid ) is drawn from the position (x _pos , y _pos ) based on the calculation result of the previous step.

In the next step S817, “1” is added to c, and the process proceeds to the next order of the same classification. However, in the next step S818, if the variable c is not greater than the DMax (m) is the last of the classification proceeds to step S819, "1" is added to the order n _x lateral to thumbnail view. In the next step S820, before the n _x set in step inspects does not exceed the maximum thumbnail display screen number n _xmax lateral returns to step S809 does not exceed, the display of the next thumbnail image Do. In step S820, the process proceeds to step S821 if n _x is n _xmax farther, the order n _y for displaying vertical thumbnails adding "1". In step S822, the previous n _y set in step inspects does not exceed the maximum n _ymax in the vertical direction of the display, to draw in the x-direction with respect to the new n _y.

If the variable c at step S818 exceeds the DMax (m) is the last of the classification, or if n _y is greater than n _ymax, since the display will be finished at the same classification, step S823 Then, “1” is added to the order m of the background screen setting list. In the next step S824, it is checked whether or not the display of the thumbnail images of all the classes is completed. If m does not exceed MetaMax, the process returns to the step S802 to display the thumbnail images of the next class. If m exceeds MetaMax, it means that display of all thumbnail images of all classifications has been completed, and the process ends.

  As described above, according to the processing of this embodiment described in detail, it is possible to perform display by changing the display position and form (in this case, the size) according to the keyword of the data. As a result, the user can easily see the entire data group as a result of the search and grasp the entire data group.

[Example 2]
FIG. 19 is a display example for explaining the second embodiment of the present invention.

  FIG. 19 shows a room in which the background screen is three-dimensionally represented. In FIG. 19, the retrieved results are mapped to objects such as a wall, a floor, a TV, and a stereo of a room according to the keywords of the retrieved results.

  FIG. 20 shows the internal structure of data management in this case.

  FIG. 20 is a three-dimensional extension of the internal structure described in FIG. 4 of the first embodiment. When the background screen is selected to be a type named “3D room” in this case, the background screen list 301 includes a keyword ID list 302 for the background screen used for the background and a three-dimensional viewpoint position (x, y, An area 901 storing z) can be referred to. Each of the keyword ID lists 302 refers to the object definition list 1001.

  The object definition list 1001 has an area for defining a display form of a thumbnail image. The case where the keyword ID for the background screen is “11” (“landscape” when referring to the keyword management list 102) will be described. The display form of the screen at this time is that “thumbnail images are displayed side by side” in the display area. Show. When the next keyword ID is 81 (“movie”), the keyword is overlapped for display on the TV object. When the keyword ID is 82 ("sound"), it is not displayed because it is a stereo object. When the keyword ID is −1 (others), it indicates that they are displayed side by side on the floor object.

  The object shape (x, y, z), which is the next area (item), contains shape information including the relative position in the window shown in three dimensions. For example, in the case of a TV object, information such as the size of the entire TV, the angle at which it is placed, and the position is stored. In the next area, the thumbnail area (x, y, z), the shape information of the part displaying the thumbnail image in the object shape is entered. In the case of a TV object, information such as the size, angle, and position of a portion corresponding to a TV screen corresponds to the TV object.

  The object file in the next area contains the actual file name of this object. In the case of a TV object, it is drawing information for drawing the actual TV shape. The next object on the thumbnail indicates whether to draw something over the thumbnail image, and when drawing, the shape information (x, y, z), the actual file name and See This shape information is indicated by a relative position to the drawing of the thumbnail. This is the curtain on the wall object.

  By the management method as described above, the setting of the background screen when three-dimensionally expanded and the position and form (in this case, size, angle, mapping (pasting) method, etc.) displayed according to the keyword are changed. Display can be performed, and the whole can be expressed more clearly.

[Example 3]
FIG. 21 is a diagram illustrating the internal structure of data management according to the third embodiment. In the second embodiment, the display position and the form are determined according to the keyword of the data. In the third embodiment, an example in which the display position and the form are determined according to the type of the data will be described.

  FIG. 21 shows the data structure of the third embodiment when the same display as that of FIG. 19 is realized.

  In the background keyword ID list 301 in FIG. 21, only ID = 11 (“landscape”), and for those not corresponding to this, the data type list 1101 is referred to. The data type list 1101 lists the data types used in this background screen from the data types described in the data file type column of the two data files in the data management list 101. In the third embodiment, “AVI” indicating a movie file and “WAV” indicating an audio file are included. Data corresponding to the search key, which does not have the keyword “landscape”, refers to the type of this data and refers to the display position and form.

  In the present embodiment, the configuration and operation are described as database software having the function of catalog software. However, this is merely an example, and it is apparent that the present invention can be applied to search display in other databases. . Further, the present invention may be applied to a system including a plurality of devices or to an apparatus including one 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 an apparatus.

FIG. 2 is a system configuration diagram for realizing the data display method according to the embodiment. FIG. 3 is a diagram illustrating a data management structure of a database according to the embodiment. 6 is a display example in the first embodiment. FIG. 3 is a diagram illustrating a display data management structure according to the first embodiment. It is a flowchart which shows the processing procedure for obtaining an ID number from the character string of a search keyword. It is a figure showing a keyword management list. It is a flowchart which shows the processing procedure which acquires the said data from a keyword ID. It is a figure showing a data management list. It is a figure showing an applicable data list. It is a flow chart which shows the processing procedure which divides applicable data into the keyword for backgrounds, and stores. It is a figure showing a background screen setting list. It is a figure which shows the classification list for a display. It is a figure which shows the variable counter for pointing to the classification list | wrist for a display. 9 is a flowchart illustrating a processing procedure for obtaining the size of a thumbnail area of each background screen. It is a figure showing an area information list. It is a flowchart which shows the processing procedure which performs a display. It is a flowchart which shows the processing procedure which performs a display. FIG. 4 is a diagram illustrating a list of path names of thumbnail image files. FIG. 14 is a diagram illustrating a display example according to the second embodiment. FIG. 14 is a diagram illustrating a display data management structure according to the second embodiment. FIG. 14 is a diagram illustrating a display data management structure according to a third embodiment.

Explanation of reference numerals

1 CPU
2 RAM
3 Hard disk (HD)
4 Floppy (registered trademark) disk (FD)
Reference Signs List 5 pointing device 6 video board 7 display 8 SCSI board 9 large-capacity external storage device 10 sound board 11 speaker 12 Ethernet board

Claims (4)

Classification for classifying data searched by an input search keyword by a computer system corresponding to a registered keyword registered in advance among keywords managed by a keyword management list that stores keywords assigned to search target data Process and
The search result of the data classified in the classification step is mapped to an object in a three-dimensional space assigned to each of the registered keywords, and an image representing the data classified in the classification step is displayed in a display form corresponding to each object. A display step of displaying on a display screen by a computer system. The data searched by the input search keyword is classified according to the registered keyword registered in advance among the keywords managed by the keyword management list storing the keyword assigned to the search target data, and the classified data is classified. A program for mapping the search results of the extracted data to objects in a three-dimensional space assigned to each of the registered keywords, and displaying an image representing the classified data on a display screen in a display form corresponding to each object. Memory for
And a processing unit for reading and executing the program from the memory. Based on a data type list that manages the type of data, a classification step of classifying data searched by the input search keyword by a computer system,
The search result of the data classified in the classification step is mapped to an object in a three-dimensional space assigned for each type of data, and an image representing the data classified in the classification step is displayed in a display form corresponding to each object. A display step of displaying on a display screen by a computer system. Based on a data type list for managing data types, the data searched by the input search keyword is classified, and the search result of the classified data is assigned to each registered keyword in the three-dimensional space. A memory for loading a program for displaying an image representing the classified data on a display screen in a display form corresponding to each object,
And a processing unit for reading and executing the program from the memory.

Images