[0041] The following describes the embodiments of the present invention with reference to the drawings. For the convenience of description, the Internet user who initiated the search is referred to as the searcher, and the Internet user who is searched is referred to as the relevant user. The existing search engine for searching web pages or other content is called a search engine, and the embodiment of the present invention is called a user mutual search system (or simply this system).
[0042] figure 1 Represents the operating environment 10 of an embodiment of the user mutual search system. As shown in the figure, the operating environment 10 may include one or several computing devices 11, which may include some personal computers. Each computing device 11 can be connected to the network 12. The network 12 generally includes one or several interconnected sub-networks, and these networks 12 may include one or several local area networks (LAN) and/or wide area networks (WAN). A web server 13 is connected to the network 12, and the web server 13 operates users to search for a system each other. The operating environment of the present invention can be any network similar to this existing or in the future.
[0043]The user mutual search system is a system software running on an application server. Its communication with the outside world can be accomplished through, for example, but not limited to, the standard http protocol. Searchers can access the user interaction through a browser or special search client software. Search system. The searcher can fill in the search keywords and submit. The search keyword input by the user may also be a search keyword obtained by the user's mutual search system through the data interface provided by the search engine when the user uses other search engines to search when the keyword is input.
[0044] first step
[0045] First of all, Internet users submit basic user information to the user information management system through the user interface, obtain the unique identification assigned by the system, and save it to the database, for reference figure 2. Then, the searcher logs in with the unique identification provided by the system, and after the user management system authentication is passed, the searcher enters the user mutual search system, which can be referred to image 3.
[0046] Second step
[0047] For example: User A and User B want to find someone who is looking for a house to rent. User C and user D hope to find a renter. User A enters the user mutual search system and enters the keyword through the client: house
[0048] third step
[0049] The retrieval system responds to the searcher's search request, accepts the search keywords submitted by the searcher, and then starts the search. The system is a database-based retrieval system, which can be implemented in many ways. We can use the combination of JSP, PHP, ASP and JDBC or ODBC to realize retrieval, or we can develop special software to retrieve.
[0050] When the retrieval system receives the search keyword submitted by the searcher, it finds all user information matching this keyword in the user information database according to the keyword matching rules set by the system.
[0051] In this example, user A is the first user to search with "house" as a keyword, so the search results he gets have no information about other users. However, the keyword "house" and search time used by user A are stored in the user information database as the user's search record. The user can set the keywords used when searching, whether to save them in the database as their search records, or modify or delete search keywords that are no longer of interest through the user interface.
[0052] In addition, let’s assume that user A then uses "rental" to search; then user B uses "rental" and then "house" to search; then user C uses "rental" and then "house" to search;
[0053] the fourth step
[0054] User D: After registering and logging in through the same steps as user A, enter: house through the user interface of the user mutual search system. The user retrieval system responds to user D's request, accepts keywords submitted by the user, and then searches.
[0055] When the retrieval system receives the search keyword submitted by the searcher, it finds all user information matching this keyword in the user information database (ie users with related search records) according to the keyword matching rules set by the system. The relevant content of these user information is the core content of the search results. The core content of the search results includes: the user's unique identity in the system, related search records and contact information, etc. After obtaining the core contents of the search results, the retrieval system sends these contents to the sorting system through the network for processing.
[0056] In this example, the information of user A, user B, and user C is the core content of the search result.
[0057] the fifth step
[0058] The ranking system obtains the core content of the search results provided by the retrieval system, and analyzes the time when the user uses the keyword "house" to search for ranking. The sorting rules of the sorting system are: the ones with the earlier search time are ranked behind, and the ones with the later search time are ranked first. In this example, the order given by the ordering system is:
[0059] 1. User C:
[0060] Username: C
[0061] Mutual keywords: houses
[0062] Search time: 5:3:3 on March 3, 2006
[0063] contact details:…
[0064] 2. User B:
[0065] Username: B
[0066] Mutual keywords: houses
[0067] Search time: 4:3:3 on March 3, 2006
[0068] contact details:…
[0069] 3. User A:
[0070] Username: A
[0071] Mutual keywords: houses
[0072] Search time: March 3, 2006 3:3:3
[0073] contact details:…
[0074] Sixth step
[0075] The result generation system is an automatic result generation program, which runs on the application server connected to other systems, integrates the core content of the search results according to the order given by the sorting system according to the preset format template, and submits them to the searcher . Can refer to Figure 4 with Figure 5.
[0076] At this time, user D can still search again, that is, enter a new keyword in the last search result to search, he can repeat the fourth step, but this time the specified search range is performed in the last search result. For example, if he enters "rental" to search, it will find the information of user A and user B (assuming that the system sets the keyword "rental" as a matching keyword of "rental").
[0077] The above is a situation where the keywords are the same match (house and house). Below we assume that user D repeats the fourth step, but this time enters "rental" to search. Assuming that the system sets the keyword "rent" as a matching keyword of "seeking rent", then user D will find the information of user A and user B. Instead of looking for user C.
[0078] Also for synonymous matching, below we assume that user D repeats the fourth step, but this time enters "real estate" to search. Assuming that the system sets the keyword "real estate" as a synonymous matching keyword of "house", then user D will find the information of user A, user B, and user C.
[0079] As an improved embodiment, the searcher can also set the sent search request through the user interface to be a function of identical matching search, synonymous matching search or matching matching search. In the above example, if user D chooses to perform the same search when he enters the keyword "rent" to search, he will get the information of user C instead of user A and user B. Similarly, if user D chooses to perform a matching search when he enters the keyword "rent" to search, he will get the information of user A and user B instead of user C.
[0080] As an improved embodiment, in addition to the search keywords and search time, the user's search record may also include related information such as the IP used for the search, so that the system can match users according to the proximity principle (IP proximity).
[0081] As an improved embodiment, the system can automatically match users based on search records between users, and notify related users when the user is online (in the case of instant messaging) or when the user logs in. For example, in the above example, the system can automatically discover that the matching users of user A include user C and user D, and so on.
[0082] An embodiment of the present invention can be used as a plug-in program or a separate running program combined with an instant messaging tool. An instant messaging user can quickly find other users who have the same topic as himself through the user search system, and conduct an instant communication process. in Figure 6 In the example, instant messaging user A can find instant messaging user B through the user’s mutual search system in the instant messaging system and enter a suitable keyword (assuming that even if user B has used it before, the search key related to this keyword To search for words, and vice versa.), and invite each other through the instant messaging system. Can refer to Figure 6.
[0083] An embodiment of the present invention can be used as a plug-in program or a stand-alone program in combination with other search engines to realize a "famous" search engine. That is, the user needs to log in before using the search engine. When the search engine obtains the search keyword (for example, house) submitted by the search engine user A, it executes the search function and finds the corresponding information (for example, webpage, etc.) in the system. At the same time, the search engine user A uses The search keywords are submitted to the user’s mutual search system to perform a search of related user information, and finally the search results (for example, web pages and related user information) are submitted to the search engine user A (assuming, before that, the search engine user B Used the word "house" to search). In this way, the search engine user A can search for other users who have related interests (search records) while searching for information (webpages, etc.). Can refer to Figure 7.
[0084] Figure 8 It means that an embodiment of the present invention can be used as a stand-alone program to obtain search keywords entered by users through data interfaces provided by other search engines, and then search for other users with related search records. The search engine C and the search engine D can be the same search engine or different search engines. Suppose, in the figure, both user A and user B have successfully logged in to the system, user A uses search engine C to search for "house", then user B uses search engine D to search for "house", and suppose that both search engine C and search engine D provide The data interface is provided to the system. Then when user A uses a search engine to search for "house", the system can obtain the search keyword "house" submitted by user A, and save it in the user information database as a search record of user A. After that, when user B searches for "house" through search engine D, the system can obtain the keyword "house" submitted by user B and save it in the user information database as a search record of user B. At the same time, the system will find user A's information through the search system and submit it to user B. Vice versa, user A can also find user B. In this way, users using various search engines can search for each other and establish contact.
