JP2012208958A - Personal information management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a personal information management system capable of application/building or the like of a friend relationship only with an appropriate party.SOLUTION: A customer management server makes it possible to build a friend relationship between both users A and B, (1) in the case that both users A and B are already registered users and personal information of each other is registered in telephone books of each other, (2) in the case that both users A and B are the already registered users, the personal information of the user B is registered only in the telephone book of the user A and the personal information of the user A is not registered in the telephone book of the user B, and (3) in the case that only the user A is the already registered user, the personal information of the user B is registered only in the telephone book of the user A and the user B is a non-registered user.

Description

The present invention relates to a personal information management system and the like, and more particularly to a personal information management system and the like that appropriately manages personal information of registered users who use a social network.

In recent years, a social network service (Social Network Service) for constructing a social network on a communication network such as the Internet has become widespread. Social network services are designed to allow participants to introduce friends to each other and expand new friendships, and many of them adopt a method that cannot participate in social networks without an invitation from existing participants. ing.

As such a social network service, for example, a server-intensive service called “orkut” (for example, see Non-Patent Document 1) or “green” (for example, see Non-Patent Document 2) is known.

Here, the procedure for building a social network will be described. First, a person is invited to the social network in a form introduced by a close person who is an existing participant (user) of the social network. Next, a person invited to the social network joins the social network by registering his / her personal information. In addition, a new person who is invited to a social network invites them to the social network by introducing another close friend. By repeating each of these steps, a new human relationship is established through connection with another person who is not directly related to himself / herself.
In addition, users registered on social networks introduce themselves by entering their profiles in a pre-prepared format, while once registered on social networks, nicknames etc. for all registered users Search by nickname (nickname search) is possible.

By the way, many social network services are provided with a friendship construction function. The “friend relationship building function” refers to a search for a friend who wants to build a friend relationship (friend relationship) from the social network after a series of invitations to the social network, and a friend to that partner. It is a function to build friendships by applying for relationships and obtaining approval. With this function, a user who uses the social network service can newly establish a friend relationship with another person who is not directly related to the user.

“Orkut web site”, [online], [searched on September 27, 2009], Internet <URL: http://www.orkut.com> “Green web site”, [online], [searched on September 27, 2009], Internet <URL: http://www.gree.jp>

However, once the conventional friend relationship building function is registered in the social network service, a friend relationship application may be suddenly received from another person who is not directly related to itself.

The user who has received the application can also confirm the partner's profile and the like and reject the application. However, it is a bad aftertaste to forgive the human mind. Nonetheless, if you have a friendship with someone who is not directly related to you, you will share information that you don't want others to see, such as your detailed profile. There was a problem such as.

The present invention has been made in view of the circumstances described above, and only with an appropriate partner,
The purpose is to provide a personal information management system that enables application and construction of friendships.

A personal information management system according to the present invention includes a plurality of communication terminals provided with a telephone book, and a personal information management server provided with a personal information management server for managing user personal information registered in the telephone book of each communication terminal. The communication terminal includes a memory for storing a telephone book in which personal information of a plurality of persons including owner information relating to an owner of the communication terminal is stored, and a friend application to a user registered in the telephone book. Input means for performing input, and transmission means for transmitting the input friend application including the personal information of the user to the personal information management server, wherein the personal information management server A first storage means for storing owner information relating to the owner of the terminal, and a friend relationship for specifying both owners in a friend relationship permitting disclosure of the owner information to each other; Second storage means for storing information; first determination means for determining whether or not the owner information that matches the personal information of the user included in the friend application is stored in the first storage means; When it is determined by the first determination means that the owner information is stored, the first access means for accessing the communication terminal of another user who is the friend application destination, and the user of the friend application source user First, it is determined whether or not the personal information of the user of the friend application source is registered in the phone book of the other user by searching the phone book of the communication terminal of the other user using the owner information as a search key. 2 determination means and the second determination means, when it is determined that it is registered in the telephone book of the other user, Information identifying the other user is a user with the friend application destination is de application source and stored in the second storage means,
And a first registration means.

According to such a configuration, when the friend application source user and the friend application destination user are already registered users and each other's personal information is registered in each other's phone book, a friend relationship can be constructed. Therefore, as in the past, it is possible to prevent problems such as sudden application of friend relations from others who are not directly related to one another.

As described above, according to the present invention, it is possible to apply / construct a friend relationship only with an appropriate partner.

