KR101355639B1 - Method and system for introducing and making friend - Google Patents

Abstract

The present invention relates to a method of introducing friends and making friends and a system therefor that can form new connections with other users within a limited range using a relationship-based network. According to an embodiment of the present invention, the first user may receive state information indicating one of a plurality of different levels of states from the first user and a second user who is in a friend relationship with the first user, respectively, and receive the received state information. Based on the third user's status as a public or private state of the first user, a friend of the second user, and having a serial connection with the first user with the second user as an intermediary; For at least one of a user and a fourth user who is a friend of the third user and has a serial connection with the first user using the second user and the third user as an intermediary, determined for the second user of the first user Register the first user to the introduction pool according to the status. According to this, since the range of users who can form a network is determined by reflecting both the intentions of the users who want to make friends and the intentions of intermediaries, there is an advantage that reliable meeting is possible.

Description

How to introduce friends and make friends, and a system for them {METHOD AND SYSTEM FOR INTRODUCING AND MAKING FRIEND}

The present invention relates to a friend introduction method and a friend making method and a system therefor, and more particularly, a friend introduction method and a friend making method for forming a new network with other users within a limited range using a relationship-based network. And a system therefor.

As disclosed in Korean Patent Laid-Open Publication No. 10-2007-0042044, a conventional friend making service is intended to form a network by a user who wants to form a new network, uploads his or her personal profile information, and browses other's personal information. It proceeds by searching for the other party.

However, since such personal information is exposed to others unrelated to the user, the service is likely to be misused for purposes other than the original service purpose, and the reliability of the personal information entered by each user is low. Therefore, there was a problem that it is difficult to form a reliable network with each other. In addition, there was no room for third-party involvement between the two users who were friends, so they could not get help or advice from others in the process of forming a network.

Furthermore, in the process of making friends offline, the opinions of the relationship between two people of one or two intermediaries, together with the two intentions to make friends with each other, are reflected in the relationship formation. By coordinating the relationship between the two, it is possible to form a rational and reliable network, but it has not been able to take advantage of the offline friend making process online.

The present invention has been made to solve the problems of the prior art as described above, an object of the present invention is to introduce a friend that can determine the user range capable of forming a network reflecting both the intention of the user and the intermediary of the user to make friends And to provide a method and a system for making friends.

Another object of the present invention is to provide a friend introduction and friend making method and a system therefor that can reasonably limit the range of users wishing to form a relationship.

Still another object of the present invention is to provide a friend introduction method and a friend making method and a system therefor that can minimize side effects that may occur due to exposure of personally identifiable information or online encounters.

According to a feature of the present invention for achieving the above object, the present invention forms a friend relationship by mutual agreement, enabling the exchange of messages and viewing user-related data between users having a friend relationship. A system for introducing friends and making friends, which provides an online service, the system comprising: a network manager managing a friend relationship of each user; A state information manager for each user, each of which selects and stores one state from among a plurality of alternative states including a first state from a user and a friend of the user; With respect to the first user, only when the state selected by the first user and the state selected by the second user who is friends with the first user are both the first state, the first user is friends with the second user and the second user is an intermediary. The first user is included in the introduction pool of the third user having a connection with the first user, and the introduction pool manager is disclosed to disclose the first user to the third user.

Here, the introduction pool manager is a third state in which the state selected by the first user with respect to the first user and the state selected by the second user who is friends with the first user are both first states, and friends with the second user and the second user. With respect to the fourth user who has a connection relationship with the first user with the user as an intermediary, and the state selected by the fourth user and the state selected by the third user are both the first state, The first user may be disclosed to the fourth user by including the first user in the introduction pool of the four users.

In addition, the system for introducing friends and making friends may define a plurality of kinds of operations for other users of any user, and are registered in a first user group having a friend relationship with the first user and an introduction pool of the first user. The method may further include an operation manager for selectively restricting an operation that can be performed for each of the second user group and each of the third user groups that are not friends with the first user and not registered in the introduction pool of the first user.

The system for introducing friends and making friends includes the number of times of performing an operation with respect to the type of an operation performed for a specific user whenever any operation is performed by a different user with respect to a specific user among the plurality of operations. It may further include a statistics manager that accumulates and publishes the recorded number of performances.

In this case, the network administrator may be provided with one or more other user information from a friend list registered in a member account of each user's third party server or a contact list registered in each user's terminal to expand a friend relationship. .

On the other hand, the present invention forms a friend relationship by mutual agreement, a method for introducing friends and making friends to provide an online service that enables the exchange of messages and viewing user-related data between users having a friend relationship, Receiving, respectively, status information indicating one of a plurality of different levels of statuses from the first user and a second user who is a friend to the first user, and based on the received status information, A third user who determines the status of the first user as a public state or a private state, is a friend of the second user, and has a serial connection with the first user with the second user as an intermediary; and At least one of a fourth user who is a friend of the third user and has a serial connection with the first user using the second user and the third user as an intermediary With respect to, the first user may be registered in the introduction pool according to the state determined for the second user of the first user.

