JPH10254865A - Communication control method, server system using the method, and communication system using database - Google Patents

Abstract

(57) [Summary] [Problem] To promptly provide search results to a client. SOLUTION: Request information for requesting a conversion candidate of a kana to be converted is transmitted from a client 1 to a server 2 holding a dictionary for kana-kanji conversion processing. The processing unit 4 of the client 1 holds a response time from the transmission of the request information to the completion of the reception of the response information from the server. When the next request information is transmitted, the previous response time is a predetermined time. If the value exceeds the specified value, candidate request information with the division request transmission flag set is transmitted. The conversion processing unit 9 of the server 2 receives the ON setting of the flag, extracts a predetermined number of the corresponding conversion candidates in descending order of use frequency, and transmits the candidates to the client 1.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a client / server system for accessing a server having a database from a plurality of clients to obtain necessary information from the database, such as a LAN, and a virtual system such as the Internet. More particularly, the present invention relates to a communication control method and system for efficiently acquiring data requested by a client, the technology being related to a network system having a large-scale database in an information space.

[0002]

2. Description of the Related Art In a conventional client-server system, when a search condition input by a user is transmitted from a client to a server, the server searches a database in a memory using the search condition, and the search result is obtained. Is returned to the client that sent the search condition.

In recent years, in a network system such as the Internet, in which the number of users is rapidly increasing, information held in a computer of a predetermined subscriber is associated with an address given to the subscriber. A large-scale database is built in the entire space where the network spreads. By transmitting an address corresponding to the required information to the communication line, the subscriber can connect to the computer as the information source and acquire the information.

[0004]

SUMMARY OF THE INVENTION A conventional client
In a server system, the server returns all search results extracted from the database to the client,
As the number of clients accessing the server increases, the communication line becomes more crowded and the load on the transmission / reception processing system of both the server and the client increases. At the same time, the load on search processing on the server side also increases, so that the client side cannot quickly obtain necessary search results,
Processing efficiency is significantly reduced.

[0005] This problem is also the same in a network system in which the entire network functions as a server holding a database. As the number of users accessing the communication line increases, it takes more time for each user to acquire information. Time increases and processing efficiency decreases.

[0006] The present invention has been made in view of the above-mentioned problems, and when the processing time from when a client transmits request information to when it obtains a search result becomes long, among the search results for the request information, An object of the present invention is to promptly provide search results to a client by extracting and transmitting only information that is important to the client.

[0007]

Means for Solving the Problems As a method for solving the above technical problem, when a server holding a database receives request information for specifying information to be extracted from the database from a client, the client makes the request. It is determined whether or not the processing time required from sending the information to obtaining the search result corresponding to the request information is long, and when it is determined that the processing time is long, based on a predetermined criterion among the elements constituting the search result Elements up to the priority are transmitted to the client.

Further, as a system for implementing the above method,
A database, a receiving unit for receiving request information for specifying information to be extracted from the database from a client, a search unit for searching the database using the request information received by the receiving unit, and the client Determining means for determining a state of a processing time required from transmission of request information to obtaining a search result, and a predetermined result from each element constituting the search result by the search means according to the determination result of the determination means. A server system is disclosed that includes extraction means for extracting elements up to a priority order based on criteria, and transmission means for transmitting each element extracted by the extraction means to a client.

Further, in a communication system comprising a server holding a database and a client, as a configuration for realizing the above method, the client is provided with a transmission means for transmitting the request information to the server, On the side, a search unit that searches the database using the request information transmitted from the client, and a determination unit that determines a state of a processing time required until the client obtains a search result after transmitting the request information, Extracting means for extracting elements up to a priority order based on a predetermined criterion from each of the elements constituting the search result by the searching means in accordance with the result of the determination by the determining means; And a transmitting means for transmitting the data to the system.

Here, the following terms included in the above components are defined. (1) Database This is an information system that systematically organizes and stores a plurality of data, and when a requester gives a predetermined condition, reads out appropriate data according to the condition and returns it to the requester. For example, a dictionary for kana-kanji conversion processing, an information system that stores search results corresponding to predetermined search conditions, an information system that can read information stored at a predetermined address, and the like correspond to this.

(2) Status of processing time This information can be used to determine the length of processing time required from when the client transmits the request information to the server to when the retrieval result is obtained. This concept, of course, includes information indicating the length of the processing time itself. However, the processing and communication system status parameters (for example, the number of clients accessing the server, The number of processes performed on the server side, the number of attempts made by the client to connect to the server, etc.).

(3) Priority For each element extracted from the database as conforming to the request information, the priority is a rank assigned based on a predetermined evaluation criterion, or a numerical value directly corresponding to the order.

[0013]

According to the first, seventh and eleventh aspects of the present invention, when the server receives the request information from the client, a processing time required from the transmission of the request information by the client to the obtaining of the retrieval result on the server side. Is determined to be longer, an element up to a certain priority in the search result for the request information is transmitted to the client. Therefore, the client can obtain highly important search results in a shorter time than when all search results are received.

According to the second, eighth, and twelfth aspects of the present invention, in a server holding a dictionary for kana-kanji conversion processing as a database, when a kana to be converted is transmitted from a client, the server performs processing on the client side If it is determined that the time becomes longer, the conversion candidates up to a predetermined order are extracted from the conversion candidates for the kana in descending order of the use frequency and transmitted to the client.