It is a figure which shows the architecture of the customer management system utilized in the social network service which concerns on this embodiment. It is a figure which shows the sequence of the user registration process which concerns on the same embodiment. It is the figure which illustrated the input screen displayed on the communication terminal which concerns on the embodiment. It is the figure which illustrated the registration contents of the customer database concerning the embodiment. It is a figure which shows the sequence of the friend relationship construction process of the 1st pattern which concerns on the embodiment. It is a figure which shows the sequence of the friend relationship construction process of the modification 1 of the 1st pattern which concerns on the embodiment. It is a figure which shows the sequence of the friend relationship construction process of the modification 2 of the 1st pattern which concerns on the embodiment. It is a figure which shows the sequence of the friend relationship construction process of the 2nd pattern which concerns on the embodiment. It is a figure which shows the sequence of the friend relationship construction process of the 2nd pattern which concerns on the modification of the embodiment. It is a figure which shows the friend relationship construction process sequence of the 3rd pattern which concerns on the embodiment.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
A. Embodiment (1) Configuration of Embodiment FIG. 1 is a diagram showing an architecture of a customer management system 100 used in a social network service according to this embodiment. Customer management system 100 is a Web
A customer management server 200 provided above and a communication network (such as the Internet) 40
And a plurality of communication terminals 300-k (k ≧ 2) that can exchange data with the customer management server 200 via 0. In the following description, when it is not necessary to distinguish each communication terminal, the communication terminal 300 is simply referred to.

The communication terminal 300 is a mobile phone having a mail function, an Internet connection function, etc., a PH
S (Personal Handyphone System), PDA (Personal Digital Assistance), etc., and input devices (CPU, memory, communication device (transmission means), operation buttons, touch panel, etc.)
Input means) and a display device such as an LCD. Communication terminal 3
00 can access the customer management server 200 connected to the Internet 400 to register the user's own personal information. In addition, the memory 31 of the communication terminal 300
Phonebook is stored in 0, and in this phonebook, the personal information of the user (that is, the owner) who owns the terminal, and personal information of others such as family members, friends, company colleagues, and related customers Is also registered. In the present embodiment, a mobile phone or the like is assumed as the communication terminal, but the present invention can also be applied to a personal computer that can access the customer management server 200 via a communication network such as the Internet.

The customer management server 200 is configured by a server computer or the like, and manages personal information of registered users stored in the customer database DB1 for users who use social network services (that is, registered users). It plays a role of managing friend relationship information (for example, registered user A and registered user B are in a friend relationship; details will be described later).

The customer management server 200 implements the functions of the customer management unit 210 and the friend relationship management unit 220 described below by operating each hardware resource constituting the server in cooperation with software stored in the memory. .

The customer information management unit 210 uses account information such as an ID and a password required when the user uses the system, and personal information of the registered user who uses the system (for example, an address, a telephone number, an email address, a nickname, etc.) ) In the customer database DB1.

The friend relationship management means 220 supports the construction of friend relationships between registered users, and also displays information representing friend relationships (information representing correspondence relationships between registered users in friend relationships; hereinafter referred to as friend relationship information) in a customer database. It is a means for registering and managing in DB1. Note that the friend relationship refers to a relationship between registered users who mutually permit disclosure of personal information.
(2) Operation of Embodiment Hereinafter, a process (hereinafter referred to as a user registration process) in which a new user registers with the customer management server 200 will be described, and then a process for building a friend relationship between registered users, which is a characteristic part of the present invention ( Friend relationship construction processing) will be described with reference to the drawings.
<User registration process>
FIG. 2 is a diagram showing a sequence of user registration processing.

The user A who desires to use the customer management system 100 accesses the customer management server 200 by inputting the address of the customer management server 200 to his / her communication terminal 300-1, and requests user registration (step S10). ). Upon receiving such a request, customer management server 200 sends an instruction to input information necessary for user registration to communication terminal 300-1 (step S20).

  FIG. 3 is a diagram illustrating an input screen displayed on communication terminal 300-1.

The user sets account information necessary for authentication of the registered user, such as an ID and a password, according to an instruction on the input screen shown in FIG. 3, and personal information (such as name, address, telephone number, mail address, nickname) Hereinafter, owner information) is set (step S30). The owner information may be any information as long as it represents the user's personal information, and the type and number thereof are not particularly limited.

The communication terminal 300-1 stores the account information and owner information set by the user in the memory 310 and transmits them to the customer management server 200 (step S40).
Upon receiving the account information and owner information from the communication terminal 300-1, the customer management means 210 of the customer management server 200 stores the received account information and owner information in the customer database DB1 for each user (step S50).

  FIG. 4 is a diagram illustrating the registered contents of the customer database DB1.