In this case, when the first user is registered in at least one of the introduction pools for each of the third user and the fourth user, the method for introducing the friend and making a friend is set to be impossible to perform before the first user is registered in the introduction pool. The at least one action that was present may be enabled for the first user after the first user is registered in the introduction pool.

Here, the operation that is switched to be performed with respect to the first user may include a wish operation for registering the first user in the interest list, a friend request operation for querying the first user to make a friend, and querying the first user for an offline meeting intention. And a meeting request operation for determining a detailed schedule related to the offline meeting, and a profile reading operation for reading profile information of the first user.

Also, a plurality of different levels of status may include disclosure and privateness, and the status of the first user to the second user may be disclosed only when both the first user and the second user select the first user's status information as public. May be determined.

Here, when the first user selects the state information of the first user to be private, and performs a meeting request operation to the fifth user included in the introduction pool of the first user, the state information of the first user is disclosed to the first user. It is possible to switch the state information of the first user by querying whether to switch to.

In addition, when the second user selects the status information of the first user to be private, the first user meets the sixth user registered in the introduction pool of the first user with the second user as a friend and the second user as an intermediary. When the application operation is performed, the encounter request message may be delivered to the second user, and the second user may be queried whether to switch the state information of the first user to public, and the state information of the first user may be switched.

Meanwhile, the present invention forms a network having a distance of 1 as a friend relationship between two users, and introduces a friend and provides a friend who provides an online service that enables exchange of messages and viewing user-related data between users based on the formed network. In the method for making a connection, for each user, the user and the friend of the distance that is connected to the user 1 is received from each other status information that selectively represents one of a plurality of different levels of status, respectively, the received status information Determining a status for each friend of each user as either public or private; If the status of the first user to the second user is determined to be public, the third user whose distance to the second user is public as the user has a distance of 2 and the distance to the second user is 1 And searching for a fourth user whose user distance is 3 and distance between the third user is 1 and whose state is public for the third user and registering the fourth user in the introduction pool of the first user; And when the state of the second user of the first user is determined to be in a private state, a third user whose distance to the second user is 2 and the distance to the second user is 1, and the third state of the second user is public And registering the user in the introduction pool of the first user.

According to the present invention having such a configuration, since the user range that can form a network is determined by reflecting both the intention of the users who want to make friends and the intention of the intermediary, there is an advantage that reliable meeting is possible.

In addition, according to the present invention friends and method of making friends and systems therefor, by reasonably limiting the range of users to form a relationship, there is an advantage that can minimize the exposure of the individual and maximize the effect of network formation.

Furthermore, according to the present invention, a friend introduction method and a friend making method and a system therefor have an advantage of minimizing side effects that may occur due to exposure of personal personal information or online encounters.

1 is a block diagram schematically showing the configuration of a system for introducing friends and making friends according to a specific embodiment of the present invention.
2 is an exemplary diagram for explaining a network configuration between users in a friend introduction and friend making method according to a specific embodiment of the present invention.
3 is a block diagram schematically illustrating a configuration of a server included in a system for introducing friends and making friends according to a specific embodiment of the present invention.
Figure 4 is an exemplary view for explaining in detail the configuration of the state setting and the introduction pool according to each user in the friend introduction and friend making method according to a specific embodiment of the present invention.
5 is a flowchart illustrating a method of constructing an introduction pool in a method of introducing friends and making friends according to a first embodiment of the present invention.
6 is a diagram illustrating an example of a network configuration for explaining a friend introduction and friend making method according to a specific embodiment of the present invention.
7 is a flowchart illustrating a method of constructing an introduction pool in a method of introducing friends and making friends according to a second embodiment of the present invention.

EMBODIMENT OF THE INVENTION Hereinafter, although embodiment of this invention is described referring drawings, this invention is not limited to this. Like reference numerals are used to refer to like elements.

1 is a block diagram schematically showing the configuration of a system for introducing friends and making friends according to a specific embodiment of the present invention. The system for introducing friends and making friends according to an embodiment of the present invention has a configuration as shown in FIG. 1.

First, a plurality of terminals 10 are configured. The terminal 10 may be any personalized information processing device such as a portable mobile communication terminal or a personal computer, but exchanges data with the service server 20 to be described later through a network by a wired or wireless communication method.

The service server 20 exchanges data with each of the plurality of terminals 10 to provide an online service to the user of the terminal 10. The online service provided by the service server 20 uses a human network based on a friend relationship between users of each terminal 10 to exchange messages, view profiles, view bulletin boards and post postings, and view photo albums between friends. It is a so-called social network service that enables social networking.

