JPH09319769A - Data base system, network data base system and data retrieving method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data base system, a network data base system and data retrieving method which enables data retrieving at high speed and can effectively utilize system resources. SOLUTION: The data base system is provided with single connection data bases 704 to 706 respectively provided with two connected data strings, data base drivers 712 to 714 respectively executing the retrieval of them and an interface driver 720 for connecting retrieving results at the data base drivers 712 to 714. The interface driver 720 instructs retrieval to a data base driver corresponding to a single connection data base with a desired retrieving item and combines the retrieving result of them to obtain the desired retrieving result.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database system, a network database system and a data search method which enable faster data search, and more particularly to a database system, a network database system and a data search which effectively utilize system resources. Regarding the method.

[0002]

A database is a collection of data organized in a predetermined way. Traditional databases have many fields (eg name, address, phone number, age,
Etc.). In a database in which records are randomly input and stored without any particular order, for example, an index or the like is used to quickly retrieve these data. The index is a table having a key for identifying each record in the database. When retrieving records from such a database, the index is retrieved first. Next, the desired record is searched based on the information such as the address obtained from the search result of the index. Also, if you don't use an index,
You need to search the entire database.

[0003]

The size of conventional databases is generally very large. Since each record has many fields, many indexes are required. Therefore, a computer that realizes a conventional database system requires a large amount of storage area. Further, a search program for searching such a huge database has a complicated structure and a large program scale. Therefore, the load of the search processing on the computer is large and the search time is long.

The present invention has been made in view of the above circumstances, and an object of the present invention is to provide a database system, a network database system, and a data search method that enable high-speed data search and do not require a large-capacity storage area. And

[0005]

In order to achieve the above object, a database system according to a first aspect of the present invention includes at least a first database, a second database, and a first database for searching the first database. A search means, a second search means for searching the second database, and a control means for allowing the first and second search means to interact with each other to obtain a desired search result.

According to this structure, a plurality of databases are searched in parallel, and the search results are made to interact (combine) with each other, whereby desired search results can be quickly obtained.

The first database is composed of, for example, a pair of character strings separated by a predetermined symbol. As a result, the size of each database becomes extremely small, which enables high-speed data retrieval.

The first and second searching means may further include means for logically operating the data in the first and second databases. Further, the control means may include means for obtaining a desired search result by logically operating the search results by the first and second search means.

Further, the control means instructs the first and second search means to execute the search of the first and second databases, respectively, and the result of the search by the first and second search means is executed. Means may be provided to obtain a desired search result by combining.

A network database system according to a second aspect of the present invention is a network database system including a large number of computers connected to a network, and the network database system includes at least first and second databases. When,
First search means for searching the first database;
Second search means for searching the second database;
And a means for acquiring the first and second databases and the first and second search means via the network, and the acquired first and second database search means. And a control means for obtaining a desired search result.

According to this structure, a plurality of databases are searched in parallel, and the search results are made to interact (combine) with each other, whereby a desired search result can be quickly obtained. Further, since only the database and the search means (search program) for searching the database are downloaded via the network, the traffic load is reduced.

A data search method according to a third aspect of the present invention is a data search method in a database system, wherein at least a first database and a second database are provided and the first database is searched. Search step, a second search step of searching the second database, and a control step of combining the search results of the first and second search steps to obtain an arbitrary search result. .

According to such a configuration, a plurality of databases are searched in parallel and the search results are interacted (combined) with each other, so that a desired search result can be quickly obtained.

The control step includes a step of supplying a first search instruction including a first search criterion to the first search step, and a second search instruction including a second search criterion to the second search instruction. And a step of supplying to the search step, wherein the first search step is responsive to the first search command supplied from the control step, and includes the first search command included in the first search command. Searching the first database according to one search criterion to generate a first search result, the second searching step comprising:
In response to the second search command supplied from the control step, the second database is searched according to the second search criterion included in the second search command to generate a second search result. The control step may further include the step of combining the first and second search results generated by the first and second search steps to obtain a desired search result. May be.

[0015]

1 is a schematic diagram of a database system according to an embodiment of the present invention. The database system comprises a number of databases such as databases 704-706. One record in these databases is composed of two data columns (fields). These databases are called a single join database because they relate (join) two columns of data to each other. The data stored in the single combined database includes text data, numeric data, graphic data,
Audio data, video data, etc. are arbitrary.