As shown in FIG. 4, in the customer database DB1, account information, owner information, and friend relationship information are registered in association with each registered user. If a friend relationship has not yet been established with any registered user, such as a newly registered user, the friend relationship information is not registered in the customer database DB1. As for the friend relationship information, a table representing friend relationships of all registered users, not for each registered user, may be separately registered in the customer database DB1.

When the registration of account information and owner information in the customer database (first storage means) DB1 is completed, the customer management server 200 notifies the communication terminal 300-1 that the new user registration has been completed (step S60), and the user The registration process ends. As described above, in the customer database DB1, for each registered user, only account information, registered user's personal information (that is, owner information), and friend information are registered, and other users recorded in the registered user's telephone directory are registered. Personal information is not registered in the customer database DB1. In other words,
Since personal information of other users (whether registered or not) is not registered in the customer database DB1, personal information of other users leaks due to unauthorized access to the customer management server 200. It becomes possible to prevent such a problem.
<Friend relationship building process>
Hereinafter, the case where the user A and the user B construct a friend relationship will be described with reference to a plurality of patterns. The friend relationship is not limited to one-to-one, but one-to-many (for example, user A
It is also applicable to the case of user B, user C, user D, etc.). In the following description, “accessing” represents a concept including notification by e-mail or the like.
A Server-led type A-1 When both users A and B are registered users and their personal information is registered in their phone books (first pattern)
FIG. 5A is a diagram showing a sequence of friend relationship construction processing of the first pattern (pattern 1).

User A operates communication terminal 300-1 and customer management server 20 by operating customer's own communication terminal 300-1 and entering account information to access customer management server 200.
Communication with 0 is established (step S110 → step S120). Customer management server 2
00 is the memory 31 of each communication terminal 300-1 when communication with the communication terminal 300-1 is established.
0 is accessed, and personal information of other persons (family, friends, colleagues, etc.) registered in the phone book of the user A is sucked up (step S130).

Then, the friend relationship management means (first determination means) 220 of the customer management server 200 matches (matches) the personal information that has been taken up with all owner information registered in the customer database (first storage means) DB1. By doing this, it is determined whether or not the owner information of the friend application destination user (here, user B) is registered in the customer database DB1 (step S140). When the owner information of the user B who is the friend application destination is not registered in the customer database DB1 (step S140; NO), the process proceeds to step S560 of pattern 3 described later (see FIG. 8).

However, here, the personal information extracted from the communication terminal 300-1 of the user A is the personal information of the user B and the user C, whereas the user B is registered as the owner information in the customer database DB1. The user C (that is, both the users B and C are registered users) and the user C registered as friend information in the customer database DB1
(That is, only the user C is in a friendship with the user A at the present time).

Therefore, the friend relationship management means (first access means) 220 is stored in the customer database DB.
1, if it is determined that the owner information of the user B who is the friend application destination is registered (step S <b>140; YES), it is determined that the user A and the user B may establish a friend relationship. The communication terminal 300-2 is accessed (step S150). The friend relationship management means 220 establishes communication with the communication terminal 300-2 (step S160).
Then, the memory 320 of the communication terminal 300-2 is accessed, and the personal information registered in the phone book of the user B is sucked up (step S170).

Then, the friend relationship management unit (second determination unit) 220 determines whether or not the personal information of the user A is included in the personal information sucked from the user B's telephone directory (step S180). If the friend relationship management unit 220 determines that the personal information of the user A is not registered in the phone book of the user B (step S180; NO), the friend relationship management unit 220 performs step S4 of pattern 2 described later.
00 (see FIG. 6).

On the other hand, when the friend relationship management means 220 determines that the personal information of the user A is registered in the phone book of the user B (step S180; YES), the registered users A and B are mutually stored in the mutual phone book. That personal information is registered (step S190)
. As described above, when the mutual personal information is registered in the mutual telephone directory, the friend relationship management unit 220 determines that the user A and the user B can establish the friend relationship, and the user A
The communication terminal 300-1 and the communication terminal 300-2 of the user B are notified of a message prompting the establishment of a friend relationship between the users A and B (step S200).

To explain with an example, the friend relationship management means 220 includes the communication terminal 300 of the user A.
-1 is notified of a text message such as "Can establish a friendship with user B. Do you approve friendship with user B?"
Also for 00-2, a text message of the same kind, for example, a text message such as “A friendship with user A can be established. Do you approve friendship with user A?” Is sent.

After confirming the text message, each of the users A and B, the communication terminals 300-1 and 300
-2 is appropriately operated to input that the friend relationship is approved (step S210, step S220). When such an operation is performed, this is notified to the friend relationship management means 220. Upon receiving this notification, the friend relationship management means (first registration means) 220 adds the user B as the friend information of the user A in the customer database (second storage means) DB1, and also adds the user A as the friend information of the user B. It adds (step S220).