To this end, the service server 20 stores profile information, photo data, post data, friend relationship information, etc. of the user in a user account assigned to each user, and stores the information stored in the service server 20 when necessary. Providing database server 20 'is configured together.

The service server 20 is also interoperable with the third party server 30. The third party server 30 may be an e-mail server or a separate social network service server operated by the service server 20 and other operating entities. For example, the third party server 30 may be provided by the third party server 30. The service server 20 may be linked with a third party server 30 using an open API (Application Programming Interface). For example, when a member of the third party server 30 subscribes to the online service provided by the service server 20 using the member authentication information registered in the third party server 30, the third party server 30 contacts the third party server 30. The service server 20 may interwork with the third party server 30 in various service provision steps from an authentication procedure, such as using the registered member information in the service server 20.

The service server 20 enables a friend introduction and friend making in a similar manner to a friend introduction and friend making mechanism that occur offline between users of the terminal 10 in addition to the general social network service based on the friend relationship as described above. For this purpose, the service server 20 includes a configuration as shown in FIG. However, before describing the configuration of the service server 20 as described above, terms used below are defined.

First, in the following, 'friend' refers to a relationship between two different users, and when two users form a friendship by mutual agreement, the two users have the right to view each other's profile, the right to view a bulletin board, and to register a post. , Not only to view various personalized information, such as the right to view a photo album, but also to exchange messages with each other or to perform at least some of the various operations defined in the online service with respect to each other. Access is granted. That is, the term 'friend' is used as a term indicating a relationship between two users who are granted access authority within a predetermined range with respect to each other. In addition, when the two users form a friend relationship with each other, the counterpart user is registered in each user's friend list. The formation of such a friend relationship may be achieved by another user accepting a friend's application for another user, and one user may transfer to another terminal user to an online service provided by the service server 20. A friend relationship between the two users may be formed even when another user responds to the invitation to join to perform an online subscription.

In addition, the 'network' refers to a human network formed by connecting information between other users included in each user's friend list as nodes and connecting nodes corresponding to users having friends. For example, if A and B are friends, B and C are friends, and C and D are friends, a network as shown in FIG. 2 may be formed. 2 is an exemplary diagram for explaining a network configuration between users in a friend introduction and friend making method according to a specific embodiment of the present invention. Each user A, B, C, and D may be a node, and a network may be formed by connecting nodes between friends with a link. Thus, 'node' means each user, and 'link' symbolizes a friend relationship, and a friend relationship is established only between users directly connected by the 'link'.

And 'connection relationship' is a partial network including two or more nodes and one or more links serially connecting them as part of the network, for example, a connection including user A in the network shown in FIG. It can be summarized as Table 1 below.

In the above, 'distance' refers to the number of links included in the connection relationship, and means the number of friend relationships existing between two users corresponding to both nodes of the connection relationship. If the distance is 1, it corresponds to both nodes. The two users have a direct friend relationship, and if the distance is 2, the two users corresponding to both nodes have no direct friend relationship, but have one common friend as an intermediary. At this time, the "intermediate" means a user corresponding to another node existing between both nodes in one connection relationship. Furthermore, when there are two intermediaries between nodes at both ends of the connection, the distance between the nodes at both ends is three. When the connection between two nodes is limited to the shortest connection between two nodes, the distance has the concept of the shortest distance.

Meanwhile, in the exemplary embodiment of the present invention, each user may alternatively register his or her friend's 'status information', and the status information may indicate whether the user is exposed to another user, the exposure range, and other information about the user. It is used as a variable to limit or allow the user's access authority and the scope of grant. The state information is selected as one of a plurality of levels of states and recorded to each user. For example, the state information may be set to one of 'public' and 'private'. However, this is merely an example and may be subdivided into three or more levels. In addition, such status information is divided into status information selected by the user and status information set by the user's friend. When the user or a friend does not select a specific status, the status information is automatically set as a preset default state among a plurality of states. Can be. In this case, since a plurality of friends may exist for one user, status information set by a plurality of users may be separately stored for one user, and the status information may be stored for each friend. Accordingly, the 'state' of each user is determined based on the state information. Since the status information selected by the user and the status information selected by the friend for each user are stored separately, the status of the user is determined according to the status information selected by the user and the friend. This will be described in more detail later.

A 'introduction pool' is a set of users that includes one or more users who are granted access to a specific user, among other users other than a friend, to a specific user. Restricted access or no access is granted to other users other than Friends, but to other users included in the user's introduction pool, access to other users other than those included in the friend or introduction pool High level of access is allowed. That is, different users can be classified into three groups (users / other users included in the friend / introduction pool) for a specific user. Different access rights are granted to the three groups. Access to other user groups is most limited. The access rights granted for each group will be described in more detail later.