This database system will be described with reference to FIG. 1 by taking a library database system which holds records of all books possessed by the library as an example. The first of the single combined databases 704 of this library database system
The column of is the identification (ID) number of the book held by the library,
The second column is the year of publication of each book. In the single combined database 704, the data (ID and issue year) in the first and second columns are combined.

The single combined database 705 stores data of IDs and book author names. Single combined database 7
06 stores the ID and the name of the person who borrows the book. In this database system, a database in which neither of the two columns of the single join database is an ID (for example,
A database with two columns, "book name" and "author name") is also available. However, when using such a single join database, the database system
It is necessary to have a single-join database that joins the columns and the columns (for example, a single-join database that joins the ID and the name of the book and a single-join database that joins the ID and the author name).

Each single join database 704-706
Is a database driver (search program) 712-
714 associated therewith. Database driver 7
The main function of 12-714 is to perform a search of the associated single join databases 704-706 and send the search results to the appropriate file. The database drivers 712 to 714 can also edit the records in the databases regarding the associated single combined databases 704 to 706.

For example, an example of a display (screen) 740 for inputting criteria (retrieval criteria) when the database driver 712 retrieves the single combined database 704 associated with itself and displaying the retrieval result is shown in FIG. Shown in. The single join database 704 associated with this database driver 712 joins the library's book ID and year of publication as described above. The display 740 comprises a window 742 for entering first search criteria (relationships). Relationships include: greater than (>), less than (<), equal (=), greater than (>
=) And the following (<=). The display 740 is
A window 744 for inputting the second search criterion (year of issue) is provided. For example, if the user wants to retrieve the ID of a book issued after 1960, the window 7
42. Click (press) “>” in 42, and click the window 744.
Then click "1960". For example, window 7
44 includes a scroll bar 745 for scrolling the year of issue.

Also, if the user wants to define an AND relationship between search criteria, such as a search for a book ID issued after 1960 and issued before 1980, A
The ND button 746 is used. In this case, in addition to the above operation (clicking “>” and “1960”), AND
Click the button 746, and in the window 742, "<"
It is necessary to click, and then click “1980” in the window 744. The display 740 displays the input search criteria in the window 752.

The display 740 includes a search button 748 for instructing execution of the search, a cancel button 754 for instructing to stop the search, and a window 750 for displaying the search result. For example, the window 752 displays search criteria "> 1960 AND <198.
When the search button 748 is clicked in the state where “0” is displayed, the display 740 displays in the window 750 the IDs of the books issued after 1960 and before 1980. If the cancel button 754 is clicked during execution, the search is stopped, for example, the window 750 includes a scroll bar 751 for scrolling the search result.

The first search criterion (relationship) may include ones other than those mentioned above. Also, the display 74
0 is a search criterion other than the AND button 746 (for example, O
Buttons for defining other logical operations such as R) may be provided.

In general, databases are searched using multiple search criteria (eg, year of publication, publisher name, author name, etc.). As an example, the IDs of all books published by a publisher between 1960 and 1970.
May be searched. In this case, a search for a database that combines the ID and the publisher name and a search for a database that combines the ID and the year of publication are performed, and the desired search result is obtained by ANDing these two search results. To be

Next, the interface driver 72 capable of obtaining a desired search result by performing arithmetic processing on the search results of the plurality of single combined databases.
0 will be described. Interface driver 720
Manages searches of multiple single join databases 704-706. For example, the interface driver 720
May cause application 724 to specify a single combined database to search and search criteria.

An example of a display (screen) 770 associated with the interface driver 720 is shown in FIG. The display 770 includes database windows 772 to 775 for inputting search criteria of the plurality of selected single combined databases. The database windows 772 to 775 are the display 7 shown in FIG.
A structure similar to 40 is provided. For example, 1960 and 1
When retrieving all the books published by a publisher in 970, the display 770 displays the search criteria of the database that combines the ID and the publisher name, and the database that combines the ID and the year of publication. The database windows 772 and 773 are provided for inputting the criteria and. The method of inputting search criteria into each of the database windows 772 to 775 is the same as the method described with reference to FIG.

