JP2008234340A - Internet communication server - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To classify, register and display the relationship of a user in a communication site without needing the user's complicated operation. <P>SOLUTION: When a user 21 accesses a homepage of the other user 21, a user information processing part 12 analyzes, when this access is the first access, a via page just before this access, and stores the via page information in a user information database 13 as contact information. In the homepage, a registration name of the user 21 on friendly terms with the user 21 of the homepage is displayed, and the contact information with the user 21 on the friendly terms is read from the user information database 13 and displayed. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to an Internet communication server, and more particularly to an Internet communication server that operates a communication site that allows users to access each other's homepages.

Conventionally, there is a communication site called SNS (social network service) as a service using the Internet. Within the site, users can freely access their homepages and build new relationships through connections such as common hobbies, preferences, and residential areas. Patent Document 1 proposes a communication system in which a personal network is divided into a personal relationship and a public relationship, and the personal relationship network can be used only by both users. .
JP 2005-353099 A

  Some communication sites divide relationships between users by categories such as “friends”, but none disclosed a method for automatically performing further categorization. The present invention has been made in view of such circumstances, and it is an object of the present invention to provide an Internet communication server that classifies and registers user relationships and displays them without complicated operations by the user.

  In order to achieve the above object, the Internet communication server according to claim 1 is provided with a dedicated homepage by performing user registration, and Internet communication that operates a communication site that allows each registered user to access each other's homepage. In the server, a database that stores, as contact information, page information immediately before an arbitrary first user accesses a home page of a second user who is not in a friendship relationship, the first user and the second user, A friend registration receiving means for receiving a friend registration that becomes a friend relationship, and a friend information display means for indicating a user who is in friendship with the user on each user's home page, the friend information display means, together with the friend information, With friends based on the database Characterized in that to display the contact information became Rukikkake.

  Thereby, the user who accessed the homepage of the other user can know the contact information between the user of the homepage and the friend of the user, and can activate communication.

  As shown in claim 2, in the Internet communication server according to claim 1, in the friend information display step, before the first user and the second user are registered as friends, the first user When the second user's home page is accessed, only the contact information is displayed on the home page without displaying the friend information of the first user.

  Thereby, the user who accessed the homepage of another user can know the past contact information with the user of the homepage, and can activate communication.

  As shown in claim 3, in the Internet communication server according to claim 1 or 2, the friend information display means displays the oldest contact information among the contact information.

  As shown in claim 4, in the Internet communication server according to claim 1 or 2, the friend information display means displays the latest contact information among the contact information.

  According to a fifth aspect of the present invention, in the Internet communication server according to the first aspect, the friend information display means displays the contact information immediately before the friend registration of the contact information.

  In order to achieve the above object, the Internet communication server according to claim 6 is provided with a dedicated homepage by performing user registration, and Internet communication that operates a communication site that allows registered users to access each other's homepage. In the server, a database that stores, as contact information, the page information immediately before an arbitrary user accesses a home page of a user who is not in a friend relationship, and an arbitrary user and a user who is not in a friend relationship with the arbitrary user are friends A friend registration receiving means for receiving a friend registration to be related; a friend information display means for showing a detailed relationship with the user in the friend relationship; Detailed relationship before Editing means for each user to edit, and the friend information display means, when the detailed relationship is not edited, the detailed relationship with the contact information that triggered the friend based on the database It is characterized by being displayed as.

  Thereby, friend relationship information can be displayed in more detail, and communication can be activated.

  7. The Internet communication server according to claim 6, wherein the friend information display means displays the oldest contact information among the contact information when the detailed relationship is not edited. It is characterized by.

  As shown in claim 8, in the Internet communication server according to claim 6, when the detailed relationship is not edited, the friend information display means displays the contact information immediately before the friend registration among the contact information. It is characterized by displaying.

  ADVANTAGE OF THE INVENTION According to this invention, the internet communication server which can make communication more active by displaying the relationship of the opportunity which became the friend between users can be provided.

  The best mode for carrying out the present invention will be described below with reference to the accompanying drawings.