Furthermore, various 'operations' are defined within the online service provided in the embodiment of the present invention, and the user may perform each operation with respect to other users within the scope of the above-mentioned access rights. 'Steaming' means that when a steaming operation is performed on a user who is interested among other users included in a introduction pool of a specific user, the user is registered in his / her watchlist so that the user can always view the steamed user-related information. Function. In addition, 'friend request' is a function to allow a friend request message to be delivered to a user who requested a friend when a friend request operation is to be made with another user, and a new friend relationship is formed depending on whether or not to accept the friend request. 'Contact Application' means that when a specific user performs 'Contact Application' operation on another user registered in his or her introduction pool, the two users are 'matched' with each other according to the acceptance of the user, and the schedule for offline meeting is This function allows you to decide. 'Matching' refers to a function of allowing a user to exchange personal information, for example, a personal phone number, which is not exposed to other users, when a request for a meeting of another user is accepted. do. Furthermore, 'blocking' may restrict access of a blocked user when a specific user performs a blocking action on another user registered in his or her introduction pool or another user who has made a friend request, a meeting request, or a wish to the user. It is a function to make it possible. In addition, the 'friend introduction' is an operation of transmitting an introduction message about the user or a friend of the user to another user, a plurality of users, or all other users, and the user who is the target of the introduction message himself or herself Only when the information is set to 'public', such an operation may be limited. Furthermore, keyword tagging is a function of displaying a keyword in a friend's profile when a user tags a keyword with his or her friend. Here, 'keyword' is text data such as a word or a sentence that a user wants to be displayed on a friend's profile. In this way, when users tag keywords to their friends, a plurality of keywords tagged by friends of the user may be expressed in a tag cloud or the like in a profile of any user. The keywords included in the tag cloud may be displayed to all other users, but only limited keywords may be displayed according to the relationship between the user and the other user.

Hereinafter, a detailed configuration of the service server 20 will be described in detail. 3 is a block diagram schematically showing the configuration of a server included in the system for introducing friends and making friends according to a specific embodiment of the present invention, Figure 4 is a friend introduction and making friends according to a specific embodiment of the present invention In the method, it is an exemplary view for explaining in detail the state setting of each user and the configuration of the introduction pool accordingly.

As shown in FIG. 3, the service server 20 configured in the system for introducing friends and making friends according to an embodiment of the present invention includes a network manager 21. The network manager 21 recognizes a friend relationship between users through a friend list for each user account registered in the database server 20 ', and enables a network to be formed between users. That is, a specific user can apply for a friend to another user, and also determine whether or not to accept a friend request to form a friend relationship, and in conjunction with the third party server 30, the third party server ( 30) The user can send an invitation message to the online service to a user who is not a member of the online service provided by the service server 20. Form a friend relationship between the transmitted user and the newly joined user. In addition, the network manager 21, in order to expand the network, from the contact information registered in the terminal 10, the friend list registered in the third party server 30, etc., a friend recommendation list for each user You can create a friend so that you can add friends.

On the other hand, the state information manager 22 sets the state information set for each user as initial default information, receives and stores the state information from the user himself and his friend, and monitors and updates the changes. That is, when a new member joins, the user is induced to set his or her status information, and whenever the user's friend is added, the status information of the friend to be added is set. Thereby, for each user, both the status information set by the user and the status information set by each friend are recorded and managed. As described above, the state information is selected as one of a plurality of states of different levels. Hereinafter, an embodiment of the present invention will be described as being selected as one of two levels, but it is not necessary to do so.

The introduction pool manager 23 configures a separate introduction pool for each user and provides each user. At this time, the introduction pool manager 23 determines other users to be included in the introduction pool of each user by referring to the state information set for the users. In an embodiment of the present invention, the user to be included in the introduction pool is selected from the user forming the other end node in the connection relationship of distance 2 and the distance 3 in which the user A is a node. In particular, only users who are set to public state within the connection can be included in the introduction pool for user A. In particular, a user corresponding to the other node in the connection of distance 3, user A is also released within the connection. It can be included in the introduction pool only when the status is set. In this case, the meaning of being set to the public state in the connection relationship is explained. For example, if user A and user B are friends with each other, user A chooses his own status information as public and user B has user A. Only when the user's status information is selected as public, user A is set to the public state in the connection relationship where user B is the intermediary. That is, such a public state may vary depending on the setting of user B, a friend of user A. When public is set to 1 and private is set to 0, user A's status information is set to one of (0, 0), (0, 1), (1, 0), and (1, 1), respectively. When the AND operation is performed, the result value is 1 only when the status information of the user A is (1, 1), and the status of the user A for the user B is set to the public state, and all other cases are set to the private state. However, this is a setting determined only in a connection relationship in which user B is included as an intermediary, and a setting between user A and another friend of user A may be determined differently.