The display 770 displays the search results of each single join database in the corresponding database window 7.
72 to 775. The display 770 has a window 778 for selecting a final search (arithmetic processing) for all the displayed search results, a search button 782 for instructing execution of the search, and a cancel for instructing to stop the search. A button 784 and a result window 780 for displaying the result are provided. For example, when “AND” is selected in the window 778 and the search button 782 is clicked, the result window 780
Displays the result of ANDing the search results in the database windows 772-775. If the cancel button 784 is clicked during the search, the search is stopped.

By using the present invention, a very effective network database system can be realized in a local area or wide area network environment. For example, when adding a new single join database to multiple existing single join databases, develop a new single join database and database driver using any computer connected to the network,
On the other hand, it is possible to search existing multiple single-join databases using other computers. Therefore, according to the present invention, it is possible to expand the database while keeping the database system in operation.
The network database system of the present invention may be constructed on the Internet, for example.

FIG. 4 is a schematic diagram of a network database system constructed on the network. This network database system comprises a plurality of computers 802-810. These computers 802
˜810 are connected to the network 812. The network 812 is arbitrary such as a local area network and a wide area network.

As shown, the single join database and database driver 820 is a computer 802.
Exists within. Also, two sets of a single combined database and database driver 824, 825
It exists in 04. Computer 804 can download the single join database and database driver 820 from computer 802 using conventional network protocols. The computer 804 is a database 820A downloaded from the computer 802.
Can be used with three sets of single combined database and database drivers 824, 825, 820A.

Further, the single combined database and the database driver may exist in different computers on the network. For example, a single join database may reside on computer 806 and its associated database driver resides on computer 810. However, a computer using these single-join database and database driver needs to download the single-join database and database driver from computer 806 and computer 810, respectively.

In such a network database system, each computer downloads and retrieves only the required single combined database and database driver. Therefore, the traffic load on the network is small, and the system resources of each computer can be effectively used. The database system and the network database system can be a more efficient system by using the computer architecture (digital cell technology) described below. Digital cell technology is described in Japanese Patent Application No. 8-58.
877 and US patent application 08 / 539,806. These contents are incorporated herein by reference.

The digital cell technology is a bossless architecture in which all program modules are hierarchically equivalent to other modules and one program module (boss) for controlling all programs does not exist. FIG. 5 is a schematic diagram of an application 160 based on this bossless architecture. Application 160 includes a number of program modules (cells) such as modules 162-165, 169. Each cell is hierarchically at the same level as the other cells. When cells link with each other, there is no need to store history, linkage information, and the like. Further, since each cell is directly linked, each link is independent. For example, cell 1
62 and 164 are not linked via the intermediate cell 169 as shown by dashed lines 167, 168, but by dashed line 1
Directly linked as indicated by 66. The application 160 is formed by selecting cells and linking the selected cells.

FIG. 6 shows the structure of an application 200 using digital cell technology. The application 200 includes a plurality of operating cells (C1 to C5). The cells (C1 to C5) are respectively associated with the DNA files (D1 to D5) having the information of the cells themselves. Here, the relationship between the cell and the file that holds the cell information is the cell and its DNA (gene).
This file is called a DNA file because it has a similar biological relationship with.

At a desired timing, the cell shifts to a digital shifting function (Digital Shifting Function).
Ion (DSF) protocol can be used to send statements (DSF statements) to other cells. Cells that have received DSF statements execute these DSF statements. Cell and DN
The detailed structure of the A file and the DSF protocol will be described below.

The cell does not retain information (communication history) regarding the originator (transmitter) of the DSF statement. Thus, once one cell has completed writing the DSF statement to another cell, the link between these cells no longer exists. The cell receiving the DSF statement is D
During execution of the SF statement, the origin of the DSF statement is not involved.

In this architecture, when a cell executes a DSF statement written by another cell, there is no need to store or restore the register value on the stack. Also, there is no need to temporarily store the source cell before transmitting the DSF statement. There is no need to send a message to report the execution result. As a result, the execution speed of the application is improved.

FIG. 7 is a diagram showing the logical structure of the DNA file 250 associated with the cell CA, for example. DN
The A-file 250 comprises a self-parameter section 252 containing parameters (self-parameters) relating to the characteristics of the cell CA itself. For example, section 252
Parameters related to the display method when the cell CA itself is activated (window size, cell CA background color, cell CA
, The name of the audio file used at startup and shutdown, etc.). In addition, the DNA file 250
A link parameter section 254 including association parameters (link parameters) including a cell name, a symbol, a display position, and the like is provided for a cell linked to the cell CA.