When the friend relationship management unit 220 establishes a new friend relationship between the user A and the user B in this manner, a new friend relationship is established for the communication terminals 300-1 and 300-2. A message (for example, “a friendship has been newly established between user A and user B”) is sent (step S240), and the process ends.

As described above, in the case of this pattern, it is possible to establish a friend relationship when both users A and B are registered users and their personal information is registered in their phone books. . Therefore, it is possible to prevent problems such as sudden application of friend relations from others who are not directly related to the person.
<Modification 1>
The present invention is also applicable when the registered user A adds the user B to his / her telephone directory. In the following description, it is assumed that the user B is a registered user, but the same applies to a case where the user B is an unregistered user.

FIG. 5B is a diagram showing a sequence of friend relationship construction processing of the first pattern according to Modification 1. Steps corresponding to those in FIG. 5A are denoted by the same reference numerals, and detailed description thereof is omitted.

When the user A operates the communication terminal 300-1 to newly register the personal information of the user B (for example, name and telephone number) in his / her phone book (step S110a), the communication terminal 300
-1 accesses the customer server 200 and establishes communication with the customer management server 200 (
Step S110a → Step S120). When the communication with the communication terminal 300-1 is established, the friend relationship management unit 220 of the customer management server 200 searches the customer database using the newly registered personal information of the user B as a search key, thereby It is determined whether information is registered (step S140). Since the subsequent operation can be described in the same manner as in the case of pattern 1, it is omitted. As described above, the friend relationship may be established at the timing when the registered user adds the personal information of the new user to his / her telephone directory.
<Modification 2>
FIG. 5C is a diagram showing a sequence of friend relationship construction processing of the first pattern according to the modified example 2. Steps corresponding to FIG. 5B are assigned the same reference numerals, and detailed description thereof is omitted.

When the communication with the communication terminal 300-1 is established, the friend relationship management unit 220 of the customer management server 200 searches the customer database DB1 using the newly registered personal information of the user B as a search key, thereby It is determined whether owner information is registered (step S140). If the friend relationship management means 220 determines that the owner information of the user B is registered in the customer database DB1, a message inquiring whether or not the user A may be notified to the user A that the user B is a registered user (Notification permission judgment message) is sent to the communication terminal 300-2 (step S140a). User B is the communication terminal 3
An input operation (permission consent operation) that confirms the content of the notification permission message displayed on the display device 00-2, etc., and may notify user A that he (ie, user B) is a registered user (Step S140b). When the friend relationship management unit 220 receives a message indicating the permission consent operation from the communication terminal 300-2 of the user B, the friend relationship management unit 220 receives a message indicating that the user B is a registered user (for example, “friend” User B who is the application destination is a registered user. ”) (Step S140c), the process proceeds to step S150. Since the subsequent operation can be described in the same manner as in the case of pattern 1, it is omitted.
<Modification 3>
In the first pattern, the case where both users A and B are registered users has been described as an example. However, the present invention can be similarly applied to the case where either one of the users (for example, user A) is a newly registered user. . In such a case, a friend relationship may be established at the timing of new registration.

For example, when the user A newly registers, the customer information management unit 210 registers the personal information (owner information) of the user A in the customer database DB1, and the friend relationship management unit 220 stores the memory of the communication terminal 300-1. 310 is accessed, and personal information of other people (family members, friends, colleagues, etc.) registered in the phone book of the user A is sucked up.

Then, the friend relationship management means 220 uses the personal information that has been taken up and the customer database D
It is determined whether or not the owner information of the friend application destination user (here, user B) is registered in the customer database DB1 by performing matching (matching) with all owner information registered in B1. Since the subsequent operation can be described in the same manner as the first pattern, further description is omitted.
B User-driven type B-1 Both users A and B are registered users, personal information of user B is registered only in the phone book of user A, and personal information of user A is registered in the phone book of user B If not (second pattern)
FIG. 6 is a diagram showing a sequence of friend relationship construction processing of the second pattern (pattern 2).

A user A who desires a friendship with user B first operates his / her communication terminal 300-1 to access the customer management server 200, whereby the communication between the communication terminal 300-1 and the customer management server 200 is performed. Communication is established (step S310 → step S320). User B
Operates the own communication terminal 300-1 to input that he wishes to establish a friend relationship with the user B (hereinafter referred to as friend application information) (step S330). Note that the friend application information includes information for specifying the user B to be a friend target (for example, name, telephone number, etc .; hereinafter, friend target information).