The introduction pool manager 23, in addition to other users (friends) having the shortest distance with user A of 1 in the network, is in a public state within the connection relationship with user A, among other users having the shortest distance with user A in the network of 2. You can include other configured users in the introduction pool for user A, and you can include other users in the introduction pool for user A that are set to public state in connection with user A, among other users whose user A has the shortest distance to 3 . However, to include a user with the shortest distance 3 in the introduction pool, User A himself / herself selects his / her status information as public, and the intermediary in the connection relationship also selects User A's status information as public, It may be limited to the case set. That is, since the users of the distance 1 are included in the friend list, the users of the distance 2 set to the public state and the users of the distance 3 set to the public state may be included in the introduction pool except the introduction pool.

Referring to FIG. 4 to clarify how to determine other users to be included in the introduction pool for each user, first, whether or not other users whose distance is 2 from user A is included in the introduction pool is the user A's set state. Irrespective of this, it may be determined considering only the setting state of other users whose distance from user A is two. That is, in FIG. 4, the user C has a distance of 2 from the user A, and the user C himself selects his state information as public, and since the broker B selects the state information of the user C as private, User C's status becomes private. Therefore, user C is not included in user A's introduction pool. However, in the case of the user E, the intermediary D selects the state information of the user E as public, and since the user also selects the state information as the public, the user E is set to the public state in relation to the intermediary D. Therefore, user E is included in the introduction pool for user A.

Referring to FIG. 4 and Table 3 below, if the user A's inclusion in the user A's introduction pool of another user F having a distance of 3 is considered, the connection relationship between the distance 3 having the user A and the user F as both nodes is ABCF, ABGF, and ADEF are three in total. Each mediator is different as shown in Table 3. The status of user A for each connection is that A has chosen his own status information as public, and B, the user A's mediator, has selected A's status information as public, In a connected relationship, all A's state is set to public. On the other hand, in the third connection relationship in which the intermediary on the A side is D, the state of A is set to the private state because D selected the state information of A to be private.

On the other hand, the state of F in the connection relationship as described above, depending on whether the mediators of the F side, C, G, E has selected the state information of the F. F himself has set his status information to be public, and C, G, and E are set to be public, private, and public, respectively, so the status of F is public, private, and public. Thus, F is included in A's introductory pool only for the first connection where both A and F are open in the connection. However, whether or not F is included in A's introduction pool, F may be included in A's introduction pool, since F is set to be open to A within at least one connection relationship. As such, when F is included in A's introduction pool, A can confirm that F's introduction pool is included as an intermediary of user B, who is his friend. The display of user C, which is another intermediary, may be selectively changed, but may not be displayed since user C is not a direct friend of user A.

The introduction pool manager 23 thus configures an introduction pool by selecting other users to be included in the introduction pool for each user, and selectively displays at least some of the other users included in the introduction pool. For example, an introduction pool may be provided by selectively displaying only one person per day in the introduction pool for each user and displaying other users in the introduction pool when the date is changed. In addition, the introduction pool manager 23 may further limit the range of other users included in the introduction pool by additional matters. For example, when the gender of the user A is set to 'woman', all users whose gender is 'woman' may be excluded from other users extracted to be included in the introduction pool. In addition, as described above, the introduction pool manager 23 may display whether or not other users included in the introduction pool are included in the introduction pool through a connection relationship (particularly, a friend relationship).

Meanwhile, the service server 20 may include an operation manager 24. The operation manager 24 is capable of providing a plurality of operations defined in the online service provided by the service server 20, and is responsible for the processing set accordingly. In this case, the operation manager 24 may provide a limited operation that a specific user can perform to another user. To this end, the operation manager 24 may determine a relationship between the subject of the operation and the user who will be the object of the operation. Therefore, only the set operation can be provided. The following table is an example of this.

friend Status information selection, friend disassociation, meeting request delivery, friend introduction, keyword tagging Users included in the introduction pool Friend Request, Wish, Meeting Request, Block Third party Add Friend

However, the above configuration is only a fragmentary example, and access rights, such as the authority to perform or view other operations, can be given differently for each different relationship.

The operation manager 24 may notify the user B that the user B is steamed when the user A performs the steaming operation with respect to the user B registered in the introduction pool, but may not notify who the steamer was steamed by. The user B is registered in the interest list of the user A so that the user A can read the information about the user B whenever he wants.