The DNA file 250 includes a DSF information section 256. This DSF information section 25
6 is a normal section 257 and a top-priority function section 2
64. The configuration of the normal section 257 and the highest-priority function section 264 is as follows.
Are almost identical except that they have higher priority when executing DSF statements. These two sections include individual headers to identify the sections.

The normal section 257 comprises a state section 258 and a statement section 260.
The statement section 260 describes a statement transmitted from another cell to the cell CA.
The statements described in the statement section 260 are sequentially executed. Each statement comprises parameters depending on the needs of executing the statement. The status section 258 includes the following three elements. (A) A first pointer that currently points to the last statement in statement section 260. (B) A second pointer pointing to the statement currently being processed by the cell CA. (C) Cell state at the present time.

The highest priority function section 264 comprises a status section 266 and a command line section 268. The configuration of the status section 266 is similar to the configuration of the status section 258. The command line section 268 describes a command line transmitted from another cell using the DSF protocol. This command line has higher execution priority than the statements in statement section 260. The command lines in command line section 268 are executed sequentially.

The logical structure shown in FIG. 7 is realized by using one or a plurality of physical files. Each part of the logical section may be physically mixed. The DNA file 250 is composed of, for example, a text file. Therefore, the contents of the DNA file 250 can be changed by using a normal text editor.

DSF transmitted from one cell to another
Statements are sent according to the DSF protocol. Hereinafter, a procedure of transmitting a DSF statement according to the DSF protocol will be described. First, the source cell (for example, the cell CS) performs preprocessing for communicating (linking) with the DNA file 250 associated with the destination cell (for example, the cell CA). The source cell is
Check the address of the destination DNA file 250, and
By checking the status in the status section 258 of the A file 250, it is determined whether the DNA file 250 can receive the DSF statement. Cell CS
Can send a DSF statement only when the cell CA DNA file is receivable.

DNA file 250 of destination cell CA
When the cell can be received, the cell CS executes a communication (link) process. To determine the proper address to write the DSF statement, the CS points to the first pointer (state section 2) pointing to the last DSF statement.
58), the DSF statements are sequentially written from the address position next to the address indicated by the first pointer. Then, the cell CS updates the first pointer to point to the last DSF statement newly written in the statement section 260. Thereafter, the communication link between the cells CA and CS ends.

The above-mentioned DSF protocol is an example,
The DSF statement may be transmitted according to another protocol capable of writing the DSF statement to the DNA file 250. Also, such that the first pointer points to the position next to the last DSF statement,
Different pointer structures may be used. Furthermore, instead of physically storing the DSF statements sequentially, they may be stored according to a logical structure.

D to statement section 260
Although the case of transmitting the SF statement has been described, the command line is transmitted with respect to the command line section 268 as in the case described above. Since the headers of the normal section 257 and the highest priority function section 264 are different, the source cell can identify these two sections and write them in the appropriate sections.

The structure of the cell CA is shown in FIG. Cell CA
Are the initial setting unit 312 and the DNA interface unit 31
4, a DSF interface unit (DSF protocol processing unit) 316, a module execution unit 318, a temporary memory unit 322, and a cell activation unit 324. DN
The A interface unit 314 reads and writes the DNA file 250 associated with the cell itself. The initial setting unit 312 performs initial settings such as reading parameters from the self parameter section 252 of the DNA file 250 when the cell is activated. The DSF interface unit 316 includes a code (processing program) for transmitting and receiving a DSF statement using the DSF protocol.

The module execution unit 318 has a code for automatically executing the DSF statement written in the DNA file 250 by another cell. The code of the module execution unit 318 sequentially reads and executes the DSF statements described in the statement section 260 of the DNA file 250. Cell CA is
Each time the DSF statement in the statement section 260 is executed, the highest priority function section 264 is referred to and all existing DSF statements are executed.
Thereafter, the cell CA returns to the statement section 260.
And execute the next DSF statement.