<First Embodiment>
FIG. 1 is a schematic diagram of a network provided with an Internet communication server 10 (hereinafter referred to as server 10) that provides a communication site according to the present invention. The server 10 includes a web server 11, a user information processing unit 12, and a user information database 13, and is connected to a plurality of clients (users) 21 via the Internet 20. The web server 11 provides a web page to the user 21, and the user information processing unit 12 analyzes the access status of the user 21 to the web page provided by the web server 11, and uses the access information as user information. A process for saving in the information database 13 or a process for displaying the data saved in the user information database 13 on the web page is performed.

  In the communication site operated by the server 10, a dedicated home page is provided to each user when membership registration is performed. This home page has a function of releasing his / her profile and diary, friends registered as friends to each other, and the like to other users. In addition, this communication site has a community function that allows you to interact on a bulletin board etc. about specific topics such as common hobbies and residential areas, and by registering to participate in the desired community, you can directly access the registered community from your homepage Can participate.

  A method for creating the user information database 13 and a method for displaying data stored in the user information database 13 will be described with reference to the flowchart shown in FIG.

  First, the user 21 logs in to the communication site (step S201). The user information processing unit 12 confirms the user ID of the user 21 (step S202). Here, it is assumed that the user ID of the logged-in user 21 is 0002 and the registered name is B. Next, it is determined whether or not the user ID 0002 (registered name B) has logged out (step S203). If not logged out, it is determined whether or not another page has been accessed (step S204). Access to other pages is performed by following links from the currently displayed page. When access to another page is performed, it is determined whether or not this access destination page is the home page of another user 21 (step S205). If it is not the home page of another user 21, the web server 11 displays the destination web page (step S210) and returns to step S203. If it is the home page of another user 21, the user ID of the user 21 who is the owner of the home page is confirmed (step S206). Here, the user ID of the user 21 who is the owner of this home page is 0001, and the registered name is A. Next, the user ID 0001 (registered name A) who is the owner of this home page and the user information of the user 21 who is the friend are read from the user information database 13 (step S207).

  Here, the user information database 13 will be described. FIG. 3 is a diagram showing data stored in the user information database 13.

  In the user information database 13, in addition to the user ID of each user 21, the user ID of the user 21 who has accessed the home page of the user 21, the presence / absence of friend registration with the user 21, the page immediately before the access, that is, which Via page information indicating whether the page of the user 21 is accessed from the page link and the date of access are stored. In the present embodiment, the access page and date when the accessed user 21 accesses the home page for the first time are stored, but the updated information may be updated as needed.

  The row (a) of FIG. 3 shows that the user ID 0002 (registered name B) accessed the home page of the user ID 0001 (registered name A) on November 3, 2006 via the ramen community page. The user ID 0002 (registered name B) indicates that the user ID 0001 (registered name A) is registered as a friend. In FIG. 3B, the user ID 0003 (registered name A) is added to the home page of the user ID 0001 (registered name A) and the user ID 0003 (registered name C) is passed through the home page of the user ID 0004 (registered name D) on March 1, 2007. The user ID 0003 (registered name C) indicates that the user is registered as a friend with the user ID 0001 (registered name A).

  In step S207 of FIG. 2, when the user ID 0001 (registered name A) who is the owner of the accessed home page and the user information of the user 21 who is the friend are read, the user ID 0001 (owner of this home page) It is determined whether or not two users of the registered name A) and the user ID 0002 (registered name B) who has accessed this home page are friends. It is determined from the data in the user information database 13 that these two users are registered as friends, and the process proceeds to step S210, and the home page of the user ID 0001 (registered name A) is displayed. FIG. 4A shows a display of the home page of user ID 0001 when user ID 0002 (registered name B) accesses the home page of user ID 0001 (registered name A).

  Based on the data stored in the user information database 13, the user 21 's home page is the user 21' s registered name of the user 21 who has been registered as a friend of the user 21, and a chance to become a friend of the user 21. As information, the transit page information immediately before the first access to the home page is displayed.

  As shown in FIG. 4A, on the home page of the user ID 0001 (registered name A), two registered names of the user ID 0002 (registered name B) and the user ID 0003 (registered name C) are displayed as friend information. At the same time, access information via the soccer community on October 28, 2006, which is the first contact information with the user ID 0002 (registered name B), and the user ID 0003 (registered name) are used as the chance information to become friends with the two users. C) and access information via the home page of user ID 0004 (registered name D) on March 1, 2007, which is the first contact information with C). The first access to the home page of the user ID 0001 (registered name A) by the user ID 0002 (registered name B) is access via the page of the ramen community on November 3, 2006 shown in FIG. As shown in FIG. 3C, since there is access information to the home page of the user ID 0002 (registered name B) by the user ID 0001 (registered name A) on October 28, 2006, the oldest information here is displayed. To do.

  When the display of the home page ends, the process returns to step S203. The above processing is continued until the user ID 0002 (registered name B) logs out.

  Next, a case where the user ID 0004 (registered name D) accesses the home page of the user ID 0001 (registered name A) will be described with reference to FIG.

  Similarly to the previous time, when the user ID 0004 (registered name D) is logged in (step S201), the user ID is confirmed (step S202), and the user ID 0001 (registered name A) is moved to the home page (steps S204 and S205). The user ID of the owner is confirmed (step S206). The user information processing unit 12 reads the user information of the user ID 0001 (registered name A) from the user information database 13 (step S207). In step S208, it is determined whether or not a friend is registered. As shown in FIG. 3, since user ID 0001 (registered name A) and user ID 0004 (registered name D) are not registered as friends, the process proceeds to step S209, and the home page of user ID 0001 (registered name A) is displayed.

  FIG. 4B is a diagram showing the display of the home page of the user ID 0001 when the user ID 0004 (registered name D) accesses the home page of the user ID 0001 (registered name A). As described above, since the user ID 0004 (registered name D) accessing the home page of the user ID 0001 (registered name A) is not registered as a friend with the user ID 0001 (registered name A), the friend of the user ID 0001 (registered name A). The user ID 0004 (registered name D) is not displayed in the information. However, based on the data in the user information database 13, the transit page information immediately before the first access to the home page of the user ID 0001 (registered name A) and its date are displayed as contact information.

  When the display of the home page of the user ID 0001 (registered name A) is finished, it is determined whether this access is the first access (step S211). Since the user ID 0004 (registered name D) has accessed the home page of the user ID 0001 (registered name A) before, the process returns to step S203. The above processing is continued until the user ID 0004 (registered name D) logs out.

  Next, a case where the user ID 0006 (registered name F) accesses the home page of the user ID 0001 (registered name A) will be described with reference to FIG.

  As before, when the user ID 0006 (registered name F) logs in (step S201), the user ID is confirmed (step S202), and the user ID 0001 (registered name A) is moved to the home page (steps S204 and S205). The user ID of the home page owner is confirmed (step S206). The user information processing unit 12 reads the user information of the user ID 0001 (registered name A) from the user information database 13 (step S207). In step S208, it is determined whether or not a friend is registered. As shown in FIG. 3, since the user ID 0001 (registered name A) and the user ID 0006 (registered name F) are not registered as friends, the process proceeds to step S209.

  FIG. 4C is a diagram showing a display of the home page of the user ID 0001 when the user ID 0006 (registered name F) accesses the home page of the user ID 0001 (registered name A). As described above, since the user ID 0006 (registered name F) accessing the home page of the user ID 0001 (registered name A) is not registered as a friend with the user ID 0001 (registered name A), the friend of the user ID 0001 (registered name A). The user ID 0006 (registered name F) is not displayed in the information. Further, since the home page of the user ID 0001 (registered name A) is accessed for the first time, no data is stored in the user information database 13. For this reason, as shown in FIG.4 (c), it displays that it is the first access as contact information. Note that it is only necessary to be able to notify that this is the first access, and the contact information need not be displayed.

  When the display of the home page of the user ID 0001 (registered name A) is finished, it is determined whether or not it is the first access (step S211). Since this is the first access here, the process proceeds to step S212. In step S212, the user information processing unit 12 analyzes the immediately preceding transit page in this access. Here, if the user ID 0006 (registered name F) accesses the home page of the user ID 0001 (registered name A) via the movie community page on March 13, 2007, the user information processing unit 12 uses this information. Is stored in the user information database 13 (step S213). FIG. 5 is a diagram showing the data to be stored. When the saving ends, the process returns to step S203, and the above processing is continued until the user ID 0006 (registered name F) logs out.

  As described above, the information in the user information database 13 may be updated to the latest information. In this case, the update is stopped when the friend registration is performed. In other words, when a friend is registered, the immediately preceding transit page information is stored, and the transit page information is displayed as a friend registration opportunity. Moreover, since it is always updated to the latest information until registering as a friend, the latest information is always displayed as contact information.

  Further, every time the user 21 accesses the home page of another user 21, information on the immediately preceding transit page in all accesses may be stored in the user information database 13 as a contact history. In this case, the contact information displayed on the home page may be displayed by selecting arbitrary data, or all data may be displayed.