When such an operation is performed, the friend application information of the user A is transmitted from the communication terminal 300-1 to the customer management server 200. The friend relationship management means 220 of the customer management server 200 searches the customer database DB1 using the friend application information of the user A from the communication terminal 300-1 as a search key (step S340). Specifically, the friend relationship management means 22
0 is a customer database DB using friend target information (here, user B's name, phone number, e-mail address, etc.) included in user A's friend application information as a search key.
By searching for 1, it is determined whether or not the owner information of the user B is registered in the customer database DB1 (step S350). If it is determined that the owner information of the user B who is the friend application destination is not registered in the customer database DB1 (step S35).
0; NO), the friend relationship management means 220 proceeds to step S560 of pattern 3 to be described later.

However, as in the case of Pattern 1 described above, the personal information extracted from the communication terminal 300-1 of the user A is the personal information of the user B and the user C, but is registered as owner information in the customer database DB1. It is assumed that the user B and the user C (that is, both the users B and C are already registered users) and only the user C is registered as friend information in the customer database DB1 (that is, (Only user C is currently in friendship with user A).

In this case, the friend relationship management unit 220 determines that the user A and the user B may establish a friend relationship because the owner information of the user B who is the friend application destination is already registered in the customer database DB1. First, the user B's communication terminal 300-2 is accessed (step S360). When communication with the communication terminal 300-2 is established (step S370), the friend relationship management unit 220 accesses the memory 320 of the communication terminal 300-2 and sucks up personal information registered in the user B's telephone directory ( Step S380). Then, the friend relationship management unit 220 determines whether or not the personal information of the user A is included in the personal information sucked from the user B's telephone directory (step S390). If the personal information of the user A is included in the personal information that has been taken up (step S390; YES), the process proceeds to step S190 of the above-described pattern 1 (see FIG. 5).

However, in this embodiment, the personal information of user A is not registered in the phone book of user B.
In this case, the friend relationship management means (first notification means) 220 has received a friend request from the user A (for example, “User B has requested a friend application from user A. Do you agree? )) And a message prompting the user to accept whether or not to accept the friend application (for example, “YES to accept,“ NO ”to accept or reject.”) 2 (step S400).

On the other hand, the user B grasps the content displayed on the display device of the communication terminal 300-2, and performs an input operation for accepting the friend application request from the user A (step S410). When this operation is performed, the communication terminal 300-2 returns a response indicating that the request for friend application is accepted to the customer management server 200.

Upon receiving the response from the communication terminal 300-2, the friend relationship management means 220 of the customer management server 200 receives a message indicating that a friend application has been accepted for the communication terminal 300-1 (for example, “user A, user B Your friend request has been accepted by. "
) Is sent (step S420).

Further, the friend relationship management means 220 accesses the user B communication terminal 300-2 to register the personal information of the user A in the phone book of the user B communication terminal 300-2, and the user B in the user B phone book. A's personal information is written (step S430). When this process ends, the friend relationship management means 220 sends the user A to the user B communication terminal 300-2.
A message that the establishment of the friend relationship with the user (for example, “Friend relationship with the user A has been established.”) And a message that the personal information of the user A is newly registered in the phone book ( For example, “User A's personal information has been newly added.”) Is sent (step S440).

Finally, the friend relationship management means (second registration means) 220 accesses the customer database (second storage means) DB1, and “registered user B” as friend information of the registered user A and “friend information of registered user B”. Each registered user A ”is registered (step S450).
).

As described above, in the case of this pattern, both users A and B are registered users, and personal information of user B is registered only in user A's phone book. When personal information is not registered, a friendship can be established. Even in such a case, it is assumed that the personal information of user B is registered in the phone book of user A (that is, it is assumed that user A knows the personal information of user B). Therefore, even in this pattern, it is possible to prevent problems such as sudden application of friend relations from others who are not directly related.
<Modification 1>
It may be confirmed whether or not user B can be informed that user B is a registered user.

FIG. 7 is a diagram illustrating a sequence of friend relationship construction processing of the second pattern according to the first modification. Steps corresponding to those in FIG. 6 are denoted by the same reference numerals, and detailed description thereof is omitted.

