A co-presence data retrieval system

[0001] [Industrial application field] The present invention generally relates to a data retrieval system. In particular, the present invention relates to a data search system having a coexistence function (coexistence data search system). [0002] [Conventional technology] Data retrieval systems are well known in the field. A typical data retrieval system is shown in Figure 1. With reference to FIG. 1, it can be seen that the data search system is usually composed of a data server 10 and a plurality of data search clients 12. The data retrieval client 12 is usually an individual computer. By the command of the data search client 12, the data server 10 accesses the data storage unit (or database) 14 that stores the data object 16. The data object 16 is usually an information file. Information exchange (communication) between the data search client and the user 17 is usually performed through the display 18. [0003] The operation of a normal data search will be described with reference to FIG. Upon receiving a search command (arrow 1) for a data object 16 from user 17, the data search client 12 sends a request to the data server 10 (arrow 2). The data server 10 searches the requested data object 16 from the data storage unit 14 (arrow 3), and sends the data object 16 to the data search client 12 (arrow 4). [0004] An additional feature built into the data retrieval system is the data management feature. With this function, the data retrieval client 12 generates a new data object 16, modifies the retrieved data object 16, and sends the generated or modified data object 16 back to the data server 10 for data storage. It can be stored in part 14. An additional feature is the allow function, which allows the data server 10 to accept or reject client requests. [0005] Examples of data retrieval systems (some of which are the additional features mentioned above) include File Transfer Protocol (FTP), Hypertext Protocol (HTTP), Gopher and Network File System (NFS) standards, Relational database management created by Network News Service (NNTP), DEC Notes from Digital Electric Corporation, Lotus Notes from Lotus Inc., Novell NetWare from Novell Inc., and Oracle, Sybase, Infomix, etc. There is a system and so on. [0006] [Problems to be Solved by the Invention] An object of the present invention is to provide a data retrieval system having a coexistence function. As a result, two or more users who access the same data object at the same time can notice each other's existence and exchange information with each other in real time. According to this data retrieval system, a user who accesses a document can discuss the document in real time with another user who is accessing the same document at the same time. [0007] "Co-presence" is a feature that allows two or more users to "exist" in one "virtual place". For example, the University of Illinois the National Center for Supercomputing Developed by Applications, "COLLAGE" is a client-server package that helps coexist on a shared whiteboard. Users copy data objects from a data server to an existing "COLLAGE session" and this Manipulate data objects in a COLLAGE session. Other users can also work with the same data objects by joining this COLLAGE session. However, to join a session, the location where the COLLAGE session is open You need to know in advance. [0008] The Internet Relay Chat allows real-time, Internet-wide, multi-party, text-based interaction to and from virtual channels open to specific topics. Can be done. [0009] MUDs (Multiple-User) that multiple people can participate in The game Dungeons) is one of the multiplayer participatory games, which provides the concept of interconnected places, where each place has a passageway leading to objects and other places. Players can move from one location to another, contacting "coexisting" players with each other and dealing with objects at that location. [0010] These coexistence systems provide a virtual place where people can exchange information. However, the coexistence provided by such a coexistence system is not related to the data. That is, it is not formed by changing the data object. The present invention provides this. [0011] [Means to achieve the task] According to a preferred embodiment of the present invention, there is provided a data retrieval system including a data server for retrieving a data object from a data storage unit and an associating means for correlating the retrieved data object with a virtual location. This virtual location allows users accessing the retrieved data objects to co-exist with each other. [0012] Further, according to one of the preferred embodiments of the present invention, the associating means includes a coexistence server and at least two coexistence data retrieval clients capable of exchanging information with the data server and the coexistence server. A coexistence server contains at least one virtual location associated with one of the data objects. The coexistence data search client includes object-related means and coexistence means. Object-related means associate the data object received from the data server with one of the virtual locations in the coexistence server. The coexistence means enables information exchange with other users related to this associated virtual location. [0013] Alternatively, in a second preferred embodiment of the invention, the associating means also includes a coexistence server and at least two coexistence data retrieval clients, but in this embodiment the coexistence server exchanges information with the data server. The coexistence data search client exchanges information only with the coexistence server. The coexistence data search client has an object-related means and a coexistence means, and the object-related means works to associate the data object received from the coexistence server with one of the virtual places in the coexistence server, and the coexistence means is the associated virtual. Allows information exchange with other users related to the location. [0014] In any of the preferred embodiments of the present invention, the coexistence server is a changing plurality of place processes that are variable so that there is one for each virtual location, and a coexistence data retrieval client. It may also include a management process to provide communication from the location process. [0015] Further, in any of the preferred embodiments of the present invention, the object association means may include means for moving to a new virtual location. [0016] Finally, according to a third preferred embodiment of the present invention, a data search system including a data server capable of searching data objects from a data storage unit and a plurality of data search clients is upgraded to coexist data search system. A way to do this is provided. This method involves a) adding a coexistence server that contains at least one virtual location associated with one of the data objects, and b) upgrading at least two data retrieval clients by adding the following features: :: [0017] Ability to open individual communication channels associated with coexistence servers; Ability to map retrieved data objects to virtual locations; Ability to display coexistence information; A function that enables information exchange between users; A function to notify the coexistence server when the data search client is terminated. [0018] [Action] With the above-mentioned coexistence data search system, users who are accessing the searched data object at the same time can coexist with each other and exchange information in real time. [0019] The present invention will be understood in more detail by the following examples and the accompanying drawings. [0020] [Example] First, see FIGS. 3 and 4. 3 and 4 illustrate the data retrieval system according to the present invention. The system according to the present invention usually includes a data server 10 and a data storage unit 14, as in the prior art. Further, the system includes a coexistence server 20 and a plurality of coexistence data retrieval clients 22 according to preferred embodiments of the present invention. Each coexistence data retrieval client 22 can exchange information with the data server 10, the coexistence server 20, and the user 17 (through display 18). [0021] [0021] As in the prior art, each data search client 22 requests the data object 16 via the data server 10, and the data server 10 searches for the data object 16 requested by the data storage unit 14. At the same time, according to the preferred embodiment of the present invention, the coexistence data search client 22 also notifies the coexistence server 20 of the information that the search for the specific data object 16 (for example, the data object 16a) has been performed. Accordingly, the coexistence server 20 adds the data search client 22 to the virtual location 24 associated with the searched data object 16a. Client 22 associates the retrieved data objects 16a ~ 16c with virtual locations 24a ~ 24c. [0022] To clarify the discussion, let's assume that the coexistence server 20 manages a virtual location 24 for each of the data objects 16 stored on the data server 10. As will be appreciated, the coexistence server 20 can create a virtual location 24 upon request when the first user appears in the data object 16 and can erase the virtual location 24 when no one is gone. [0023] All users who access the data object 16 through the data search client 22 are added to the virtual location 24 associated with the accessing data object 16. Further, the coexistence server 20 provides an inter-user communication function for each virtual location 24, whereby the user who accesses the data object 16 is using the same data object 16 at that time if he / she so desires. Information can be exchanged with other users. The coexistence server 20 allows the user 17 existing in the data object 16 to be aware of the existence of other coexisting users, and is provided with a means for exchanging information with other users in real time. The information exchange between the users 17 can also be a client-client information exchange when the information exchange via the coexistence server 20 is slow. [0024] The key to coexistence server 20 is to turn each data object into a virtual location, where users 17 can work together to view, modify, or discuss the data objects. be able to. For example, suppose data server 10 contains multiple manuals for a product. At that time, it would be convenient for the product vendor to have a manual advisor in one (or multiple) virtual locations. By doing so, this advisor can assist the user who refers to the manual when he / she wants to know more in-depth content or when he / she does not know what to do after reading the document. [0025] The coexistence server 20 and the coexistence data retrieval client 22 follow the coexistence protocol, which is illustrated by arrows 31 to 38 in FIG. [0026] The user 17 searches for the data object 16d from the data server 10 according to the protocol described in the prior art (arrows 31 to 35, the same as arrows 1 to 5 in FIG. 2). At the same time, the coexistence data search client 22 sends a message to the virtual location 24d associated with the data object 16d in the coexistence server 20 that user 17 has accessed the data object 16d (arrow 36). (Usually, the data object 16 has a well-defined name in the data server 10. The client 22 identifies the corresponding virtual location 24 with the same or corresponding name.) The virtual location 24d , Add the user to the list of coexisting users (37 steps) and send the message to all coexisting users, including the user who entered the virtual location 24d. [0027] If the user 17 in the data object 16 wants to selectively send a message to one of the coexisting users 17, the first user 17 goes through the coexisting data retrieval client 22 and the coexisting server 20 to the associated virtual location 24. Send a message to. At virtual location 24, the message is relayed to selected user 17 in data object 16. [0028] When user 17 leaves data object 16 (due to searching for another data object 16 from the same or other data server 10 or closing the coexisting data search client 22), the coexisting data search client 22 , Send a message informing it to virtual location 24 (arrow 36). In response to this, the virtual location 24 deletes the user 17 from the list of coexisting users and sends a message to all the remaining coexisting users 17 to inform them of this. [0029] The coexistence protocol is described with respect to the functions performed by the coexistence data retrieval client 22 and the functions executed by the coexistence server 20 and the virtual location 24. The pseudo code of each function is shown below. [0030] First, assuming that the user U has already received the document D1 from the server S1, the pseudo code in the client 22 of the user U is shown below. [0031] When user U requests document D2 from server S2: 1. Try to search document D2 from server S2. 2. If the search is successful, the message "U left to virtual location P (D2) on server S2" is sent to virtual location P (D1) in coexistence server C (S1) corresponding to document D1. send. [0032] When user U requests to state the text T: Send the message "U said T" to the coexistence server C (S2). [0033] When receiving the message "User V entered (or left at virtual location P (Dj)) from virtual location P (Dj) in the server Sk": At that time, the list of users in the virtual place is displayed to the user U. [0034] When you receive the message "V said T": Display the message "V said T" to user U. [0035] Next, the set of coexisting users is CP, and the pseudo code at the virtual location P (Di) on the coexisting server C (Si) is shown below. [0036] When receiving the message "U left to virtual location P (Dj) in server Sk": 1. Delete user U from the set CP of coexisting users. 2. Send the message "U has left to the virtual location P (Dj) in the server Sk" to all the remaining user Vs in the CP. [0037] When receiving the message "U came in from virtual location P (Dj) in server Sk": 1. Add user U to the set CP of coexisting users. 2. Set of coexisting users Send the message "U came in from the virtual location P (Dj) in the server Sk" to all the users V in the CP. [0038] When you receive the message "U said T": Send the message "U said T" to all users in the set CP of coexisting users. [0039] The coexistence server 20 may be incorporated into the system in any way to achieve coexistence. In one embodiment, the coexistence server 20 is embedded as a Unix process that runs a concurrent programming language called flat concurrent Prolog (FCP). As stated in U.S. Pat. No. 5,222,221 granted to Houri et al. (By reference here, it should be part of this application), the FCP internal light-weight process. By using mechanism), each virtual location 24 can be incorporated as a place process, each formed as a collection of FCP processes. Each FCP process follows the coexistence protocol described above. [0040] The coexistence server 20 receives a message on a port registered in advance, known, and whose identity is registered in the coexistence data search client. The coexistence server 20 normally receives messages from the coexistence data search client 22 and propagates those messages to the appropriate virtual location 24. In addition, upon request, the Unix management process (coexistence server 20) can spawn a featherweight process (virtual location 24) whenever the first user accesses data object 16. You can also kill a process whenever the user stops coexisting with the associated virtual location 24. [0041] As is understood, since the information exchange function with the coexistence server 20 is independent of the data search function, the data search system according to the present invention can operate together with the standard data search client 12 having no coexistence function. It is possible. [0042] As will be further understood, the data retrieval system according to the present invention can be easily constructed from existing conventional data retrieval systems. This upgrade method from the existing system includes the process of adding the coexistence server 20 as described above and the process of upgrading the data search client 12 to become the coexistence data search client 22. The data search client 12 is upgraded by adding the following functions. [0043] a) Ability to open an additional communication channel with coexistence server 20, b) Ability to map data object 16 to virtual location 24, c) Ability to display coexistence information, d) Functions to enable real-time communication between users 17, e) Ability to notify the coexistence server 20 when client 22 terminates or closes. [0044] As will be appreciated, data retrieval clients that have not been upgraded can also function within the coexistence data retrieval system shown in Figures 3 and 4. [0045] Next, see Figure 5. FIG. 5 is a diagram for explaining another embodiment of the present invention. In this example, the data retrieval system contains the same components as in the previous example, but the elements are combined differently. More specifically, this data retrieval system includes a coexistence data retrieval client 40 and a coexistence data retrieval server 42, and also includes a data server 10 and a data storage unit 14 as in the prior art. [0046] In this other embodiment, the coexistence data search client 40 exchanges information only with the coexistence data search server 42. That is, it requests a data search or sends a message necessary for coexistence to the coexistence data search server. Upon receiving the request, the coexistence data search server 42 transmits them to the data server 10. The coexistence data search server 42 includes a virtual location 44. There may be a plurality of servers 42, each of which handles a data search request to the associated data server 10. [0047] Below is the pseudo code that represents the protocol between client 40 and server 42. [0048] First, assuming that the user U has the document D1 in the server S1, the pseudo code in the client 40 of the user U is shown below. [0049] When user U requests document D2 from server S2: 1. Send the message "U requests entry from location P (D1) in server S1" to location P (D2) in coexistence server C (S2). 2. If the search is successful, send the message "U left to virtual location D2 on server S2" to virtual location P (D1) in coexisting server C (S1). [0050] When user U requests to state the text T: Send the message "U said T" to the coexistence server C (S2). [0051] When receiving the message "V entered from virtual location P (Dj) in server Si (or left to virtual location P (Dj)": At that time, the list of coexisting users in the virtual place P (Dj) is displayed to the user U. [0052] When you receive the message "V said T": Display the message from user V to user U. [0053] Next, the set of coexisting users is CP, and the pseudo code at the virtual location P (Di) on the coexisting server C (Si) is shown below. [0054] When receiving the message "U left to virtual location P (Dj) in server Sk": 1. Delete user U from the set CP of coexisting users. 2. Send the message "U has left to the virtual location P (Dj) in the server Sk" to all the remaining user Vs in the CP. [0055] When receiving the message "U requests entry from virtual location P (Dj) in server Sk": 1. Try to search data from data server 10. 2. If the data search is successful: Send data to client 42 of user U. b. Add user U to the set CP of coexisting users. c. Set of coexisting users Send the message "U came in from the virtual location P (Dj) in the server Sk" to all the users V in the CP. [0056] When you receive the message "U said T": Send the message "U said T" to all users in the set CP of coexisting users. [0057] As will be appreciated by those skilled in the art, the invention is not limited to what has been exemplified and stated above. The scope of the present invention is defined by the claims. [Simple explanation of drawings] FIG. 1 is a conceptual diagram of a conventional data search system. FIG. 2 is a conceptual diagram for explaining one of the conventional data search operations. FIG. 3 is a conceptual diagram of a data retrieval system including a coexistence server configured and operating according to a first preferred embodiment of the present invention. FIG. 4 is a conceptual diagram illustrating a coexistence data search operation. FIG. 5 is a conceptual diagram illustrating another embodiment of the coexistence data retrieval system and its operation. [Explanation of symbols] 1 Arrow to explain data search operation 2 Arrows to explain data search operation 3 Arrows to explain data search operation 4 Arrows to explain data search operation 5 Arrows to describe data retrieval behavior 10 data server 12 Data search client 16 Data object 16a One of the data objects 16b One of the data objects One of the 16c data objects One of the 16d data objects 17 users 18 display 20 Coexistence server 22 Coexistence data search client 24 virtual places 24a One of the virtual places 24b One of the virtual places 24c One of the virtual places One of the 24d virtual locations 31 Arrow to explain coexistence protocol 32 Arrows to describe coexistence protocols 33 Arrows to describe coexistence protocols 34 Arrows to describe coexistence protocols 35 Arrows to describe coexistence protocols 36 Arrow to explain coexistence protocol 37 Arrow to explain coexistence protocol 38 Arrow to explain coexistence protocol 40 Coexistence data search client 42 Coexistence data search server 44 virtual location