The operation manager 24 also reflects on the friend list of each user when a friend request or acceptance thereof is made, thereby allowing the introduction pool manager 23 to update the introduction pool. Further, when the operation manager 24 delivers the meeting request to the user C registered in the introduction pool of the user A through the user B, which is his friend, the user A asks whether the user C accepts or rejects the offline meeting schedule. Make it clear. In this connection, if ABC is set to the public state and A selects his own state information to be public, but when B intervenes A's state information privately, A requests for a meeting with C. When the meeting request is first delivered to the intermediary B, the intermediary B may be able to determine whether to deliver to the C. In this case, it may be impossible for the user A to confirm whether or not the intermediary B has refused the transmission or whether the user C who has finally received the meeting request has refused the meeting. However, at this time, if both the user A and the intermediary B selected the user A's status information to be public, the meeting request for the user C of the user A can be delivered directly to the user C without going through the intermediary. However, as described above, when the mediator B enters the status information of A privately, when A performs a meeting request for C, the status information manager 22 first switches the status information of A to the mediator B to the public. It can automatically query whether or not to register, and when the broker B switches the status information to public, the encounter request can be automatically delivered to the user C. In addition, the status information manager 22 may also change the status information according to the user's operation, the user who selects his status information as 'private', selects a specific user from his introduction pool to meet If you apply, you can automatically record the status information to 'public' by inquiring whether or not the user requesting the application to convert their status information to 'public'.

Further, when the operation manager 24 receives a 'blocking' command for another user from a specific user, the operation manager 24 restricts access authority such as an operation or a viewing authority that is allowed by the relationship between the two users. For example, if you block other users who have steamed themselves, you can prevent the blocked user from seeing information about the user who has steamed them anymore. In addition, when the operation manager 24 performs a friend introduction operation to the user or a friend of the user, the operation manager 24 transmits an introduction message to another user, a plurality of other users, or all other users, or share the online service. Information about the user can be displayed in the area so that anyone can view it.

In addition, when the 'keyword tagging' operation is performed from the user A to the profile of user B of the user A from the user A, the operation manager 24 includes the input keyword in the keyword list of the user B's account, and the corresponding keyword is assigned to the user A. Record that it has been entered. Accordingly, at least some of the keywords included in the keyword list are displayed in the tag cloud included in the user B's profile. Here, user B may delete some of the keywords tagged to him. At this time, the operation manager 24 selects and displays different keywords included in the tag cloud according to the relationship between the user B and other users who view the keywords included in the tag cloud, and also displays whether or not the specific keyword is highlighted.

For example, when User A, a friend of User B, checks User B's profile, all keywords tagged by other users of User B, that is, all keywords in the keyword list of User B's account, are displayed in the tag cloud. For each keyword, tagging information is provided along with who of user B's friends has been tagged. Among these keywords, keywords tagged by the user A who browses the tag cloud are displayed to be highlighted.

Also, for example, another user D who is friends with user B's friend, who is registered with user B in his introduction pool, selects user B in his introduction pool to view the profile. To view all keywords tagged by the other friends of user B, but to highlight the keywords tagged to user B by the intermediary user C and other users who are friends with user C. It also provides tagging information. Among the keywords displayed in the tag cloud, tagging information of keywords tagged by other users not related to user C, which is an intermediary between user D and user B, may not be provided.

Further, for example, a user B's keyword is shown to other users who are not friends with User B and whose User B is not registered in the introduction pool, but do not emphasize specific keywords or provide tagging information.

Additionally, the service server 20 may further include a statistics manager 25. The statistics manager 25 calculates the statistics of each user by accumulating and recording the number of wishes, friend requests, meeting requests, matching, etc. made for a specific user, and discloses the statistics to each user or other users. To perform.

Hereinafter, with reference to the drawings, looks at the configuration of the introduction pool in a friend introduction and friend making method according to an embodiment of the present invention in more detail. FIG. 5 is a flowchart illustrating a step-by-step method of constructing an introduction pool in a method of introducing friends and making friends according to a first embodiment of the present invention, and FIG. 6 is a flowchart illustrating a method of introducing friends and making friends according to a specific embodiment of the present invention. FIG. 7 is a flowchart illustrating a method of configuring an introduction pool in a method of introducing friends and making friends according to a second embodiment of the present invention.

First, as shown in FIG. 5, when the first user logs in, a first user's introduction pool is configured and displayed. For this purpose, the first user's friend list is searched for [friends] of the first user (S100). ). For example, the user B's friends B, C, and D are searched for in FIG. 6.