If the friend relationship management means 220 determines that the user B is a registered user as a result of matching (matching) with all owner information registered in the customer database DB1 (
First, the communication terminal 300-2 of the user B is accessed and communication is established between the communication terminal 300-2 and the customer management server 200 (step S360 → step S370).

Then, the friend relationship management unit 220 confirms whether or not the user A can tell the user A that the user B is a registered user (for example, “user (user B) indicates that the user is a registered user). Is it okay to tell Mr. A? ") To the communication terminal 300-2 (step S360a). Thereafter, when the user B performs an input operation indicating that he / she is a registered user using the communication terminal 300-2 (step S360b), the friend relationship management unit 220 is notified of this.

Upon receiving this notification, the friend relationship management unit 220 receives the communication terminal 300-of the user A.
1 and a friend B requesting user B is a registered user
For example, “User B who is currently applying for a friend is a registered user” is sent (step S360c), and the process proceeds to step S380. The user A knows that the user B who is applying for a friend is a registered user like the user A by confirming the text message displayed on the display device of the communication terminal 300-1. Note that the operation after proceeding to step S380 is the same as that of the pattern 2 of the present embodiment, and thus the description thereof is omitted.

In addition, when an input operation (for example, when it is not desired to establish a friend relationship with the user A) that the user B does not want to be taught as a registered user, the friend relationship management unit 220 The user A is not notified that the user B is a registered user.

As described above, information regarding whether the user B who has applied for a friend is a registered user or an unregistered user may not be disclosed to the user A without the approval of the user B.
B User-driven type B-2 When only user A is a registered user, personal information of user B is registered only in the phone book of user A, and user B is an unregistered user (third pattern)
FIG. 8 is a diagram showing a sequence of friend relationship construction processing of the third pattern (pattern 3).

A user A who desires a friendship with user B first operates his / her communication terminal 300-1 to access the customer management server 200, whereby the communication between the communication terminal 300-1 and the customer management server 200 is performed. Communication is established (step S510 → step S520). User A
The user inputs his / her own communication terminal 300-1 to the effect that he wishes to establish a friend relationship with user B (hereinafter referred to as friend application information) (step S530). Note that the friend application information includes information for specifying the user B to be a friend target (for example, name, telephone number, etc .; hereinafter, friend target information).

When such an operation is performed, the friend application information of the user A is transmitted from the communication terminal 300-1 to the customer management server 200. The friend relationship management means 220 of the customer management server 200 searches the customer database DB1 using the friend application information of the user A from the communication terminal 300-1 as a search key (step S540). Specifically, the friend relationship management means 22
0 is a customer database DB using friend target information (here, user B's name, phone number, e-mail address, etc.) included in user A's friend application information as a search key.
By searching for 1, it is determined whether or not the owner information of the user B is registered in the customer database DB1 (step S550). When the owner information of the user is registered in the customer database DB1, the process proceeds to step S350 of pattern 2 (see FIG. 6) described above or to step 150 of pattern 1 (see FIG. 5A).

However, here, the personal information extracted from the communication terminal 300-1 of the user A is the personal information of the user B and the user C, whereas only the user C is registered as the owner information in the customer database DB1. It is assumed that only the user C is registered as friend information in the customer database DB1 (that is, only the user C is currently in a friend relationship with the user A).

Therefore, since the owner information of the user B is not registered in the customer database DB1 (step S550; NO), the friend relationship management unit 220 first sets the friend relationship with the user B in order to establish a friend relationship. The registered user B is invited to the system, and it is determined that the user B needs to be registered (step S560). Based on this determination, the friend relationship management means (second notification means) 220 determines the communication terminal 300-of the user B.
2 is established, communication between the communication terminal 300-2 and the customer management server 200 is established (step S560 → step S570). And friend relationship management means 220
Sends a message to B's communication terminal 300-2 that Mr. B is invited to the system and that Mr. A has requested a friend (for example, “A has been invited to use the system. Mr. A's friend When approving the relationship, the necessary information is entered and user registration is performed, and “YES” is selected for the friend application. ”) Is sent (step S580).

From the content displayed on the display device of the communication terminal 300-2, the user B grasps that the user A has been invited to use the system and that there has been a friend application. User B uses communication terminal 300-2 to perform an input operation for accepting an invitation from user A and a request for friend application (step S590). Specifically, the user B is the communication terminal 3
Enter the user's own personal information (ie phone number, name, etc.) necessary for user registration by operating the 00-2 operation button, touch panel, etc.
Input to select “YES”.

When this operation is performed, the access control management means (third registration means) 210 of the customer management server 200 newly registers the personal information of the user B as owner information in the customer database (first storage means) DB1 (step S600). Then, friend relationship management means 22
0 is a message indicating that the friend application has been accepted for the communication terminal 300-1 of the user A (for example, “the friend application has been accepted by the user A and the user B”).
) Is sent (step S610). Furthermore, the friend relationship management unit 220 is configured to register the personal information of the user A in the phone book of the communication terminal 300-2 of the user B.
00-2 and write the personal information of user A in the phone book of user B (step S).
620). When the processing is completed, the friend relationship management unit 220 notifies the user B that the user registration has been completed with respect to the communication terminal 300-2 of the user B, and a message that the construction of the friend relationship with the user A has been completed (for example, “registration”). The work has been completed and a friendship with user A has been established. "), And a message that user A's personal information has been newly registered in the phone book (
For example, “User A's personal information has been newly added.”) Is sent (step S63).
0).