<Second Embodiment>
The communication site according to the second embodiment of the present invention can edit detailed friend relationship information for the user 21 who has registered as a friend, and displays this friend relationship information on the home page together with the friend information. If the friendship information is not edited, the contact information that triggered the friendship is displayed as the friendship information.

  First, editing of friendship information will be described with reference to FIG. First, the user 21 applies for friend registration to the user 21 whose new density has increased (step S61). The user 21 who has received the application for friend registration determines whether or not to accept the application (step S62). If accepted, the friendship information is edited (step S63). The friend relationship information is intended to make it easier for a third party to see the relationship between friends, and the friend relationship information is edited in accordance with this purpose. The friend relationship may be edited in advance by the user 21 who has applied for friend registration. When the editing of the friend relationship information ends, the friend's user ID, friend registration date, and friend relationship information are stored in the user information database 13, and the friend registration ends. If not accepted, friend registration is not performed, and the user information database 13 ends without being changed.

  Moreover, the friend relationship information can be edited even if the friend is registered without performing the friend registration. Also, the friend relationship information edited at the time of friend registration can always be changed. The change of the friend relationship information after friend registration will be described with reference to FIG.

  First, the user 21 accesses his home page (step S71). You can change the friendship information displayed on your homepage. Here, when the friendship information is edited (step S72), it is stored in the user information database 13 (step S73), and the change of the friendship information is completed. When the friend relationship information is not edited, the user information database 13 is terminated without being changed. Here, it is also possible to delete the friendship information once edited.

  FIG. 8 is a diagram showing data stored in the user information database 13. In addition to the user ID of each user 21, the user ID of the friend of each user 21, friend registration date, and friend relationship information are stored. In this example, the user ID 0001 (registered name A) edits the friend relationship information of the user ID 0002 (registered name B) that is a friend registered on March 4, 2007 as “ramen shop search friend”. Further, the friend relationship information of the user ID 0003 (registered name C), which is another friend of the user ID 0001 (registered name A), is not edited.

  FIG. 9A shows the home page display of user ID 0001 (registered name A) in the present embodiment. On the home page of the user ID 0001 (registered name A), two registered names of the user ID 0002 (registered name B) and the user ID 0003 (registered name C) are displayed as friend information, and details about the two users are displayed. Friendship information is displayed. From the data of the user information database 13 shown in FIG. 8, "Ramen shop search friend" is displayed as friend relationship information with the user ID 0002 (registered name B), and at the same time the friend registration date is displayed. Also, since the friendship information with the user ID 0003 (registered name C) has not been edited, it is displayed from the contact information in the user information database 13 shown in FIG. 3 that the user ID 0004 (registered name D) has been accessed from the home page. At the same time, the date of friend registration is displayed.

  In this way, the friendship information displayed on the home page can be edited. If the friendship information is not edited, the contact information that triggered the friendship is displayed.

  In addition, when browsing the home page of the user ID 0002 (registered name B), as shown in FIG. 9B, the user ID 0001 (registered name A) and the user ID 0005 (registered name) that are friends of the user ID 0002 (registered name B). In addition to the display of E), friendship information is displayed. Here, as shown in FIG. 8, the user ID 0002 (registered name B) does not edit the friendship information and displays contact information as the friendship information. As described above, the friend relationship information of the user ID 0001 (registered name A) and the user ID 0002 (registered name B) registered as friends with each other may differ depending on the homepage to be browsed. In order to prevent this, the content edited by one side may be shared.

  If the friendship information is freely edited, there is a possibility that the friendship information is undesirably described. In order to prevent this, the content edited by one side may be approved by the other side.

  In the present embodiment, when the friendship information is not edited, the oldest contact information is displayed as the friendship information. However, the contact information immediately before the friend registration may be displayed.