Then, the friend list of each of the searched [friends] is extracted, and among the [friends of the friend] of the first user included in the friend list of the [friend], the user's status information is publicly selected, and the [friend] of the first user. ], Select [Friends of friends] set publicly, and register in the introduction pool of the first user (S110). For example, in FIG. 6, friends of each of users A, B, C, and D are extracted. In other words, B's friend E, C / C's friend B, F, G, H / D's friend H corresponds to User A's [friend's friend], such user A's [friend's friend] Among B, C, E, F, G, and H, the user sets his / her own status information to the public, and the user whose status information is set to public by the brokers B, C, and D is registered in the introduction pool of user A.

On the other hand, the process of determining whether the first user has selected his own status information to the public (S120). If it is selected to be public, a process for registering at least a part of [friend of friend of friend of friend] for the first user in the introduction pool is performed. First, it is searched whether there is a [friend] selected as the state information of the first user (S130). The friend of the friend is extracted from the friend list of the friend who has selected the state information of the first user (S140). Again, from among the extracted [friends of friends of friends] friends of the first user [friends of friends of friends] select their own status information to public, the first user [friends of friends], that is, The status information is selected by the intermediary to select [friend of a friend of a friend] to be registered in the introduction pool of the first user (S150). For example, in FIG. 6, A is selected by the user A side intermediary among A, C, E, F, G, H, I, J, K, L, M, and N, which is a friend of a friend of user A. The user is set to the public state, and only the user whose user A's friend's friend's friend is set to the public state is extracted and registered in the introduction pool.

However, if it is determined in step S120 that the first user selects his own status information privately, [friend of friend of friend] for the first user is not registered in the introduction pool. Therefore, steps S130 to S150 are omitted.

Thereafter, among the users registered in the introduction pool, if the first user himself and [friend] of the first user are included, the configuration of the introduction pool for the first user is completed (S160). The provision of the introduction pool is completed by exposing at least one of the users included in the introduction pool to the first user (S170).

The first embodiment as described above is an example of configuring an introduction pool by referring to a friend list of each user, and the second embodiment to be described below refers to a friend list of each user and also establishes a shortest distance connection relationship between each user. This is an example of configuring an introduction pool.

As shown in FIG. 7, in the second embodiment, among the third users whose distance from the first user is 2, one's own state information is selected as public, and an intermediary (the first distance with the first user is 1). The second user) also registers the third users whose status information is selected as public in the introduction pool of the first user (S200). In Fig. 6, the user A is set to the public state in relation to each of B, C, and D whose distance is 1, and users whose distance is 2 with user A are registered in the introduction pool of user A.

Then, the process of determining whether the first user has selected his or her own state information is disclosed (S210). If the public is selected, a process for registering other users whose distance to the first user is 3 from the introduction pool is performed. That is, the distance to the first user is 1, and the first intermediary that selects the state information of the first user as public is searched (S220). In the example of FIG. 6, the first intermediary is searched among B, C, and D.

In operation S230, a second intermediary having a distance of 1 to the first mediator and a distance of 2 to the first user is searched for. At this time, the state of the first or second mediator may not be considered. In the example of FIG. 6, the second mediator is selected from E, F, G, and H. In FIG.

Also, among the users whose distance from the second mediator is 1 and the distance to the first user is 3, the fourth user whose status information is publicly selected by the second mediator and whose status information is publicly selected by the second mediator is selected. Search and register in the introduction pool (S240). In the example of FIG. 6, among I, J, K, L, M, and N, only a user whose user A and user I, J, K, L, M, N are both publicly selected is selected in connection with A.

In the case of such an embodiment, since the user extraction process to the introduction pool is performed in consideration of the shortest distance with the first user, the first user or a friend of the first user is excluded from the introduction pool, and thus the There is no separate step.

When the introduction pool is completed, at least some of the users included in the introduction pool are extracted and displayed to the first user (S250).

According to this method, considering both the intention of making a friend of the user and the intention of introducing a friend of the friend of the user, since the introduction of a friend and the making of a friend proceed together, it is possible to reasonably reflect the intention of the user and form an offline network. By implementing the process similarly on-line, you can increase the confidence in newly created contacts and increase the success rate of new contacts.

 Those skilled in the art may appreciate that various example logic blocks and algorithm steps described in connection with the embodiments disclosed herein may be implemented in electronic hardware, computer software, or a combination thereof. To clearly illustrate this possibility of replacing hardware and software, various illustrative steps have been described above primarily in terms of their functionality. Whether such functionality is implemented in hardware or software depends upon the particular application and design constraints imposed on the overall system.

Skilled artisans may implement the described functionality in varying ways for each particular application, but should not interpret it as causing a decision of such implementation to fall outside the scope of the present invention. That is, the above embodiment is merely an example for describing the present invention in detail, and the present invention is not limited to these embodiments. Additions, omissions, substitutions, and other modifications can be made without departing from the spirit of the present invention. The present invention is not limited by the foregoing description, but is limited only by the scope of the appended claims.

10: terminal 20: service server
20 ': Database server 30: Third party server