The temporary memory unit 322 stores temporary information. The cell CA has its attributes (for example, display-related attributes (window size, background color) even during execution.
Etc.) may be changeable. This changed information,
Instead of being immediately described in the DNA file 250,
It is temporarily stored in the temporary memory unit 322, and is described in the self-parameter section 252 of the DNA file 250 at a predetermined timing (for example, every time the execution of one DSF statement is completed).

The cell activation unit 324, for example, at the time of executing a DSF statement that activates another cell, information regarding the cell to be activated (link parameter section 254).
The link parameters described in 1) are transmitted to a predetermined cell having a function of activating the cell.

Generally, the size of each cell is small and the function of the cell is appropriately limited. Therefore, the execution speed of the application constituted by those cells is high, and the computer resources can be effectively utilized. Communication between cells is straightforward and the number of accesses to the operating system (OS) is minimal. Thus, the efficiency of the system is improved.

This digital cell technology comprises at least two cells which can communicate with each other. Each cell is a program module encapsulated to perform only a predetermined process. As a result, applications developed using this digital cell technology are separately
Or, configure a complex program that can be executed simultaneously. Cells interact using the DSF protocol. Each cell can control the operation of the other cells. Another feature of this architecture is that cells receiving a DSF statement do not retain information about their origin. Thus, when each cell executes the DSF statement, it can proceed with the process one after another without transmitting the execution result to the cell that generated the DSF statement.

This digital cell technology is based on Micr
It can be applied to a multimedia application development system operating in an OS environment having a function of Windows (registered trademark) of Microsoft Corporation or higher. In this environment, a cell is a program stored as an EXE file that displays a window on the monitor at startup. By linking these cells, the user can configure the application to assemble blocks. Each cell performs various functions based on information given from other cells, thereby realizing a variety of applications.

The outline of the digital cell technology has been described above. By using this digital cell technology, the database system of this embodiment can be realized as a very efficient system. For example, if the database drivers 712 to 714 of FIG. 1 are configured as cells using digital cell technology, almost no overhead occurs when linking the database drivers to each other, so that the operation of the entire system is not affected and many Database and database driver can be provided. Therefore, Digital Cell Technology provides an efficient platform to support the database system of the present invention.

Next, a database system realized by using the digital cell technology will be described. The database driver and the interface driver of the database system of the present invention are realized as cells (driver cells and interface cells). In addition, the single binding database contains DNA associated with the driver cell.
It is realized as a file. These driver cells are
It is possible to interact with other driver cells using the above method. For example, the driver cells receive search DSF statements from other cells to search their associated single join databases and execute the received search DSF statements.

Digital cell technology is also suitable for the network database system described above with reference to FIG. Computer 8 on network 812
02 to 810 can obtain the driver cell and the single combined database existing in another computer via the network 812. Once downloaded to the local computer, the driver cell and the single binding database can interact with other cells that have already been downloaded.

FIG. 9 is a diagram showing the logical structure of the DNA file 250 associated with the driver cell CB, for example. The DNA file 250 comprises a database section 262 with database data associated with the driver cells CB. If the database is large, this database section will be large. For example, the contents of section 262 take the form AC102 = John Smith AC103 = Steve Dole AC105 = Mike King, as shown.

In this example, the "=" symbol is used to specify a bond. The data on the left side of the "=" symbol (that is, AC102, AC103, AC105) is, for example, the ID number of the book. On the other hand, the data on the right side of the "=" symbol is, for example, the author's name. These data are ASCII codes, for example. The number of rows is determined by the amount of information in the database.

Single combined databases 704-70 in the library database system described with reference to FIG.
6 is realized as the DNA file 250, the data (ID and year of publication, ID and author name, ID and borrower name) of each single binding database 704 to 706 is the database section 262 of each DNA file. Described in.

The highest priority function section 264 and the normal section 257 of the driver cell CB are D for instructing retrieval of the database, deletion of records in the database, and the like.
Mainly receives SF statements. These DSF statements include various parameters such as reference parameters indicating search criteria and destination file parameters indicating destinations of search results. As shown, the DSF information section 256 includes a search key section 271 for inputting search criteria, and a destination file section 273 for inputting the destination of search results.

Next, the process in which the driver cell CB searches the database in the DNA file 250 will be described using a specific example. As shown in FIG. 10, the statement section 260 includes “I of John Smith
Search D: Destination is Cell CD "and" Author is Mike
It is assumed that there are two statements (S1, S2) that "King ID is searched: Destination is cell CD".