According to the third, ninth, and thirteenth aspects of the present invention, when a client sends a search expression indicating a predetermined search condition, the server determines that the processing time on the client side will be long, and the element matching the search condition is determined. Among the elements, the elements up to a predetermined rank are extracted in order from the one with the highest fitness,
Send to client.

According to the fourth, tenth, and fourteenth aspects of the present invention, when information for instructing reading of predetermined text data is transmitted from a client to a server holding a database of text data having important information at the beginning, If the server determines that the processing time on the client side will be longer, the characters from the closest position from the beginning of the text to the predetermined position are extracted from the characters constituting the designated text data, and the client Sent to.

According to the fifth and fifteenth aspects of the present invention, the server determines whether or not the processing time is long using the identification information generated on the client side. Can be determined.

According to the inventions of claims 6 and 16, when the same request information is transmitted again from the client which has obtained the retrieval result extracted preferentially, the element having the priority higher than the previous priority is transmitted.

[0019]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, three embodiments according to the present invention will be described step by step. First, in the first embodiment, a dictionary for kana-kanji conversion processing is held on the server side, a kana to be converted is transmitted from each client to the server, and a conversion candidate corresponding to the kana is returned. 1 shows a client-server system (hereinafter referred to as a “kana-kanji conversion system”).

In the second embodiment, a database for fuzzy inference operation is stored on the server side, and a search condition expression is transmitted from each client to the server to return a search result satisfying the condition. Client / server system (hereinafter referred to as “fuzzy search system”)
).

Further, in a third embodiment, a system for accessing a predetermined computer in a network using a WWW browser on the Internet and reading out text data stored in the computer (hereinafter referred to as a "text data communication system") ).

[0022]

【Example】

(1) Kana-Kanji Conversion System FIG. 1 shows a schematic configuration of a kana-kanji conversion system according to this embodiment limited to a relationship between one client 1 and a server 2. The main body includes an input unit 3, a processing unit 4, a transmitting / receiving unit 5, a candidate buffer 6, an output unit 7, and the like. The computer main body on the server 2 side includes a transmitting / receiving unit 8, a conversion processing unit 9, and the like. .

The input unit 3 of the client 1 is for receiving an input from a keyboard (not shown), and the processing unit 4 recognizes the input content and executes a series of control described later. The transmission / reception unit 5 is used for communication with the server 2, and the candidate buffer 6 temporarily stores transmission data from the server 2. The output unit 7 is for displaying the input contents of the input unit 3 and the result of kanji conversion on a monitor.

When the user operates the keyboard to input a pseudonym to be converted on the client 1 side, the processing unit 4 recognizes the input content, creates candidate request information described later, and transmits and receives this information. The data is transmitted to the server 2 via the unit 5. The conversion processing unit 9 of the server 2 holds a dictionary that stores conversion candidates for each kana in the order of use frequency, and in response to receiving candidate request information from the client 1, converts the kana included in the information into a key. To search the dictionary. After that, the conversion processing unit 9 creates response information indicating the search result, and sends the response information to the client 1 as the candidate request source.
Return to. The communication between the server 2 and the client 1 is performed by a packet switching method.

In this embodiment, the time from when the client 1 transmits the kana to when it receives the conversion candidate (hereinafter referred to as "response time") is set so that the kana-kanji conversion processing in each client 1 is performed quickly. ) Exceeds a predetermined reference value, at the time of the next conversion processing, a flag is set in the candidate request information transmitted from the client 1 to the server 2, and only a part of the conversion candidates to be transmitted is extracted and transmitted. (Hereinafter, this flag is referred to as a “divided transmission request flag”). Server 2
When receiving the candidate request information in which the divided transmission request flag is set, the conversion candidates retrieved from the dictionary are extracted by a predetermined amount of information in descending order of use frequency, and response information including the extraction result is extracted. Return to client 1 side.

The processing unit 4 of the client 1 stores the content of the returned response information in the candidate buffer 6 and
A list of conversion candidates stored in the candidate buffer 6 is displayed on a monitor via the output unit 7. The user looks at this display screen, selects a desired conversion candidate, and performs a fixing operation of converting the pseudonym into this conversion candidate.

FIG. 2 shows an example of the storage contents of the candidate buffer 6 of the client 1. Three candidates ("change", "deflection", "polarization" in the figure) ") Are stored.

In the figure, the candidate numbers associated with the respective conversion candidates correspond to the order of the use frequency of the candidates. Here, the smaller the number, the higher the use frequency. The unacquired candidate number is transmitted from the server 2 together with each conversion candidate, and among the conversion candidates that the client 1 has not yet acquired for the pseudonym, the candidate to be acquired next (namely, the unacquired candidate) Candidate number corresponding to the most frequently used candidate).

FIG. 3 shows the data structure of the candidate buffer 6 when all the conversion candidates corresponding to the pseudonym “Henko” are transmitted from the server 2. Further, the fourth candidate that has not been acquired is added, and the unacquired candidate number is updated to data “−1” indicating that there are no more unacquired candidates.
In a state where the response information from the server 2 is not stored, “0” is stored in the candidate buffer 6 as the unacquired candidate number.