Claims (12)

In the system for friends introduction and friend making, which forms an online relationship by mutual agreement and provides an online service that enables the exchange of messages and the viewing of user-related data among users having a friend relationship,
A network manager managing a friend relationship of each user;
A state information manager for each user, each of which selects and stores one of a plurality of alternative states including a public state and a private state from a user and a friend of the user;
The second user is in a public relationship only when the state selected by the first user with respect to the first user is public, and the state selected by the second user with a first user with respect to the first user is also public. Introducing a friend, including an introduction pool manager that exposes the first user to the third user by including the first user in the introduction pool of the third user who has a relationship with the first user with the user as an intermediary. System for making friends. The method of claim 1,
The introduction pool manager mentioned above,
The state selected by the first user for the first user and the state selected by the second user who is friends with the first user are both public and
With respect to the fourth user who has a connection relationship with the first user and has a third user who is a friend of the second user and the second user, and has a friend relationship with the third user, the state selected by the fourth user and the third user selected A system for introducing friends and making friends, wherein the first user is disclosed to the fourth user by including the first user in the introduction pool of the fourth user only when the states are all public. 3. The method according to claim 1 or 2,
The system for introducing friends and making friends,
Define a plurality of kinds of operations for other users of any user, and have a first user group which is a friend relationship with the first user, a second user group registered in the introduction pool of the first user, and a friend relationship with the first user. And a motion manager for selectively restricting the actions that can be performed for each of the third user groups not registered in the introduction pool of the first user. The method of claim 3,
The system for introducing friends and making friends,
Among the plurality of operations, whenever an operation is performed by another user with respect to a specific user, accumulate and record the number of operation executions for the type of operation performed for the specific user, and publish the recorded number of executions. A system for introducing friends and making friends, further including a statistics manager. The method of claim 1,
The network administrator,
Introducing friends and making friends by expanding one's relationship by receiving one or more other user information from a list of friends registered in a member account of each user's third party server, or a list of contacts registered in each user's terminal. system. What is claimed is: 1. A method for introducing friends and making friends, which provides an online service that forms a mutual relationship by mutual agreement and enables the exchange of messages and viewing of user-related data among users with friends.
Receives first status information from the first user and a second user who is in a friend relationship with the first user, respectively, and status information indicating one of a plurality of states including a public state and a private state. If both the first user and the second user select the public status, the status of the first user's second user is determined as the public status.
If the status of the first user is determined to be public, a third user who is a friend of the second user and has a serial connection with the first user with the second user as an intermediary, and a friend of the third user And for at least one of the fourth users having a serial connection with the first user using the second user and the third user as intermediaries. The method according to claim 6,
The method for introducing friends and making friends,
If the first user is registered in at least one of the introduction pools for each of the third user and the fourth user, the first user introduces at least one action that was previously disabled before the first user was registered in the introduction pool. Transitionably performable for the first user after being registered with. 8. The method of claim 7,
An operation that is switched to be performed on the first user may include:
A wish operation for registering the first user to the interest list, a friend request operation for querying the first user to make a friend, a contact application operation for querying the first user for an offline meeting intention and determining a detailed schedule related to the offline meeting, And a profile viewing operation for viewing profile information of the first user. 9. The method of claim 8,
The state of the first user for the second user is determined to be private when at least one of the first user and the second user selects the state information of the first user to be private. 10. The method of claim 9,
When the first user selects the status information of the first user privately, and performs a meeting request operation to the fifth user included in the introduction pool of the first user, the status information of the first user is disclosed to the first user. Querying whether to switch to to switch the status information of the first user. 11. The method of claim 10,
With the second user selecting the first user's status information privately, the first user is a friend of the second user and the second user is an intermediary and registered with the sixth user registered in the introduction pool of the first user. Performing an operation, transferring the encounter request message to the second user and asking the second user whether to switch the status information of the first user to public, thereby switching the status information of the first user. A method for forming friends and making friends by providing an online service that forms a network with a distance of one friend between two users, and enables exchange of messages and viewing user-related data between users based on the formed network. To
For each user, the user receives the user's status information, which is one of the distance between the user and the friend, which is one of the public and private states. Determining a state of each friend of each user as a public state only when the state information of the user is selected as the public state;
If the status of the first user to the second user is determined to be public, the third user whose distance to the second user is public as the user has a distance of 2 and the distance to the second user is 1 And searching for a fourth user whose user distance is 3 and distance between the third user is 1 and whose state is public for the third user and registering the fourth user in the introduction pool of the first user; And
If the first user's status for the second user is determined to be private, the third user whose distance to the second user is public as the user has a distance of 2 and the distance to the second user is 1 Registering the first user with the introduction pool of the first user.

Images