JP7364204B2 - Social network service provision system - Google Patents

Description

The present invention relates to a social network service providing system that can accept friend requests only from users with whom the user has a certain degree of relationship.

In recent years, social network service (SNS) technology represented by Facebook (registered trademark) and the like has become widespread. In such SNS, users can exchange messages and build friendships with each other on the network, thereby creating connections between users (Patent Document 1).

In such SNS, building friendships can be done as follows, for example. That is, when user A wants to become friends with user B, user A first requests user B to be friends. User B, who receives the notification of this friend request, selects whether to approve or reject this request. If User B approves the friend request, User A and User B become friends with each other.

JP2007-287131A

However, since such friend requests can be sent regardless of user B's intentions, a large number of unwelcome friend requests may be received. In that case, User B has to decide whether to approve or reject, which is troublesome. There is also a fear that if the request is rejected carelessly, User A may feel uncomfortable. On the other hand, there are concerns that personal information may be leaked if approval is repeatedly given.

SUMMARY OF THE INVENTION Therefore, an object of the present invention is to provide a social network service providing system that can require a certain level of trust in friend requests.

In order to solve the above problems, a social network service providing system according to one aspect of the present invention is a social network service providing system in which a first friendship relationship and a second friendship relationship can be specified according to the closeness of the friendship relationship. and a first friend relationship is specified, a first friend request from the first user to the second user is received, and a second friend request from the second user to the first user is received. If a friend request is received and the elapsed time from receiving the first friend request to receiving the second friend request exceeds a predetermined time, these friend requests are accepted. If the friend request is not made and a second friend relationship is specified, the friend request is accepted regardless of the elapsed time .

Further, in one embodiment, the predetermined time is set between 3 minutes and 10 minutes.

Furthermore, in one embodiment, when receiving the first friend request and the second friend request, location information of the first user and the second user is also received; and the second user are far apart, the friend request is not accepted.

According to the social network service providing system according to the present invention, in order to make a friend request, it is necessary to contact each other in advance and take certain steps, so only those with whom a certain degree of trust has been established are friends. It can be.

FIG. 1 is a network diagram for explaining an implementation of a social network service by a social network service management server according to the present invention. FIG. 2 is a diagram illustrating a method for accepting friend requests in a social network service according to the present invention.

Hereinafter, embodiments of a social network service providing system according to the present invention will be described with reference to the accompanying drawings. This social network service providing system is implemented as a social network service management server that connects to the Internet and provides social network services to users.

FIG. 1 is a network diagram for explaining the implementation of the social network service by the social network service management server 1. As shown in FIG. Here, a social network service management server 1 and a large number of user terminals that use this social network service are connected to the Internet. Here, for simplicity, only the smartphone 3 carried by user A and the personal computer 5 used by user B are illustrated.

User A and User B have accounts for this social network service, can log on to the social network service management server 1, use various communication functions, and interact with other users.

This social network service also has the ability to set up "friend" relationships between users. For example, by limiting your posts to friends, you can prevent your private posts from being read by an unspecified number of people.

In conventional social network services, for example, when user A wants to become friends with user B, user A first requests user B to be a friend. User B, who receives the notification of this friend request, selects whether to approve or reject this request. If User B approves the friend request, User A and User B become friends with each other. However, since anyone can freely make such friend requests, users who receive notifications of numerous friend requests may find it bothersome.

Therefore, in the social network service according to the present invention, friend requests are accepted assuming a certain degree of familiarity. Specifically, friend requests will only be accepted if both parties send friend requests at the same time.

FIG. 2 is a diagram illustrating a method for accepting friend requests in a social network service according to the present invention. First, User A and User B log on to this social network service providing system using their respective IDs and passwords. If the ID and password are correct, the social network service providing system allows logon. The timing of this logon is arbitrary.

Next, User A and User B simultaneously apply for friends to the social network service providing system at a predetermined time. For example, contact them by phone in advance and set 10:30 as the time to send friend requests.

When the social network service providing system receives a friend request from user A to user B, it simultaneously checks whether the other user, that is, user B, has also sent a friend request to user A. If these friend requests are made at the same time, the friend requests are accepted, the friend relationship between user A and user B is registered, and user A and user B are notified of this fact.

In reality, in the social network service providing system, if the time d from receiving the first friend request to receiving the next friend request is within a predetermined time, these friend requests are considered to be simultaneous and accepted. do. In a specific example, this predetermined time is set to about several minutes, for example between 3 and 10 minutes. If the predetermined time period elapses between receiving the first friend request and receiving the next friend request, these friend requests will not be accepted. By doing this, it is possible to give a certain amount of weight to the act of making a friend request.

In this embodiment, as in the case of Embodiment 1, in order to establish a friend relationship with each other, User A and User B simultaneously apply for friend requests to the social network service providing system at a predetermined time. At that time, location information indicating each current location is also transmitted to the social network service management server 1.

When the social network service providing system receives a friend request from user A to user B, it simultaneously checks whether the other user, that is, user B, has also sent a friend request to user A. If these friend requests are made at the same time, then the current locations of user A and user B are compared. If these current locations are the same, the friend request is accepted, the friend relationship between user A and user B is registered, and user A and user B are notified of this fact.

In reality, in the social network service providing system, if the current location of user A and the current location of user B are within a certain interval, specifically an interval determined between 10 m and 1 km, for example, within 100 m, These friend requests will be accepted as if they are from the same location. If you are separated by more than this distance, these friend requests will not be accepted. By doing this, it is possible to add a certain level of weight to the act of making a friend request.

In this embodiment, friendship relationships are hierarchical. That is, when making a friend request, it is possible to specify multiple friend relationships such as "general friends" in addition to "close friends." The friend request in Example 1 and Example 2 is a friend request for a "close friend." As before, friend requests as "general friends" are applied for, approved, and set, regardless of simultaneity or current location.

Similar to the above embodiment, friend requests that assume a certain level of trust include friend requests from the same home wireless LAN. That is, if there is a friend request with the same IP address, the social network service providing system will accept the friend request. Friend requests will not be accepted unless the IP addresses are the same.

Further, if the friend request is from the same terminal or smartphone, the friend request may be accepted. In this case, it is assumed that the parties are close friends who lend and borrow equipment. In this way, a certain amount of weight can be added to the act of requesting a friend.

According to the social network service providing system according to the present invention, since a certain level of trust is required when making a friend request, it is possible to avoid a situation in which a large number of friend requests are received from users with weak relationships.

1 Social network service management server 3 Smartphone 5 Personal computer

Claims (3)

A social network service providing system in which a first friendship relationship and a second friendship relationship can be specified according to the closeness of the friendship relationship,
If a first friend relationship is specified, a first friend request from the first user to the second user is received, and a second friend request from the second user to the first user is received. However, if the elapsed time from receiving the first friend request to receiving the second friend request exceeds a predetermined time, these friend requests are not accepted;
A social network service providing system characterized in that if a second friend relationship is designated, a friend request is accepted regardless of the elapsed time . The social network service providing system according to claim 1, wherein the predetermined time is set between 3 minutes and 10 minutes. When receiving the first friend request and the second friend request, location information of the first user and the second user is also received, and the first user and the second user 3. The social network service providing system according to claim 2, wherein the friend request is not accepted if the user is far away.

Images