FIG. 4 shows a series of control procedures by the processing section 4 of the client 1, and FIG. 5 shows a detailed procedure of step 6 in FIG. Hereinafter, the kanji conversion processing on the client 1 side will be described in detail, assuming that the kana input of “Henko” shown in FIGS. Here, for convenience of explanation, each procedure in FIG. 2 is described in steps 1 to 10 (shown as “ST1” to “ST10” in the figure),
Each procedure in FIG. 3 is shown as steps 6-1 to 6-10.

First, when the user operates the keyboard on the client 1 side, step 1 in FIG. 4 becomes "YES", and the processing section 4 interprets the input contents by the key operation in the next step 2.

For example, when the first character "" of the pseudonym "" is input, both steps 3 and 9 become "NO", and the process proceeds to step 10;
Executes a process corresponding to this input, that is, a process of displaying a pseudonym corresponding to the operated key on the monitor screen, and then returns to step 1.

Thereafter, the above loop is repeated until the input of a series of character strings "he", "n", "ko" and "u" is completed. When the designated key is operated, step 9 is "YE
S ”, and the processing unit 4 proceeds to the conversion candidate acquisition processing in step 6.

Here, the detailed procedure of step 6 will be described with reference to FIG. First, the processing unit 4 executes step 6-1.
Then, the response time T obtained when the conversion candidate obtaining process was executed last time is checked. As described above, the response time T is the time required from the request of the conversion candidate to the server 2 to the actual acquisition of the conversion candidate, and the response time T in the immediately preceding process is a predetermined reference value. If it exceeds, the processing unit 4 sets the split transmission request flag to ON (steps 6-2 and 6-3).

Further, the processing unit 4 reads out the unacquired candidate number in the candidate buffer 6 and sets it in the packet, and further converts the pseudonym “Henko” to be converted into this packet.
And the division transmission request flag are set to complete the creation of the candidate request information (step 6-4).

[0036] Next processor 4 sends in step 6-5, then stored in the internal memory captures the current time t _0, the packets constituting the candidate request information in the subsequent step 6-6 to the server 2 I do.

In response to this transmission, when response information is returned from the server 2, step 6-7 becomes "YES", and the processing section 4 sets the completion time of the information reception to t in the next step 6-8. after standing with _r, updates the response time T by using the transmission time t ₀ of the candidate request information and the time t _r (step 6-9). The response time T is used at the time of the next conversion candidate acquisition process. After that, the processing unit 4 saves the content of the received response information in the candidate buffer 6 and ends the routine.

Returning to FIG. 4, when the conversion candidate corresponding to the input kana is thus obtained, the processing unit 4 displays a list of conversion candidates on the monitor screen based on the data stored in the candidate buffer 6. (Step 7).

Next, when the user selects one of the conversion candidates from the displayed candidate list and performs a confirming operation, both of steps 3 and 4 through steps 1 and 2 are "YES".
Becomes The processing unit 4 deletes the display of the candidate list from the screen in response to the determination, and then performs a predetermined process corresponding to the determination operation, that is, a process of displaying the determined conversion candidate at the kana input position on the monitor. Is executed (steps 8 and 10).

On the other hand, if the target conversion candidate does not exist in the displayed candidate list, the user executes an operation for calling another conversion candidate. In this case, step 4 is “NO”, step 5 is “YES”, and the process of step 6 is performed again. For example, when a conversion candidate read operation is performed in a state where the data shown in FIG. 2 is stored in the candidate buffer 6, in step 6-4, the unacquired candidate number is set to "3".
Is set, and candidate request information for requesting the conversion candidate of candidate number 3 or later is created.

FIG. 6 shows a response procedure on the server 2 side to the candidate request information from the client 1. In the first step A, the conversion processing section 9 extracts the contents of the candidate request information received from the client 1, and recognizes the data contents of the pseudonym to be converted, the unacquired candidate number, and the divided transmission request flag. At this time, if the division transmission request flag is set to ON, the next step B is “YES” and the process proceeds to step C, and the conversion processing unit 9 sets the conversion candidate corresponding to the conversion target kana The conversion candidates subsequent to the unacquired candidate number are extracted by the number corresponding to the information amount of the predetermined size. The amount of information extracted here is determined in advance based on the amount of information for one packet size used in the kana-kanji conversion system.

On the other hand, if the split transmission request flag is not set to ON, step B becomes “NO” and the process proceeds to step D, and among the conversion candidates corresponding to the kana to be converted, All conversion candidates after the candidate request number are extracted.

Each of the extracted conversion candidates is set in a packet constituting the response information, and the conversion processing unit 9 further sets the candidate number of the leading candidate among the remaining conversion candidates as an unacquired candidate number. It is set and set in the packet (step E). If all candidates after the unacquired candidate number have been extracted in step C, or if the process in step D has been performed, “−1” is set as the unacquired candidate number.

As described above, when the divided transmission request flag is set in the candidate request information, the response information for one packet, which is the minimum unit, is set when the divided transmission request flag is not set. , Response information of a size corresponding to the number of candidates after the unacquired candidate number is created. The created response information is transmitted to the candidate requesting client 1 via the transmission / reception unit 8 (step F).