FIG. 1 is a schematic diagram of a network provided with an Internet communication server 10 according to the present invention. FIG. 2 is a flowchart showing a method for creating the user information database 13. FIG. 3 is a diagram showing data stored in the user information database 13. FIG. 4 is a diagram showing a home page display. FIG. 5 is a diagram showing data to be stored. FIG. 6 is a flowchart showing a flow of operations for registering friends. FIG. 7 is a flowchart showing a flow of changing friendship information. FIG. 8 is a diagram showing data stored in the user information database 13. FIG. 9 is a diagram showing a home page display.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 10 ... Internet communication server, 11 ... Web server, 12 ... User information processing part, 13 ... User information database, 20 ... Internet, 21 ... Client (user)

Claims (8)

In an Internet communication server that operates a communication site that allows users to access each other's homepage by giving a dedicated homepage by performing user registration.
A database that stores, as contact information, page information immediately before an arbitrary first user accesses a home page of a second user who is not in a friendship;
Friend registration accepting means for accepting friend registration in which the first user and the second user have a friendship;
A friend information display means for indicating a user who has a friendship with the user on the homepage of each user,
The said friend information display means displays the contact information which became a friend based on the said database with the said friend information, The internet communication server characterized by the above-mentioned.   In the friend information display step, when the first user accesses the second user's homepage before the first user and the second user are registered as friends, the first user's homepage is displayed on the homepage. 2. The Internet communication server according to claim 1, wherein only the contact information is displayed without displaying friend information.   The Internet communication server according to claim 1 or 2, wherein the friend information display means displays the oldest contact information among the contact information.   The Internet communication server according to claim 1 or 2, wherein the friend information display means displays the newest contact information among the contact information.   2. The Internet communication server according to claim 1, wherein the friend information display means displays the contact information immediately before the friend registration among the contact information. In an Internet communication server that operates a communication site that allows users to access each other's homepage by giving a dedicated homepage by performing user registration.
A database that stores the previous page information when a user accesses a homepage of a user who is not in a friendship relationship as contact information;
A friend registration accepting means for accepting friend registration in which any user and a user who is not in a friendship with the arbitrary user have a friendship;
Showing each user's homepage a user who is in a friendship with the user, and a friend information display means for showing a detailed relationship with the user in the friendship;
Editing means for each user to edit the detailed relationship;
The said friend information display means displays the contact information which became a friend based on the said database as the said detailed relationship, when the said detailed relationship is not edited.   7. The Internet communication server according to claim 6, wherein the friend information display means displays the oldest contact information among the contact information when the detailed relationship is not edited.   7. The Internet communication server according to claim 6, wherein the friend information display means displays the contact information immediately before registering as a friend among the contact information when the detailed relationship is not edited.

Images