First, the cell CB is the statement S1 of the statement section 260 "Author is John S.
Retrieval of the ID of the Smith: The destination is the cell CD, and the database in the database section 262 is searched for a record containing "John Smith". When the cell CB detects the corresponding record D1, the cell CB reads the ID “AC102” from the database section 262, and searches the cell CD for “AC”.
102 "is transmitted. It is assumed that after the start of execution of this statement S1, the command line C1" the author searches for the ID of Steve Dole: the destination is cell CE "is written in the command line section 268.

Next, the cell CB refers to the command line section 268. Command line section 26
8 includes command line C1 "The author is Steve Do
Searching for ID of le: destination CE is present, so cell CB reads its command line and searches the database for a record containing "Steve Dole". Cell CB is the corresponding record D
When 2 is detected, the ID “AC103” is read out,
The search result is transmitted to the cell CE.

Cell CB then returns to statement section 260 where the next statement S2 "Author M
Search for ID of ike King: Destination is cell C
"D". Cell CB is from the database
When the record D3 including "Mike King" is detected, the ID "AC105" is read and the search result is transmitted to the cell CD.

In this example, the command line that was present in the command line section 268 is "The author is Mike
If you want to delete the King record, ”cell CB
Is record D3 "A in database section 262
C105 = Mike King "is deleted. Next, when the statement S2" The author retrieves the ID of Mike King: the destination is cell CB "is executed, a message" corresponding data does not exist "is sent to cell CB. Sent. In this way, the driver cell CB sequentially performs a search of the databases described in the database section 262 of the DNA file 250 associated with itself.

By using the interface cell,
Search results from multiple databases can be combined. The flow of the DSF statement in this case will be described with reference to FIG. As shown in the figure, in the database section 262 of the DNA file 250, there is a driver cell E1 including the data of the book ID and the author name of the book, and a driver cell E2 including the data of the book ID and the year of publication of the book. I decided to. Also, those driver cells E
Interface cell G1 that combines the search results of 1 and E2
Shall exist.

For example, the author's name is "Mike King"
When searching for the book ID of the book or the book ID of the year "1970", the interface cell G1 searches the DNA file 250 of the driver cell E1 for the statement "The author searches for the Mike King ID: the destination is the cell." G1 ”is transmitted (L1), and the statement“ I of year of issue 1970 ”is issued to the DNA file 250 of the driver cell E2.
Search D: Destination is cell G1 "(L
2).

The statement transmitted from the interface cell G1 is the DNA file 25 of the cells E1 and E2.
Each is written to 0 and executed. Cells E1 and E2
Transmits the search result to the DNA file 250 of the interface cell G1 (L3, L4). When the search results are respectively written in the DNA files 250 of the interface cell G1, the interface cell G1 performs an OR operation on these search results, and the final search results (that is, the author name is "Mike King"). The book ID and the book ID whose publication year is "1970" are obtained.

In this example, the author name is "Mike K.
ID of the book that is "ing" and the year of publication is "1970"
, The interface cell G1 ANDs the search results received from the driver cells E1 and E2.
It suffices to execute the calculation. In this way, by using the interface cell, it is possible to perform arithmetic processing on search results of a plurality of databases and combine the plurality of search results.

A block diagram of a computer system 600 for executing the database system of this embodiment is shown in FIG. Computer system 600 includes a central processing unit (CPU) connected to system bus 608.
A computer 602 having a 601 and a system memory 606 is provided. System memory 606 is random access memory (RAM), read-only memory (ROM)
Etc. The computer 602 includes a bus controller 612 for controlling the peripheral device bus 614.

Based on the architecture of the computer 602, the types of the peripheral device bus 614 are PCI bus, V
ESI local bus, ISA bus, etc. are optional. Peripheral bus 614 allows a peripheral board to be connected to computer 602. The peripheral device board includes, for example, a video board 616 and a serial board 62.
0, a disk controller board 622, and the like. CP
The U 601 and the system memory 606 can communicate with the peripheral board through the bus controller 612.