According to the above communication method, the server 2
If many clients 1 are accessing
Since the server 2 creates and returns the minimum unit of response information from the conversion candidates for the conversion request information from each client 1, the processing time for each conversion request information and the load on the return processing to each client 1 are reduced. Reduced
Each client 1 can quickly obtain a conversion candidate for the input pseudonym. In addition, since a candidate having a high frequency of use is preferentially transmitted from among a plurality of conversion candidates corresponding to the pseudonym, the possibility that a target candidate is present in the first response information is extremely high, thereby improving efficiency. Good processing can be performed.

(2) Fuzzy Search System FIG. 7 shows a schematic configuration of a fuzzy search system according to the second embodiment. Client 1 of this system also
As in the first embodiment, each component such as an input unit 3, a processing unit 4, a transmission / reception unit 5, a candidate buffer 6, and an output unit 7 is included. The server 2 includes a data search unit 10 and the like in addition to the transmission / reception unit 8 for communication with the client 1.

When a predetermined search condition expression is input by operating the keyboard on the client 1 side, the processing unit 4
After recognizing the input contents, requests the server 2 to transmit data conforming to the search condition expression. The data search unit 10 of the server 2 is composed of a database system in which a knowledge group such as a membership function for fuzzy inference and a search object are filed, and performs an inference operation based on a search condition expression transmitted from the client 1. Then, a plurality of data meeting the search conditions is extracted as a user's selection target. In the following description, each data to be selected is referred to as a “selection candidate” or a “candidate” in order to correspond to the “conversion candidate” of the first embodiment.

The fuzzy search system of this embodiment also aims to obtain search results promptly even when a large number of clients 1 are accessing the server 2, as in the first embodiment. When making a candidate request to the server 2, if the response time to the previous candidate request information exceeds a predetermined reference value, the client 1 transmits the candidate request information with the divided transmission request flag set. In response to this information, the server 2 sequentially extracts, from the selection candidates obtained through the search, those having a high degree of conformity to the search condition expression up to a predetermined order, and creates response information. Return to original client 1. Client 1
The processing unit 4 stores the returned response information in the candidate buffer 6 and displays it on the monitor via the output unit 7.

FIG. 8 shows the response information to the candidate request information in which the division transmission request flag has been set.
In this example, each selected candidate and the degree of matching of the candidate with respect to the search condition expression are stored in association with the candidate number indicating the order of the degree of matching. In the illustrated example, the relevance of the search result in the server 2 is 1
This shows a state in which the three candidates at the third to third places have been transmitted and stored in the candidate buffer 6. Further, among the candidates not acquired by the client 1, candidate numbers corresponding to candidates to be acquired next (that is, candidates having the highest matching degree among candidates that have not been acquired) are stored as unacquired candidate numbers. .

FIG. 9 shows an example in which the contents stored in FIG. 8 are displayed on a monitor screen. The input window 11 for inputting a search condition expression and the contents of response information from the server 2 are displayed. Window 12, a first designation button 13 (hereinafter referred to as a "search button 13") for starting a search by the search condition expression, and a second designation button 13 for instructing reading of an unacquired candidate. Specify button 14
(Hereinafter, referred to as “continuation button 14”), message information 15 for notifying the user of the presence of an unacquired candidate, and the like are displayed. The continuation button 14 and the message information 15 are displayed only when there is an unacquired candidate.

FIG. 10 shows the contents stored in the candidate buffer 6 when response information including the remaining candidates is transmitted by operating the continuation button 14. This illustrated example shows a state in which all search results have been transmitted. In addition to the candidate data shown in FIG. 8, three more candidate data are added, and the unacquired candidate number is “−1”. Has been updated.

FIG. 11 shows a series of control procedures in the client 1. On the initial screen of the monitor, the input window 11 and the display window 12 are both set in a blank state. In this state, if the user inputs a search condition expression in the input window 11 and operates the search button 13, step 1 becomes "YES", and the processing unit 4 determines the content of this search condition expression in the next step 2. After the recognition, the retrieval result acquisition process of step 3 is executed.

FIG. 12 shows a detailed procedure of step 3 described above.
By executing the same procedure as that of Steps 6-1 to 6-10 (however, in Step 3-4, a search condition expression is set in the packet instead of the pseudonym), a response indicating the search result from the server 2 is returned. Get information.

Returning to FIG. 11, in the next step 4, the processing section 4 displays each candidate stored in the candidate buffer 6 in the display window 12 of the monitor, and further proceeds to step 5 in the subsequent step 5. The unacquired candidate number in the buffer 6 is checked to determine whether there is an unacquired candidate. When the determination is “YES”, the processing unit 4 displays the above-described continuation button 14, predetermined message information 15, and the like at a predetermined position on the monitor (step 6).

Next, when the displayed continuation button 14 is operated, step 7 becomes "YES", and the processing of step 3 is carried out again to obtain the remaining candidates. If the user ends the search process using an end key (not shown) or the like, step 8 is “YES” and the process ends.