Finally, the friend relationship management means (third registration means) 220 accesses the customer database DB1, and registers “registered user B” as friend information of the registered user A and “registered user A” as friend information of the registered user B. Registration is performed (step S640).

As described above, in the case of this pattern, only the user A is a registered user, the personal information of the user B is registered only in the user A's telephone directory, and the user B is an unregistered user. Construction is possible. Even in such a case, the user B is added to the phone book of the user A.
Of personal information is registered (that is, it is assumed that user A knows personal information of user B). Even in this pattern, suddenly from other people who are not directly related, It becomes possible to prevent problems such as application for friend relations.
B. Others <Application Example 1>
You may make it select the kind of friend relationship to construct | assemble according to the familiarity with the user registered into the telephone directory. For example, depending on the familiarity, either a business friend relationship or a private friend relationship can be established.

Here, the type of friend relationship is determined according to the type and number of personal information (at least one of the parameters) of the friend application destination user registered in the telephone directory. For example, if the registered personal information is only “phone number”, it is possible to build a business friend relationship. If the registered personal information is “phone number”, “birthday”, and “nickname” It is possible to build a private friend relationship. When a business friend relationship is established, only limited personal information (business related information) such as “telephone number” and “office address” can be shared among users who have established the friend relationship. .

On the other hand, when a private friend relationship is established, there are no restrictions (or only some restrictions) such as “phone number”, “nickname”, and “self-introduction photo” among the users for whom the friend relationship is established. E) Personal information (private related information) can be shared.

When communication terminal (determination means, application means) 300 determines the type of friend relationship based on at least one parameter of the type or number of personal information of the friend application destination user, the friend application is made in this type of friend relationship. I do. Note that the operation after the friend relationship management unit 220 of the customer management server 200 receives the friend application can be described in the same manner as in the present embodiment and the like, and is therefore omitted.

According to such a configuration, it is possible to change information that can be shared between a friend who has a business relationship and a friend who has a relationship with both public and private.

Note that the conditions for determining the type of friend relationship and the types and number of personal information that can be shared according to the type of friend friend relationship may be stored in the memory of the communication terminal 300. This condition may be fixed or rewritable.
When rewriting is possible, rewriting may be performed by an input operation of the communication terminal 300, or the customer management server 200 may be configured to rewrite.

Communication terminal (determination means) 300 may determine whether or not to accept a friend application itself, instead of determining the type of friend relationship. For example, regarding a user who attempts a friend application, if the personal information registered in the phone book is only “phone number”, the friend application itself is rejected. On the other hand, if the personal information registered in the phone book is “phone number”, “birthday”, and “nickname” for a user who attempts a friend application, the friend application is permitted. When the friend application is permitted, the communication terminal (application unit) 300 makes a friend application to the customer management server 200. It should be noted that the determination condition for accepting the friend application itself may be at least one of the type and number of personal information registered in the telephone directory.

Furthermore, it is possible to arbitrarily set under what conditions it is possible to construct a business friend relationship or a private friend relationship. Further, in this application example, the case where there are two types of friend relationships (business friend relationship and private friend relationship) is exemplified, but it is needless to say that there may be three or more types.

Further, the type and number of information that can be shared among users by establishing a friend relationship can be arbitrarily set. The settable conditions described above may be arbitrarily set by each user using his / her communication terminal 300 or may be arbitrarily set by the customer management server 200.
<Application example 2>
After the friend relationship is established between the users, various information registered in the owner information may be shared. For example, when a friendship is established for user A and user B, the name, address, telephone number, email address,
The birthday, nickname, and self-introduction photo are registered in the customer database DB1, whereas the personal information of the user A registered in the user B's telephone directory is a name, a telephone number, and an e-mail address.

In such a case, the friend relationship management means (reflecting means) 220 of the customer management server 200 includes the owner information of the user A registered in the customer database DB1 and the personal information of the user A registered in the phone book of the user B. By comparing with the information, these differences (here:
Address, birthday, nickname, self-introduction photo; hereinafter, difference information) may be obtained, and the obtained difference information may be added (reflected) to the personal information of user A registered in user B's telephone directory. According to such a configuration, it is possible to share information with a higher new density among users who have established friendships.