The serial board 620 is the computer 6
02 and an external serial device such as a mouse 636. The video board 616 is a circuit for controlling the monitor 630 and displaying an image,
AM (VRAM) and the like. Video board 616
An image is displayed on the monitor 630 based on the information stored in the VRAM. The image displayed on the monitor 630 is
Updated at predetermined time intervals. Computer system 6
If 00 is implemented in a Windows environment, one or more windows, such as window 632 and window 634, will be displayed on monitor 630. Monitor 6
As an example of the window displayed on 30, there is a display 740 shown in FIG.

The disk controller board 622 includes a hard disk 638 and a floppy disk drive 6
39, and controls them. The single join database and the database driver may be stored in the hard disk 638 in advance, and the one stored in the floppy disk may be stored in the hard disk 63 by the user.
8 may be installed.

The medium for supplying the single combined database and database driver to the computer system 600 is not limited to the floppy disk, but may be a CD-RO.
M, a communication medium (a medium such as a communication line, a communication network, and a communication system that temporarily and fluidly holds the program) is optional. For example, the program may be posted on a bulletin board (BBS) of a communication network and distributed via the network.

[0074]

According to the present invention, a plurality of databases can be searched in parallel and the search results can be interacted with (combined with each other) to quickly obtain a desired search result. Further, since the system is composed of a plurality of databases, it is easy to add or change the databases. Moreover, since the size of each database is small, the system resources of the computer can be effectively utilized.

[Brief description of drawings]

FIG. 1 is a schematic diagram of a database system according to an embodiment of the present invention.

FIG. 2 is a diagram showing an example of a display (screen) associated with a database driver.

FIG. 3 is a diagram showing an example of a display (screen) associated with an interface driver.

FIG. 4 is a schematic diagram of a network database system that realizes this database system on a network.

FIG. 5 is a schematic diagram of an application based on a bossless architecture.

FIG. 6 is a diagram showing a structure of an application using digital cell technology.

FIG. 7 is a diagram showing a logical structure of a DNA file associated with a cell CA.

FIG. 8 is a diagram showing a structure of a cell CA.

FIG. 9 is a diagram showing a logical structure of a DNA file associated with a driver cell.

FIG. 10 is a diagram for explaining a process in which a driver cell searches a database in a DNA file.

FIG. 11 is a diagram for explaining the flow of statements when combining search results of a plurality of databases.

FIG. 12 is a block diagram of a computer system for executing the database system of this embodiment.

[Explanation of symbols]

704, 705, 706 Single join database 712, 713, 714 Database driver 720 Interface driver 724 Application 802, 804, 806, 808, 810 Computer 812 Network 820, 824, 825 Single join database and database driver

Claims (8)

[Claims] 1. At least first and second databases, first searching means for searching the first database, second searching means for searching the second database, and the first and second databases. A database system, comprising: a control unit that interacts two search units to obtain a desired search result. 2. The database system according to claim 1, wherein the first database is composed of pairs of character strings separated by a predetermined symbol. 3. The database according to claim 1, wherein the first and second searching means further include means for logically operating the data in the first and second databases. system. 4. The control means comprises means for obtaining a desired search result by logically operating the search results by the first and second search means. The database system according to any one of items. 5. The control means instructs the first and second search means to execute searches of the first and second databases, respectively, and results of the search by the first and second search means. 5. The database system according to claim 1, further comprising means for acquiring a desired search result by combining the above. 6. A network database system comprising a plurality of computers connected to a network, the network database system comprising at least first and second databases, and a first search for searching the first database. Means, second search means for searching the second database,
The computer includes means for acquiring the first and second databases and the first and second search means via the network, and the acquired first and second search means. A control means for obtaining a desired search result by interacting with each other, and a network database system. 7. A data search method in a database system, comprising at least a first and a second database, a first search step of searching the first database, and a step of searching the second database. 2. A data search method comprising: a second search step; and a control step of combining the search results of the first and second search steps to obtain an arbitrary search result. 8. The control step comprises the step of supplying a first search command including a first search criterion to the first search step, the first search step being supplied from the control step. Responding to the first search command, searching the first database according to the first search criterion included in the first search command to generate a first search result. The step comprises supplying a second search instruction including a second search criterion to the second search step, the second search step including the second search instruction supplied from the control step. In response to the second search command, the second database is searched in accordance with the second search criteria to generate a second search result. 8. The data search method according to claim 7, further comprising a step of combining the first and second search results generated by the first and second search steps to obtain a desired search result. .