In response to the candidate request information transmission processing in step 3-6, the server 2 executes a search by an inference operation using the search condition expression in the candidate request information and the knowledge group database, and the search is performed. The response information is created by extracting the candidates according to the division request flag. A series of processing procedures for creating and transmitting the response information is the same as the procedure in FIG. 6 of the first embodiment, and a detailed description is omitted here.

(3) Text Data Communication System Using WWW Browser FIG. 13 shows a schematic configuration of a text data communication system according to the third embodiment. In this system, the entire space in which the Internet network is deployed is actually a virtual server, and each client 1 who subscribes to the network has an address (URL) of another computer.
Is transmitted to the network to read out the text data held in the URL. Here, for the sake of simplicity, a computer provided with a predetermined URL is referred to as a server 2. The discussion will be limited to the relationship between the server 2 and one client 1.

The client 1 has the same configuration as in the first and second embodiments, and has an input unit 3 for receiving keyboard input, a processing unit 4 for performing a series of controls, and a communication unit for communicating with the server 2. And an output unit 7 for displaying transmission / reception contents on a monitor, a text buffer 16 for temporarily storing text data transmitted from the server 2, and the like. On the other hand, server 2
Includes a control unit 17 for holding a predetermined document file in addition to the transmission / reception unit 8.

When the user inputs the URL assigned to the server 2 on the client 1 side, the processing unit 4 recognizes the input contents and requests the transmission of the document held in the server 2 ( This is hereinafter referred to as "text request information"
) And send it out to the network. Upon receiving the text request information, the server 2 reads out a predetermined character string in the document file according to the content, creates response information, and returns this to the client 1.

In the text data communication system of this embodiment, when the information acquisition speed of each client 1 is slow, such as when the communication line is congested, the importance of each paragraph of the document specified by the client 1 is high. Data of a predetermined number of characters is preferentially extracted from the information at the head and transmitted.

FIG. 14 shows an example of the contents of a document file held by the server 2, in which character strings constituting each paragraph are stored as data logically separated by line feed codes 23. . The control unit 1
Numeral 7 identifies the beginning and end of each paragraph based on the line feed code, and an identification number (hereinafter referred to as a “paragraph number”) that is sequentially incremented as “0” for the first paragraph as information for identifying each paragraph.
Is set).

As in the first and second embodiments, the client 1 stores a response time for each transmission of the text request information, and the response time T exceeds a predetermined reference value. At this time, a split transmission request flag is set in the text request information to be transmitted next. When the divided transmission request flag is set in the received text request information, the control unit 17 of the server 2 extracts response data by extracting the text data for each paragraph in order from the head position by a predetermined number of characters. Is returned to the client 1. The number of characters extracted here is
It is determined in advance according to the size of the transmission packet on the server 2 side (in the following description, each paragraph has 18 characters).

The processing section 4 of the client 1 stores the contents of the response information in the text buffer 16 and displays the contents of the response information on the monitor screen via the output section 7, and reads the rest of the document by the user. When specified, the next text request information is sent.

FIG. 15 shows an example in which response information to the first text request information is stored.
In each of the paragraphs of the document shown in (1), text data indicating the 18th character from the beginning is stored in association with the paragraph number. Each of the data configurations shown in this illustrated example and FIGS. 17 and 19 below stores response information to the text request information in which the divided transmission request flag is set.

In the figure, the sent flag set in each paragraph indicates whether or not all text data constituting this paragraph has been transmitted. Set when the last character in the paragraph has been read. The unacquired character position is the character position to be read next (1 in the illustrated example) for the paragraph for which the sent flag is not set.
9th character).

FIG. 16 shows an example in which the stored contents of FIG. 15 are displayed on a monitor screen. An input window 18 for inputting a URL and a display window for displaying transmitted text data are shown. 19. A designation button 20 for executing transmission of text request information (hereinafter referred to as "execute button 20"), and a button 21 for designating additional transmission of text data of each paragraph (hereinafter referred to as "additional read button 21") In addition, a designation button 22 (hereinafter, referred to as “continuation button 22”) for transmitting all unacquired text data of the paragraph is displayed for each paragraph.

FIG. 17 shows the contents stored in the text buffer 16 based on the response information transmitted from the server 2 when the user operates the continuation button 22 for the first paragraph on the display screen of FIG. This shows the rewritten state. In this case, the first paragraph (paragraph number 0)
, All text data are stored, and the sent flag is set to ON. On the other hand, each data of the second and subsequent paragraphs (paragraph numbers 1 to 3) has the same configuration as in FIG.

FIG. 18 shows a state in which the stored contents of FIG. 17 are displayed on a monitor screen. The continuation button 22 and the execution button 20 for the first paragraph for which all the text data has been transmitted disappear. ing.

FIG. 19 shows the text buffer 1 based on the response information transmitted from the server 2 when the user operates the additional read button 21 on the display screen of FIG.
6 shows an example in which the storage content of No. 6 is rewritten. In this case, in the second to fourth paragraphs where an unacquired character exists, the first to 19th characters corresponding to the previous unacquired character position respectively.
The text data for eight characters is added, and the unacquired character position is updated to “37”.

FIG. 20 shows a state in which the stored contents of FIG. 19 are displayed on a monitor screen. The display contents of each of the second to fourth paragraphs have been changed to updated text data.