In addition, the steps of the processes shown in the present embodiment and each modification can be executed in any order or in parallel within a range that does not contradict the processing contents. Further, in this specification and the like, the term “means” does not simply mean a physical means, but also includes a case where the functions of the means are realized by software. Furthermore, the function of one means may be realized by two or more physical means, or the functions of two or more means may be realized by one physical means. The software development support program according to the present invention is a C program.
By downloading through various recording media such as optical disks such as D-ROM and DVD-ROM, magnetic disks, and semiconductor memories, or via a communication network.
Can be installed or loaded on a computer.

DESCRIPTION OF SYMBOLS 100 ... Customer management system, 200 ... Customer management server, 210 ... Customer management means, 220 ...
Friend relationship management means, DB1 ... customer database, 300 ... communication terminal, 310 ... memory.

Claims (7)

A personal information management system comprising a plurality of communication terminals provided with a telephone book and a personal information management server for managing personal information of users registered in the telephone book of each communication terminal,
The communication terminal is
A memory for storing a telephone book in which personal information of a plurality of persons including owner information related to the owner of the communication terminal is registered;
An input means for making an input for making a friend application to a user registered in the phone book;
Transmitting means for transmitting the inputted friend application including the personal information of the user to the personal information management server,
The personal information management server includes:
First storage means for storing owner information related to the owner of each communication terminal;
Second storage means for storing friend relationship information for identifying the two owners who are in a friend relationship allowing the disclosure of the owner information to each other;
First determination means for determining whether or not the owner information that matches the personal information of the user included in the friend application is stored in the first storage means;
If it is determined by the first determination means that the owner information is stored,
First access means for accessing a communication terminal of another user who is the friend application destination;
By searching the phone book of the communication terminal of the other user using the owner information of the user of the friend application source as a search key, the personal information of the user of the friend application source is registered in the phone book of the other user. Second determination means for determining whether or not,
If it is determined by the second determination means that the user is registered in the phone book of the other user, the friend relationship information includes a user who is the friend application source and another user who is the friend application destination. A personal information management system comprising: first registration means for storing information for identifying the second storage means in the second storage means. If it is determined by the second determination means that it is not registered in the phone book of the other user, a friend application is sent from the user who is the application source to the communication terminal of the other user that is the friend application destination. A first notification means for notifying that there has been,
Information specifying the user who is the friend application source and the other user who is the friend application destination as the friend relationship information when there is an input to accept the application from the communication terminal of the other user The personal information management system according to claim 1, further comprising: a second registration unit that stores the second storage unit in the second storage unit. If it is determined by the first determination means that the owner information is not stored, the communication terminal of another user who is the friend application destination is prompted to register a user in the system, and the application source A second notification means for notifying that a user has applied for a friend;
When the other user's communication terminal inputs the personal information of the other user corresponding to the user registration and the input for accepting the application, the personal information of the other user is obtained as owner information. And storing in the second storage means information identifying the user who is the friend application source and the other user who is the friend application destination as the friend relationship information. The personal information management system according to claim 1, further comprising: 3 registration means. By comparing the owner information of the user of the application source stored in the first storage means with the personal information of the user of the application source registered in the phone book of the other user, the owner information and Further comprising a reflecting means for obtaining difference information representing a difference with the personal information, and reflecting the obtained difference information in the personal information of the user of the application source registered in the telephone book of the other user. The personal information management system according to any one of claims 1 to 3. Personal information comprising a plurality of communication terminals provided with a telephone book and a personal information management server capable of establishing a friendship between the users possessing each communication terminal and allowing the disclosure of owner information to each other A management system,
The communication terminal is
A memory for storing a telephone book in which personal information of a plurality of persons including owner information related to the owner of the communication terminal is registered;
An input means for making an input for making a friend application to a user registered in the phone book;
Determining means for determining the type of friend based on at least one of the type or number of personal information of the user of the friend application destination registered in the telephone book;
Application means for making a friend application with the determined friend type for the personal information management server,
A personal information management system in which the type of owner information that is permitted to be disclosed differs among users who have established the friend relationship according to the type of friend. The personal information management system according to claim 5, further comprising storage means for storing correspondence information indicating correspondence between the type of the friend and the type of owner information permitted to be disclosed. Personal information comprising a plurality of communication terminals provided with a telephone book and a personal information management server capable of establishing a friendship between the users possessing each communication terminal and allowing the disclosure of owner information to each other A management system,
The communication terminal is
A memory for storing a telephone book in which personal information of a plurality of persons including owner information related to the owner of the communication terminal is registered;
An input means for making an input for making a friend application to a user registered in the phone book;
A determination means for determining whether to permit friend application based on at least one of the type or number of personal information of the user of the friend application destination registered in the telephone book;
A personal information management system comprising: application means for making a friend application to the personal information management server when it is determined that the friend application is permitted.

Images