FIG. 21 shows a series of control procedures in the client 1. Hereinafter, a schematic procedure of text data acquisition processing in the client 1 will be described along the flow of FIG.

As in the second embodiment, on the initial screen of the monitor, the input window 18 and the display window 19 are both set to a blank state. In this state, the user enters the U
When the RL is input and the execution button is operated, step 1 becomes “YES”. Upon receiving this determination, the processing unit 4 recognizes the contents of the URL input in the next step 2 and then proceeds to step 3 to execute a process of acquiring text data for each paragraph.

When the detailed procedure described later is executed and the response information from the server 2 is stored in the text buffer 16, the processing unit 4 displays the acquired text data on the monitor screen in the following step 4. indicate. Thereafter, if the user operates the additional reading button 21, step 5 becomes "YES" and the process returns to step 3, where the unacquired text data for each paragraph is acquired. Is displayed on the monitor screen. If the user operates the continue button 22 of any paragraph, step 6 becomes “YES” and the process shifts to step 7 to perform processing of acquiring all text data for the specified paragraph. Thereafter, the process proceeds to the display process of step 4.

As a result of such processing being performed a plurality of times, if all of the sent flags of the respective paragraphs included in the response information from the server 2 are turned on, the processing unit 4 starts fetching all the data of the document. Recognize as completed. At this time, or when the user stops the reading process by operating an end key (not shown) or the like, step 8 is “YES”, and the series of processes ends.

FIG. 22 shows the detailed processing of step 3 in FIG. First, Step 3-1 to Step 3-3
As in the first and second embodiments, the processing unit 4 checks the immediately preceding response time T, and if the response time T exceeds a predetermined reference value, sets the divided transmission request flag to Set to ON.

Next, after reading the unacquired character position from the text buffer 16, the processing section 4 reads the associated paragraph number and sent flag for each paragraph, and divides the read data into divided transmission requests. The text request information is stored together with the flag and the URL in the packet constituting the text request information (step 3-4). If this process is the first transmission process, the text buffer 16 has been reset, and the process of storing the paragraph number and the transmission flag is cut off. In this case, by setting the unacquired character position to “0”, the server 2
Side can confirm that it is the first text request information.

When the text request information is created in this manner, the processing section 4 stores the current time t ₀ and transmits the text request information as in the first and second embodiments (step 3-5). 3-6). Further, when the processing unit 4 receives the response information to the transmission, the reception completion time t
After updating the response time T by said and _r time t _0, and updates the data in the text buffer 16 by using the response information received (step 3-7～3-10).

Next, the details of the processing in step 7 in FIG. 21 will be described with reference to FIG. First, step 7-1
Then, the processing unit 4 recognizes the paragraph number of the paragraph for which the operation of the continuation button 22 has been performed and the current unacquired character position, sets these recognition results together with the URL in a packet, and creates text request information. I do.

In the next step 7-2, the processing section 4 transmits the text request information. In response to this transmission, the server 2 extracts all data after the unacquired character position from the text data corresponding to the received paragraph number, creates response information, and returns it, as described later. By updating the text buffer 16 with this response information, all the text data for the designated paragraph is obtained as shown in FIG. 17 (steps 7-3, 7-4).

FIG. 24 is a flowchart showing Step 4 of FIG.
2 shows a detailed procedure of the display processing shown in FIG. Step 3
When the text buffer 16 is updated with the response information from the server 2 at -10 or step 7-4, the processing unit 4 first reads the text data of the first paragraph from the text buffer 16 and It is displayed above (steps 4-1 and 4-2).

Next, the processing section 4 checks the transmitted flag corresponding to the first paragraph. If this flag is not set, the processing section 4 sets the continuation button 22 near the display position of the text data. Display (Step 4
-3 to 4-4). When the processes in steps 4-1 to 4-4 are performed for all the paragraphs stored in the text buffer 16, step 4-5 returns "YES".
And the processing unit 4 checks whether or not there is a paragraph with the transmitted flag turned off. When this determination is "YES", the processing unit 4 displays an additional reading button at a predetermined position on the monitor screen (step 4-7).

FIG. 25 shows a processing procedure on the server 2 side for the text request information from the client 1 side.
Upon receiving the text request information from client 1,
First, the control unit 17 of the server 2 recognizes the request content of the client 1 from the data structure (step A).
If the unacquired character position of the text request information is “0”, or if there is data in which each paragraph number is associated with the transmitted flag, the control unit 17 determines in step B Then, it is determined that the text data is required, and the process proceeds to step C and subsequent steps. On the other hand, if the text request information includes the paragraph number of one of the paragraphs and the unacquired character position, the control unit 17 determines that only the text data corresponding to this paragraph number has been requested. Then, the processing after step N is executed.

When the determination in step B is "YES", the control unit 17 checks the divided transmission request flag of the text request information in the next step C, and if this flag is set, Moves to step D. In step D, the control unit 17 checks the sent flag associated with the first paragraph, and if it is off, then in step E, a predetermined number of characters from the unacquired character position in the text data of this paragraph Read the minute data. If up to the last character of the paragraph has been read out by this processing, step F becomes "NO", and the control section 17 sets the sent flag corresponding to this paragraph to ON (step G). .

Similarly, the processing in steps D to G is performed for the following paragraphs, and text data for a predetermined number of characters is read for each paragraph. In this case,
Steps E to G are skipped for the paragraph for which the sent flag is set to ON.

When the reading process for all the paragraphs is completed, step H becomes “YES”, and in the next step I, the control unit 17 updates the unacquired character position to a character position to be read next.

On the other hand, if the divided transmission request flag has not been set, step C becomes “NO” and the process shifts to step L. The control unit 17 determines this step L
After reading all text data after the unacquired character position for each paragraph for which the transmitted flag is not set, in the subsequent step M,
The sent flag of these paragraphs is set to ON, and the process proceeds to step J.

In step J, the unacquired character position, the transmitted flag for each paragraph, and the text data obtained through the processing of step DI or step LM are stored in a packet to generate response information. You. Further, in step K, the response information is transmitted to the client 1, and a series of processing ends.

On the other hand, if the client 1 has requested the text data of a specific paragraph, the control unit 17 determines in step N that the text data of the paragraph corresponding to the paragraph number included in the text request information is included. After reading all the data after the unacquired character position, in the next step O, the sent flag relating to this paragraph is set to ON. Then, in step P, when the read text data and the sent flag are stored in the packet to generate the response information, the process proceeds to step K, and the transmission process of the response information is performed.

The above embodiment is not limited to a system in the Internet, but can be applied to a client server system similar to the first and second embodiments. In each of these embodiments, the client 1 holds a response time from the information request to the server 2 to the acquisition of information, and when it is determined that the response time is long, the client 1 transmits the divided information at the time of the next information request. The request flag is set and transmitted to the server 2 side. However, the present invention is not limited to this.
The side may determine the length of time. Instead of using the response time as an index, the server 2 monitors the number of clients 1 being accessed, the number of cases being processed, and the like. When these values exceed a predetermined reference value, May be configured to extract and transmit information having a high level.

[0090]

According to the first, seventh and eleventh aspects of the present invention, when the server holding the database receives the request information from the client, the processing required from the transmission of the request information by the client to the obtaining of the search result. If it is determined that the time will be longer, elements up to a certain priority from among the search results for the request information are transmitted to the client, so that the client can search for a higher priority search in a shorter time than when all search results are received. The result can be obtained, and efficient processing can be performed even when the communication line is congested.

According to the second, eighth, and twelfth aspects of the present invention, in a server holding a dictionary for kana-kanji conversion processing as a database, when a conversion candidate for a kana to be converted is transmitted from a client, If it is determined that the processing time is long, conversion candidates up to a predetermined priority based on the frequency of use are extracted and transmitted. Therefore, even at the time of communication line congestion, the client side selects conversion candidates that are likely to be selected by the user even when communication lines are congested. The kana-kanji conversion process can be performed quickly and efficiently.

According to the third, ninth, and thirteenth aspects of the present invention, when it is determined that the processing time on the client side is long when transmitting a search result according to the search formula transmitted from the client,
Since the elements up to a predetermined priority based on the degree of conformity with the search condition are extracted and transmitted, the client can quickly acquire data having high degree of conformity with the search condition even when the communication line is congested, and transmit the data. Can be provided.

According to the fourth, tenth and fourteenth aspects of the present invention, when it is determined that the processing time on the client side is long when transmitting text data corresponding to the designated information transmitted from the client, each of the text data constituting Of the characters, the characters up to a predetermined priority based on the position from the beginning of the text are extracted and transmitted, so that the client can quickly obtain data of high importance even when the communication line is congested. Can be provided to the user.

According to the fifth and fifteenth aspects of the present invention, the server determines whether or not the processing time is long using the identification information generated on the client side. , Appropriate communication control can be performed.

According to the present invention, when the same request information is transmitted again from the client which has obtained the retrieval result extracted preferentially, the element having the priority higher than the previous priority is transmitted. Accordingly, all search results can be transmitted step by step as needed on the client side.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a schematic configuration of a kana-kanji conversion system according to a first embodiment of the present invention.

FIG. 2 is an explanatory diagram showing storage contents of a candidate buffer.

FIG. 3 is an explanatory diagram showing updated storage contents of a candidate buffer.

FIG. 4 is a flowchart showing a control procedure on the client side.

FIG. 5 is a flowchart showing a detailed procedure of step 6 in FIG. 4;

FIG. 6 is a flowchart illustrating a processing procedure on the server side for candidate request information from a client.

FIG. 7 is a block diagram illustrating a schematic configuration of a fuzzy search system according to a second embodiment;

FIG. 8 is an explanatory diagram showing storage contents of a candidate buffer.

FIG. 9 is an explanatory diagram showing a state in which the storage contents of FIG. 8 are displayed on a monitor.

FIG. 10 is an explanatory diagram showing updated storage contents of a candidate buffer.

FIG. 11 is a flowchart illustrating a control procedure on the client side.

FIG. 12 is a flowchart showing a detailed procedure of step 3 in FIG. 11;

FIG. 13 is a block diagram illustrating a schematic configuration of a text data communication system according to a third example.

FIG. 14 is an explanatory diagram showing the contents of text data.

FIG. 15 is an explanatory diagram showing storage contents of a text buffer.

FIG. 16 is an explanatory diagram showing a state in which the storage contents of FIG. 15 are displayed on a monitor.

FIG. 17 is an explanatory diagram showing updated storage contents of a text buffer.

18 is an explanatory diagram showing a state in which the storage contents of FIG. 17 are displayed on a monitor.

FIG. 19 is an explanatory diagram showing updated storage contents of a text buffer.

20 is an explanatory diagram showing a state in which the storage contents of FIG. 19 are displayed on a monitor.

FIG. 21 is a flowchart showing a control procedure on the client side.

FIG. 22 is a flowchart showing a detailed procedure of step 3 in FIG. 21.

FIG. 23 is a flowchart showing a detailed procedure of step 7 in FIG. 21.

FIG. 24 is a flowchart showing a detailed procedure of step 4 in FIG. 21.

FIG. 25 is a flowchart showing a processing procedure on the server side for text request information.

[Explanation of symbols]

 Reference Signs List 1 client 2 server 3 processing unit 9 conversion processing unit 10 data search unit 17 control unit

Claims (16)

[Claims] 1. A communication control method for, when a server holding a database receives request information for specifying information to be extracted from the database from a client, returning a search result corresponding to the request information to the client. In the above, it is determined whether or not the processing time required from the transmission of the request information by the client to obtaining the search result is long, and when it is determined that the processing time is long, a predetermined standard among the elements constituting the search result is used. A communication control method comprising: transmitting, to the client, elements up to a priority based on the communication priority. 2. The database stores a plurality of kana in association with kanji of a conversion candidate, the request information is a kana to be converted, and the priority order is a use frequency of a conversion candidate for the kana. The communication control method according to claim 1, wherein: 3. The communication control method according to claim 1, wherein the request information is a search formula indicating a predetermined search condition, and the criterion of the priority is a degree of conformity to the search condition. 4. The database stores a plurality of text data each having important information at a leading portion, wherein the request information is information for instructing reading of predetermined text data, The communication control method according to claim 1, wherein is a position of each character constituting the text data as viewed from the leading portion. 5. The client transmits identification information indicating whether or not the processing time exceeds a predetermined reference value to a server, and the determination as to whether or not the processing time is longer is made by a previous determination from the client. 2. The communication control method according to claim 1, wherein the communication control method is performed using identification information corresponding to the request information. 6. The communication control method according to claim 1, wherein, when the same request information is received again from the client after transmitting the elements up to the priority, the elements related to the priority after the priority are transmitted. Communication control method sent to the client. 7. A database, receiving means for receiving request information for specifying information to be extracted from the database from a client, and searching for searching the database using the request information received by the receiving means. Means, determining means for determining a state of a processing time required from transmission of the request information by the client to obtaining a search result, and configuring the search result by the search means according to the determination result of the determiner A server system comprising: extracting means for extracting elements from each element up to a priority based on a predetermined criterion; and transmitting means for transmitting each element extracted by the extracting means to a client. 8. The database stores a plurality of kana in association with kanji of conversion candidates, the request information is a kana to be converted, and the priority order is used among conversion candidates for the kana. The server system according to claim 7, wherein the server system is a frequency. 9. The server system according to claim 7, wherein the request information is a search formula indicating a predetermined search condition, and the criterion of the priority is a degree of conformity to the search condition. 10. The database stores a plurality of text data each having important information at a leading portion, wherein the request information is information for instructing reading of predetermined text data, 8. The server system according to claim 7, wherein is a position of each of the characters constituting the text data as viewed from the leading portion. 11. A communication system comprising a server holding a database and a client, wherein the client includes a transmission unit for transmitting request information for specifying information to be retrieved from the database to the server, wherein the server is A search unit that searches the database using request information transmitted from a client; a determination unit that determines a state of a processing time required from transmission of the request information by the client to obtaining a search result; Extracting means for extracting elements up to a priority based on a predetermined criterion from each of the elements constituting the search result by the searching means in accordance with the determination result of the means; and transmitting each element extracted by the extracting means to the client. A communication system using a database, comprising: 12. The database stores a plurality of kana in association with kanji of conversion candidates, the request information is a kana to be converted, and the priority order is used among conversion candidates for the kana. The communication system using a database according to claim 11, which is a frequency. 13. The communication system using a database according to claim 11, wherein the request information is a search expression indicating a predetermined search condition, and the criterion of the priority is a degree of conformity to the search condition. 14. The database stores a plurality of text data each having important information at a leading portion, wherein the request information is information for instructing reading of predetermined text data, 12. The communication system using a database according to claim 11, wherein is a position of each character constituting the text data as viewed from the leading portion. 15. The transmitting means of the client transmits, together with the request information, identification information indicating whether or not a processing time for the previous request information has exceeded a predetermined reference value. 2. The state of the processing time is determined using identification information from the client.
2. A communication system using the database according to 1. 16. The client further comprises a re-requesting unit for transmitting the request information again when receiving each element extracted by the extracting unit from the server, wherein the server re-transmits the request information from the client. 12. The communication system using a database according to claim 11, further comprising: a retransmitting unit that extracts and transmits, in response to a request, an element having a priority order higher than the priority order among the elements configuring the search result. .