KR100632252B1 - System and method for searching human network - Google Patents

Abstract

A system and a method for searching the human network are provided to minimize a troublesome procedure while securing a trusted and wide human network range by reflecting offline relations, such as a cooperation relation, and organization or team relation in a company, to the online human network. An acquaintance information database(14) stores information for the primary acquaintance relation set between a user and another user by invitation and acceptance through the Internet(200). A team information database(19) stores the information for team relation by forming the organization and/or cooperation relation among the users. A search server(20) receives/stores the information to be shared by the users included in a team, transmits the information to terminals(310-340) of other users included in the team, and relays data transceiving to enable the users included in the team to perform common business. The search server searches the human network by using one user requesting the search as a search starting node, and reflecting the information for the primary acquaintance relation and the team relation.

Description

Human network search system and method {SYSTEM AND METHOD FOR SEARCHING HUMAN NETWORK}

1 is a schematic diagram illustrating an embodiment of a human network search system 100 of the present invention;

2 is a schematic diagram illustrating a user registration process in the human network search system 100 of the present invention;

3 is a schematic diagram for explaining a process of forming a primary acquaintance in the human network search system 100 of the present invention;

4 is a schematic diagram for explaining a process of forming a team relationship in the human network search system 100 of the present invention;

5 is a schematic diagram illustrating a human network search process in the human network search system 100 of the present invention;

6A is an example of a data structure in user information database 12,

6B is an example of a data structure in the acquaintance information database 14,

6C is an illustration of the data structure of the user-team database 16 in the team information database 19,

6D is an illustration of the data structure of team-user database 18 in team information database 19,

7 is a schematic diagram for understanding an online human network search space in the system of the present invention and an example of a result of performing a conditional search in such a search space;

8 is an example of the result of performing the shortest distance search in the human network search space of the present invention;

9A is a schematic diagram illustrating a first search rule for reflecting a team relationship online in a human network search of the present invention;

9B is a schematic diagram illustrating a second search rule for reflecting team relationships online in the human network search of the present invention;

9C is a schematic diagram illustrating a third search rule for reflecting a team relationship online in the human network search of the present invention;

9D is a schematic diagram illustrating a fourth search rule for reflecting online team relationships in the human network search of the present invention;

10A to 10B are examples of execution screens of a program for interworking with a search system, which is performed in a user terminal of the present invention;

11 is an example of a graph data structure obtained as a result of data conversion for increasing the search speed and accuracy in the human network search system of the present invention;

12 is an example of a search process performed by the search algorithm performing module 25 using the data converted into the data data structure in this way,

13 is an embodiment of a method for providing a human network search service according to another aspect of the present invention;

FIG. 14 is a diagram illustrating a configuration of a program 600 installed in a terminal of a user for interworking with the aforementioned human network search system and a user's convenience according to another aspect of the present invention.

Explanation of symbols on the main parts of the drawings

10: database 12: user information database

14: Acquaintance Information Database 16: User-Team Database

18: Team-User Database 19: Team Information Database

20: search server 25: search algorithm execution module

28: memory module 30: web server

100: human network search system

200: Internet

310, 320, 330, 340: user terminal

The present invention relates to a method and system for searching for a human network using a network such as the Internet. More specifically, a search for a human network in a broader range is possible compared to the prior art, and must be performed by a user. How to provide human network search service that can avoid the hassle of acquaintance designation process, can reflect offline human network relations on-line as much as possible, and can automatically build and search reliable human network And to the system.

Human network refers to a virtual network of individuals who have become acquaintances through social life. An acquaintance is a range of others who have become more or less reliable as a result of sharing a certain amount of information, experiences, ideals, and community affiliation. Such acquaintances can be derived from a predetermined acquaintance. It is a common aspect of social life that comes from knowing each other by kinship, schooling or delay, belonging to a specific organization, or working together through a company or team.

Recently, with the development and dissemination of networks, such as the Internet, such acquaintances have been formed online, and it is possible to actively build such a human network online, and to provide a function to search for necessary people on the constructed human network. Services for this are being proposed.

Prior art 1 (Korean Patent Laid-Open No. 2002-23616) proposes a system on a network capable of community construction for job search. In this system, it is a system that automatically classifies basic information data necessary for forming a network such as their company, job type, and job group, which members input, and automatically forms a community by company, job group, and job type. The community-type network formation system configured as described above is a method of automatically forming a community of a plurality of registered subscribers, so even if they belong to a common community, they cannot guarantee the reliability among members. There is a problem that there is not much different from finding a job or looking for a job.

Further, the prior art 2 (Domestic Patent Publication No. 2000-36286) includes a data collecting means 10 for collecting personal information of a subscriber on the Internet, an integrated database 20 for storing personal information and various data, At the request of subscribers, a network management system has been proposed, which comprises a network management means 30 for connecting to a network of contacts on the Internet and managing the connected network relationships by a database, and a browsing means 40 for showing the processing status to the user on the Internet. have. In the above system, a network of online contacts is established by sending an e-mail to the subscriber's acquaintances and acknowledgment of the acquaintances, and accumulating, storing and managing information on the network relations generated through this process in a unified database. Provides reliable social networking information to share reliable social networking information

Furthermore, the prior art 3 (Domestic Patent Publication No. 2000-36285) has a function to store and share the personal information and various data collected according to each network among fellow members who belong together in a group formed on the Internet. A club management system on the Internet is provided.

In the case of the above-described prior art 1, there is a problem that it cannot secure the reliability, and in the case of the prior art 2, although the reliability can be secured, only the acquaintances who have gone through the approval process through e-mail are online. Since it can be formed, only a very limited range of networking can be formed, and there is a problem that a sufficient range of searches is difficult when a search is performed using the human network database thus formed.

In addition, in the case of the prior art 3, a wide range of human network can be formed by sharing the social network information among the members of the group, but since the group is a group that cannot guarantee the reliability, problems such as leakage of personal information may occur. And, there is a problem that it is difficult to form a reliable human network.

Accordingly, there is a need for a method and system for providing a human network search service on-line that can be assured of a close acquaintance with an offline person as much as possible and can secure a wide range while minimizing troublesome procedures.

In addition, the conventional human network construction and retrieval system is proposed by a search algorithm suitable for a large number of users to use the complexity of the human network data, or to perform a search for a human network in a wider range. If the number of subscribers increases, the real-time search for a desired target on the human network becomes very difficult, resulting in a problem of deterioration of service quality.

The present invention is to solve such a problem, it is possible to secure a reliable and wide network range by applying an offline collaboration relationship, organizational relationship or team relations of companies, etc. to the online human network, It is to provide a method and system for providing a minimized online human network search service.

In addition, the present invention, if the number of users, the human network data is complicated and huge, or even if you want to perform a search for the human network in a broader range to perform a real-time search for the desired target on the human network It is to provide a method and system for providing a human network search service.

In order to achieve the above object, a human network search system according to an aspect of the present invention is established between an individual user and another user by invitation and acceptance through the network between each user who subscribes to the service through the network. An acquaintance information database that stores information relating to a primary acquaintance relationship; Collaborate within a team, a predetermined collaboration space, provided by several of the users via the network to form an organizational and / or cooperative relationship to share information and / or collaborate online. A team information database that stores information about team relationships indicating membership; And receiving, storing, and transmitting information to be shared by users belonging to the team to terminals of other users belonging to the team, and allowing users belonging to the team to perform joint work. Mediating transmission and reception, and using any one of the users who have requested a search as a search start node, reflecting both the information on the first acquaintance relationship established between the users and the information on the team relationship And a search server that performs a human network search and provides the result to the user who requested the search.

If necessary, the system may further include a user information database that stores the ID of each user subscribed to the service and the personal information corresponding thereto.

The search server may further include an initialization module, wherein the initialization module loads user information including the ID of each user from the user information database, thereby loading each node on a graph data structure. It may be set to.

The above acquaintance relation database stores and stores corresponding IDs between two users in the primary acquaintance relation, and the initialization module loads correspondence information according to the primary acquaintance relation between the users from the acquaintance relation database. It may be to create a link between the nodes on the graph data structure.

In addition, the team information database includes a first type of team information data associated with the information of the team to which each user belongs to each user, and a second type of team information data corresponding to the users belonging to each team for each team; The initialization module may be configured to load team information data of the first type and the second type from the team information database.

In accordance with another aspect of the present invention, a method for providing a human network search service mediates the formation of a primary acquaintance relationship between a user and another user by invitation and acceptance of each user who has subscribed to a service through a network. A search server for storing information, an acquaintance information database provided for storing data relating to a primary acquaintance formed by each user, and an organization and / or cooperative relationship between a plurality of users of the users via the network. Human network search with a team information database arranged to store information about team relationships indicating co-owning within a team, which is a given collaboration space provided for sharing and / or collaborating on-line information online. A holiday run on the search server in the system The network search service providing method, comprising: detecting the presence of the early and compliance for primary acquaintance relationship between the each user; Storing data relating to the primary acquaintance relationship in the acquaintance information database; Detecting a team relationship setting among a plurality of users of the users; Storing information about a team relationship established between the users in the team information database; Receives, stores, and transmits information to be shared by users in the team to terminals of other users in the team, and transmits and receives data through the network so that users in the team can perform common tasks. Mediating; And a user requesting a search among the users as a search start node to reflect the human network search by reflecting both the information on the first acquaintance relationship and the information on the team relationship established between the users. And providing the result to the user who requested the search.

According to another aspect of the present invention, a method for providing a human network search service, which mediates the formation of a primary acquaintance relationship between a user and another user by invitation and acceptance through a network, between each user who has subscribed to the service through the network, A search server for storing information, an acquaintance information database provided for storing data relating to a primary acquaintance formed by each user, and an organization and / or cooperative relationship between a plurality of users of the users via the network. Human network search with a team information database arranged to store information about team relationships indicating co-owning within a team, which is a given collaboration space provided for sharing and / or collaborating on-line information online. Performed on the search server in the system The remote network search service providing method, comprising: storing the data regarding the relationship between the primary connections to detect the presence of the invitation and compliance for primary acquaintance relationship between the respective users to the acquaintance information database; Detecting a team relationship setting among a plurality of users among the users, and storing information about the set team relationship in the team information database; And defining each of the users as a node on a graph data structure, and using any one of the users who have requested a search as a search start node, and relating to the primary acquaintance relationship established between the users. Converting data loaded from the database into data of a graph data structure by forming a link between the nodes on the graph data structure reflecting information and / or information about the team relationship. Characterized in that.

Here, the method may further include sequentially performing a search according to the order of equidistant nodes on the graph from the start node based on the data of the converted graph data structure.

In this case, the searching step of the present invention is to perform a search by applying a first search rule that automatically considers that other users who are in a team relationship with the starting node user are in a primary acquaintance with the starting node user. desirable.

In addition, the searching may further include applying a second search rule that automatically considers users who have a first acquaintance with the start node user and other users who are in the team relationship as a second acquaintance with the start node user. It is preferable to carry out.

In addition, the searching may be performed by applying a third search rule in which team members of one or more teams to which each user belongs are automatically regarded as having a first acquaintance with the user.

The team may define one or more users among the users belonging to the team as a team manager, and may form a hierarchical structure by defining an equal, upper, or lower position between one or more of the teams. The searching step may be performed in a second acquaintance with other users who are operators of one or more teams of the teams connected in the hierarchy with the team when the user having a first acquaintance with the start node user is the team operator. The search may be performed by further applying the fourth search rule considered.

The methods of the present invention can be implemented in the form of a recording medium having recorded thereon a computer readable program for performing the respective steps.

According to another aspect of the present invention, a recording medium storing a program includes a first acquaintance established between an individual user and another user by invitation and acceptance through the network between each user who has subscribed to the service through the network. A database of acquaintance information that stores information about the network, and the users of several of the users can form an organizational and / or cooperative relationship through the network so that information can be shared and / or collaborated online. A team information database for storing information about team relationships indicating co-owning within a team, which is a predetermined collaboration space; And receiving, storing, and transmitting information to be shared by users belonging to the team to terminals of other users belonging to the team, and allowing users belonging to the team to perform joint work. Mediating transmission and reception, and using any one of the users who have requested a search as a search start node, reflecting both the information on the first acquaintance relationship established between the users and the information on the team relationship It is installed in the terminal of the user side so as to be able to interwork through a network with a human network search system including a search server that performs a human network search and provides the result to the user requesting the search, and invites and Send acknowledgment signals or invite and accept acknowledgments from other users A program module for receiving a call and forming a primary acquaintance relationship; A program module for establishing a team relationship in which a plurality of users are jointly belonged to the user according to the organization or business cooperation relationship between the users; A program module for allowing each user belonging to the team to access and use an online collaboration space jointly provided to the plurality of users according to the team relationship; And a program module for transmitting a search command and a search condition to the search server so that a user can input a search condition, and the search server can initiate a human network search according to the entered search condition. Is a recording medium that records an executable program.

Hereinafter, with reference to the accompanying drawings will be described in detail a preferred embodiment of a method and system for providing a human network search service according to the present invention.

In the present invention, the 'team' and the 'friend' relationship is a distinct concept, the 'friend' relationship is a primary acquaintance formed between the user and another user by invitation and acceptance through the network as a medium (hereinafter, 'primary' These relationships are usually based on real, offline relationships, but may not necessarily be.

In the present invention, the 'team relationship' refers to an organization formed through a network, and there may or may not be an acquaintance relationship between team members, and such a team relationship is generally an offline collaboration relationship, an organization such as a company, etc. This is usually based on, but not necessarily based on, relationships or team relationships.

In addition, a third user having a first acquaintance with a second user who has a first acquaintance with the first user, and a user who does not have a first acquaintance with the first user as a second acquaintance with the second user Express your friendship. In this way, a complex acquaintance can be formed between a plurality of users. Such acquaintances on the network are referred to as 'human networks', and primary and secondary acquaintances (this can be referred to as '1 village' and '2 village'). In addition to acquaintances such as tertiary or quaternary (this can be expressed as 'three villages' or 'four villages').

The team relationship of the present invention is formed by a number of users (team members) sharing a common cyber collaboration space, and the team members may be composed of team members who are team managers and general team members. Usually, a team member who creates a team is to be the team manager. Alternatively, other team members who do not have a team can be set to be team managers. It is possible to form a hierarchical structure by defining relationships between teams, such as higher, lower, or equivalent levels.

1 is a schematic diagram illustrating one embodiment of a human network search system 100 of the present invention. The human network search system 100 of the embodiment includes a database 10, a search server 20, and a web server 30.

The database 10 includes a user information database 12, an acquaintance information database 14, and a team information database 19. In the team information database 19, there is a user-team database 16 for mapping each user to a team to which the user belongs, and a team-user database 18 for mapping each team to users belonging to the team. Each may be provided.

The search server 20 includes a search algorithm performing module 25 and a memory module 28.

The human network search system 100 connects to a plurality of user terminals 310, 320, 330, and 340 through a network 200 such as a wired / wireless internet or an intranet. For convenience, only four user terminals are illustrated, and the user terminals may be various fixed or mobile terminals, such as a laptop, a desktop, a PDA, and a PCS.

2 is a schematic diagram illustrating a user registration process in the human network search system 100 of the present invention. First, a process (A) in which a first user registers with the human network search system 100 through the terminal 310 is performed, and a fourth user separately uses the human network search system through the terminal 340. A process (B) of registering with 100 is performed. In this registration process, each user's ID, password, and personal information (job, gender, age, place of residence, work address, company name, school of origin, hobbies, etc.) may be inputted. Is stored in the user information database 12 (C) and managed. In each user's service subscription or registration (A, B), the human network search system 100, in conjunction with the search system, allows a user to easily use various functions provided by the system (FIGS. 10A and 10B). And FIG. 14) may be downloaded to each user terminal to be executed in the terminal.

3 is a schematic diagram illustrating a process of forming a primary acquaintance in the human network search system 100 of the present invention. In order to form an online primary acquaintance between users, the first user transmits an invitation message to the second user's terminal 330 via the terminal 310, and the fourth user sends the message to the terminal 340. Confirming, the process (D) of transmitting the acceptance message may be performed. The invitation message and the acceptance message may be in various forms such as an e-mail and a text message. The human network search system 100 recognizes that the invitation and acceptance process is performed, and recognizes that a primary acquaintance relationship is formed between two users. The information database 14 is recorded (E) in a predetermined data structure. In this case, the fourth user may be a user who has not been registered yet. In this case, a process of registering the user as a user in the system may be performed by transmitting and receiving data with the human network search system 100 when sending an acceptance message for an invitation. Can be.

4 is a schematic diagram for explaining a team relationship forming process in the human network search system 100 of the present invention. The first user transmits an invitation message inviting the second user's terminal to be a member of a specific team via the terminal 310, and the second user transmits a message acknowledging it via the terminal 320. (F). Through this process, a team relationship may be formed between the first user and the second user. When a team relationship is formed between users in this way, the team information is recorded (G) in the user-team database 16 and the team-user database in the team information database 19 according to a predetermined data structure. The formation of team relationships among users means that users can perform collaborative work by using functions such as team bulletin boards, all mails, and all messages, which is common in organizations such as companies. This means that similar processing can be done between team members through intranet or groupware.

 5 is a schematic diagram illustrating a human network search process in the human network search system 100 of the present invention. When a human network search request (H) via the first user terminal 310 is received, the search server 20 in the system 100 may include the user information database 12, the acquaintance information database 14, and the team information database ( The data recorded in 19 is read, converted, and loaded into the memory module 28 provided in the search server 28 (I), and the search is performed using the loaded data (J).

6A illustrates the data structure in the user information database 12. As illustrated, in the user information database 12, user information such as name, age, occupation, and gender of the user is stored in correspondence with each user ID (Userid1, 2, 3, ...).

6B illustrates the data structure in the acquaintance information database 14. As illustrated, in the acquaintance information database 14, the ID of each user in which a primary acquaintance relationship is formed is stored in a 1: 1 correspondence.

6C illustrates the data structure of the user-team database 16 in the team information database 19. As illustrated, in the user-team database 16, each user ID is mapped to and stored in the team to which the user belongs.

6D illustrates the data structure of team-user database 18 in team information database 19. As illustrated, in the team-user database 18, IDs of users belonging to the team are stored in association with each team.

7 is a schematic diagram for understanding an online human network search space in the system of the present invention and a result of performing a conditional search in such a search space. In the virtual human network search space, each user registered in the system corresponds to a node (a, b, c, d, ...). According to a primary acquaintance relationship between a user and a user, a link is formed between nodes of a search space. The search space thus formed may be represented by a graph data structure. This starting node (a) at which the search is started on the search space is defined. In many cases, a user requesting a search using the search system of the present invention becomes a start node, but this is not necessarily the case. In the illustrated example, a result of performing a search to find a user who satisfies a specific condition (for example, a patent attorney) within a uncle (secondary acquaintance relation) centered on the search start node (a) is illustrated. The search range has a second acquaintance with the start node (a) by having a first acquaintance with the nodes (b, c, d) having a first acquaintance relationship from the user who is the start node (a). Nodes (e, f, g, h). Users in this range within the search space will be found. At this time, to determine whether the condition is satisfied, the user information of the user corresponding to each node is referred to.

8 illustrates the result of performing the shortest distance search in the human network search space of the present invention. As illustrated, the shortest distance a-b-e-j-p in the human network search space between node a corresponding to one user and node p corresponding to another designated user has been retrieved and displayed.

9A is a schematic diagram illustrating a first search rule for reflecting a team relationship online in the human network search of the present invention. In FIG. 9A, teams such as the general affairs team, development team 1, development team 2, and the like are defined between users, and a search start node (a) belongs to team 1 of development. It is assumed that equal team relationships are defined between the teams shown. It is assumed that the development team 1 has a large number of users (a, b, c, d) as a team member, and one user (d) has the status of team manager. In addition, it is assumed that there is only a team member relationship between team members and no acquaintance relationship is established.

The first search rule of the present invention assumes that all team members of the team to which the search start node (a) belongs in the search space are in primary contact with the search start node (a). If the search criteria is set up to a second acquaintance, the nodes (e, f) having a first acquaintance with the starting node (a) and the first acquaintances from these nodes are not applied unless this search rule reflecting the team relationship is applied. Only nodes (g, h, i) that are secondary acquaintances to the start node in the relationship fall within the scope of the search. However, if the first search rule reflecting the team relationship is applied, the start node (a) belongs. The team members (b, c, d) of the team are included in the search target, so that the search range can be expanded while maintaining the reliability.

9B is a schematic diagram illustrating a second search rule for reflecting online team relationships in the human network search of the present invention. In FIG. 9B, teams such as the general affairs team, development team 1, development team 2, and the like are defined between users, and the search start node a does not belong to any team. However, another node (b) having a primary contact with the search start node (a) belongs to the development team 1. It is assumed that equal team relationships are defined between the teams shown. The development team 1 has a large number of users (b, c, d, e) as a team member, and one user (e) assumes the status of team manager. In addition, it is assumed that there is only a team member relationship between team members and no acquaintance relationship is established.

The second search rule of the present invention assumes that all the team members of the team to which the node which is the first acquaintance of the search start node a belongs in the search space are in the second acquaintance relationship with the search start node a. If the search condition is set up to the second acquaintance, and if such a search rule reflecting the team relationship is not applied, the nodes (b, g, i) in the first acquaintance relationship with the starting node (a) and one from these nodes are not applied. Only nodes (j, k, l, f) that are secondary acquaintances to the start node in the relationship of the acquaintance belong to the scope of the search, but when the second search rule reflecting the team relationship is applied, The team members (c, d, e) of the team to which the node (b), which is the primary acquaintance relation, are included in the search target, so that the search range can be expanded while maintaining the reliability.

9C is a schematic diagram illustrating a third search rule for reflecting a team relationship online in the human network search of the present invention. The third search rule of the present invention does not take into account the relationship with the search start node (a) in the search space, but has a primary acquaintance with all the team members of at least one team to which each node in the search space belongs. To assume. If the search criteria is set up to a second acquaintance, the nodes (e, f) having a first acquaintance with the starting node (a) and the first acquaintances from these nodes are not applied unless this search rule reflecting the team relationship is applied. Only nodes (h) that are secondary acquaintances to the start node in the relationship fall within the scope of the search, but if the third search rule reflecting the team relationship is applied, the team members of the team to which the start node belongs (b, c) , d) and the team members (g, j, k) of the team to which the node (e) has a primary acquaintance, as well as the nodes (m, i) of the primary acquaintance with the team members to which the starting node belongs. Even the search object is included, so that the search range can be expanded while maintaining the reliability.

9D is a schematic diagram illustrating a fourth search rule for reflecting team relationships online in the human network search of the present invention. In Fig. 9D, teams such as the general affairs team, development team 1, and development team 2 are defined among the users, and the search start node (a) does not belong to any team. However, it is assumed that another node (b), which has a primary contact relationship with the search start node (a), belongs to the development team 1 and is registered as the team leader. It is assumed that equal team relationships are defined between the teams shown. It is assumed that the development team 1 has a large number of users (b, c, d, e) as a team member, and one user (b) has the status of a team manager. In addition, it is assumed that there is only a team member relationship between team members and no acquaintance relationship is established.

According to the fourth search rule of the present invention, if a node that is a first acquaintance of the search start node (a) in the search space is the team leader of the team to which he belongs, the team managers (x, It is assumed that y) is in secondary acquaintance with the search start node (a). If the search condition is set up to the second acquaintance, the nodes (b, i, k) that are in the first acquaintance relationship with the starting node (a) and from these nodes, unless this search rule reflecting the team relationship is applied. Only nodes (l, j, g, and f) that are secondary acquaintances to the start node in the primary acquaintance relationship fall within the scope of the search. Thus, the fourth search rule reflecting the team relationship is similar to the second search rule. When applied together, team members (c, d, e) of the team to which node (b), which is a primary acquaintance of the starting node, and the team operators (x, y) of other teams whose relationships are defined are retrieved. Being included in the object, the search range can be further expanded while maintaining the reliability.

In addition to the above examples, various search rules reflecting team relationships may be defined and used alone or in parallel. By applying the search rule reflecting such a team relationship, it is possible to expand the search range of the human network while maintaining the reliability. Team relationships, which are collaborative relationships, have a low probability of encountering problems even when they are considered acquaintances, and the need for team relationships to define teams and re-establish acquaintances in the system between users who establish team relationships. Can be avoided. Of course, if necessary, an acquaintance can be established between team members, or conversely, a team can be formed between users who have established an acquaintance. In the case where a team relationship and an acquaintance are overlapped, the acquaintance may be prioritized to avoid confusion in applying search rules.

10A illustrates an execution screen of a program for interworking with a search system performed in a user terminal of the present invention. The illustrated screen 400 includes a toolbar 405 for creating a team according to a user's needs, and a toolbar 410 for sending an invitation message for inviting other users to a team or an acquaintance. The provided window 420 is an example of a screen that appears when the toolbar 410 is selected.

 10B illustrates an execution screen of a program for interworking with a search system performed in a user terminal of the present invention. In the illustrated screen 400, a toolbar 430 for requesting a human network search from the system and a search condition input window 440 that appears when the toolbar 430 is selected are shown. For example, the place of residence, occupation, age, sex, and the like can be input to the search condition.

Fig. 11 illustrates a graph data structure obtained as a result of data conversion for increasing the search speed and accuracy in the human network search system of the present invention. As described above with reference to FIGS. 1 and 6A-6D, the database 10 in the search system 100 of the present invention includes a user information database 12, an acquaintance information database 14, and a team information database 19. Each of these data is stored and managed in a relatively simple structure (defined as such a 'relational data structure') as shown in FIGS. 6A-6D. This simple data storage method facilitates updating and managing data.

However, at the time of the search initialization (I) performed in the search server (see FIG. 5), the search server 20 converts the data to the data having a graph data structure using data stored in the database 10, and converts the data into a data having a graph data structure. 28) to make the search quick and accurate. In FIG. 11, a graph 480 formed by nodes (0, 1, 2, 3) corresponding to respective users, and links connected between the nodes by a primary acquaintance relationship between users and The graph data structure 480 is shown as a data structure.

Since node 0 is connected to nodes 1 and 3, data 1 and 3 correspond to data 0 in data structure 480 on the right, and node 1 is connected to nodes 0, 2 and 3, and so on. ), Data 0, 2, and 3 correspond to data 0. Hereinafter, since it can be inferred through the above description, further description will be omitted.

12 illustrates a search process performed by the search algorithm performing module 25 using the data converted into the data data structure as described above. The search order is based on the start node, and moves in the graph according to the distance from the start node. That is, as shown in the upper portion 500 of FIG. 12, the nodes in the first acquaintance relation are first searched with respect to the start node, and then the search is continued to the nodes in the second acquaintance relation. A search order as illustrated at the bottom 510 of FIG. 12 may be applied between nodes that are at the same distance from the start node.

13 illustrates an embodiment of a method for providing a human network search service according to another aspect of the present invention. First, each user subscribes to a service through a network and stores user information in a database (S10). In addition, a primary acquaintance is formed by the invitation and the acceptance through the network between the users (S20). At this time, the formed primary acquaintance relationship is stored in the acquaintance information database in the relational data structure of FIG. 6B described above. For example, a team relationship may be defined by, for example, invitation and acceptance (S40), and the team relationship is stored in the team information database (S50).

Based on the acquaintances and team relationships formed as described above, a human network search is performed in response to a user's search request. The data of the relational data structure in the pre-stored database is converted into a graph data structure for quick and accurate search. In operation S60, a search initialization process may be performed by resident in the memory module. Based on the data of the converted graph data structure, the search is performed by applying the search rule of the present invention reflecting the acquaintance relationship and the team relationship (S70). Since the search rule reflecting the team relationship has already been described above, the description is omitted here. When the search ends, the search result is transmitted to the user terminal requesting the search (S80).

FIG. 14 illustrates a configuration of a program 600 installed in a terminal of a user for interworking with the aforementioned human network search system and a user's convenience according to another aspect of the present invention. The user terminal installation program 600 may include a program module 610 for transmitting an invitation and acknowledgment signal through a user's network or receiving an invitation and acknowledgment signal from another user to form a primary acquaintance, and the organization between each user. Or a program module 620 for establishing a team relationship in which a plurality of users are co-owned according to a business cooperation relationship, and belonging to the team in an online collaboration space jointly provided to the plurality of users according to a set team relationship. A program module 630 for allowing each user to access and use the same, and to the search server to allow the search server to initiate a human network search according to the entered search condition. Program module 640 for sending search commands and search conditions and text messages or teams Commercially available, such as may be configured to include a general manager module 650, for performing the sharing of information / transmission and reception functions.

Some or all of the technical idea of the present invention can be implemented in various forms such as hardware, software, and a recording medium recording the same. Although the above has been illustrated and described with reference to the preferred embodiments of the present invention, the present invention is not limited to the above-described specific embodiments, and the present invention belongs to the present invention without departing from the gist of the present invention as claimed in the claims. Various modifications can be made by those skilled in the art, and such changes are within the scope of the appended claims.

By applying the present invention, it is possible to secure a reliable and wide network search range by reflecting offline collaborative relationships, organizational relationships such as companies, or team relationships in online human networks.

In addition, according to the present invention, when the number of users increases, the human network data becomes complicated and huge, or when a search for a human network is performed in a wider range, a real-time search for a desired target on the human network can be performed quickly and accurately. It is possible to carry out.

Furthermore, by applying the present invention, it is possible to provide a human network search system and method that is easy to update and manage a lot of data related to a plurality of users, and that can be quickly and accurately searched by an optimized conversion of a data structure.

Claims (15)

In a human network search system via a network, An acquaintance information database for storing information about a first acquaintance relationship established between each user who has subscribed to the service through the network and between the user and another user by invitation and acceptance through the network; Collaborate within a team, a predetermined collaboration space, provided by several of the users via the network to form an organizational and / or cooperative relationship to share information and / or collaborate online. A team information database that stores information about team relationships indicating membership; And Receives, stores, and transmits information to be shared by users in the team to terminals of other users in the team, and transmits and receives data through the network so that users in the team can perform common tasks. Mediating the user and reflecting both the information on the first-person acquaintance relationship and the information on the team relationship established between each of the users as a search start node. A search server that performs a network search and provides the results to the user who requested the search; In the search, the human network search system performs a search by applying a first search rule which automatically considers that other users who are in a team relationship with the start node user are in a primary acquaintance with the start node user. . The method of claim 1, And a user information database storing an ID of each user subscribing to the service and personal information corresponding thereto. The method of claim 1, The search server, Further includes an initialization module, And the initialization module loads user information including the ID of each user from the user information database and sets each node on a graph data structure. The method of claim 1, The acquaintance information database stores IDs corresponding to two users in the primary acquaintance relationship, The initialization module loads correspondence information according to a primary acquaintance relationship between the users from the acquaintance relation database, and generates a link between the nodes on the graph data structure. . The method of claim 1, The team information database stores the first type of team information data associated with the information of the team to which each user belongs to each user, and the second type team information data associated with the users belonging to each team for each team. , And the initialization module loads the first type and second type team information data from the team information database. A search server for mediating the formation of a primary acquaintance between a user and another user by invitation and acceptance through a network between the users who have subscribed to a service through a network, and a relation of a primary acquaintance formed by each of the users. A database of acquaintance information provided for storing data, and the users of several of the users via the network can form an organizational and / or cooperative relationship to share information and / or collaborate online. A method for providing a human network search service performed by the search server in a human network search system having a team information database provided to store information about team relations indicating that they are co-owned in a team, which is a predetermined collaboration space. Detecting the presence of an invitation and an acknowledgment for forming a first acquaintance relationship between the respective users; Storing data relating to the primary acquaintance relationship in the acquaintance information database; Detecting a team relationship setting among a plurality of users of the users; Storing information about a team relationship established between the users in the team information database; Receives, stores, and transmits information to be shared by users in the team to terminals of other users in the team, and transmits and receives data through the network so that users in the team can perform common tasks. Mediating; And The human network search is performed by using any one of the users who have requested a search as a search start node, reflecting both the information on the primary acquaintance relationship and the information on the team relationship established between the users. Providing the results to the user who requested the search;  In the search, a human network search service is performed by applying a first search rule that automatically considers other users who are in a team relationship with the start node user to have a first acquaintance with the start node user. How to Provide. A search server for mediating the formation of a primary acquaintance between a user and another user by invitation and acceptance through a network between the users who have subscribed to a service through a network, and a relation of a primary acquaintance formed by each of the users. A database of acquaintance information provided for storing data, and the users of several of the users via the network can form an organizational and / or cooperative relationship to share information and / or collaborate online. A method for providing a human network search service performed by the search server in a human network search system having a team information database provided to store information about team relations indicating that they are co-owned in a team, which is a predetermined collaboration space. Sensing the presence of an invitation and an acknowledgment for forming a first acquaintance relationship between the respective users and storing data related to the first acquaintance relationship in the acquaintance information database; Detecting a team relationship setting among a plurality of users among the users, and storing information about the set team relationship in the team information database; And Defining each user as a node on a graph data structure, selecting one of the users as a search start node, and information about the primary acquaintance relationship established between the users; And / or converting data loaded from the database into data of a graph data structure by forming a link between the nodes on the graph data structure reflecting information about the team relationship. , In the search, a human network search service is performed by applying a first search rule that automatically considers other users who are in a team relationship with the start node user to have a first acquaintance with the start node user. How to Provide. The method of claim 7, wherein And sequentially performing a search according to the order of equidistant nodes on the graph from the starting node based on the data of the converted graph data structure. delete The method according to claim 6 or 7, The search performing step, A human being further characterized in that a search is further applied by applying a second search rule which automatically considers users having a first acquaintance relationship with the start node user and other users who are in the team relationship as a second acquaintance of the start node user. How to provide network discovery service. The method according to claim 6 or 7, The search performing step, And performing a search by applying a third search rule in which team members of one or more teams to which each user belongs are automatically regarded as a primary acquaintance with the user. The method according to claim 6 or 7, The team, One or more of the users belonging to the team can be defined as a team administrator, Method for providing a human network search service, characterized in that the hierarchical structure can be formed by defining an equal, upper or lower position between one or more of the team. The method according to claim 6 or 7, The search performing step, A fourth search rule that automatically considers another user who is the operator of the team and one or more of the teams connected in the hierarchy as a second acquaintance when the user having a first acquaintance with the start node user is the team operator. Method for providing a human network search service, characterized in that to further apply a search. A recording medium having recorded thereon a computer readable program for performing the steps of claim 6 or 7. An acquaintance information database that stores information about a primary acquaintance relationship established between each user who has subscribed to the service through the network and between the user and another user by invitation and acceptance through the network, the user via the network Information about team relationships, which indicates that a number of users are co-owned within a team, a predetermined collaboration space provided for organizing organizational and / or collaborative relationships to share information and / or collaborate online. A team information database for storing the information; And receiving, storing, and transmitting information to be shared by users belonging to the team to terminals of other users belonging to the team, and allowing users belonging to the team to perform joint work. Mediating transmission and reception, and using any one of the users who have requested a search as a search start node, reflecting both the information on the first acquaintance relationship established between the users and the information on the team relationship It is installed in the terminal of the user side to enable the human network search and interworking through the network and the human network search system including a search server for providing the results to the user requesting the search, A program module for transmitting an invitation and acknowledgment signal through the user's network or receiving an invitation and acknowledgment signal from another user to form a primary acquaintance; A program module for establishing a team relationship in which a plurality of users are jointly belonged to the user according to the organization or business cooperation relationship between the users; A program module for allowing each user belonging to the team to access and use an online collaboration space jointly provided to the plurality of users according to the team relationship; And A program module for allowing a user to input a search condition, and transmitting a search command and a search condition to the search server so that the search server can initiate a human network search according to the entered search condition, The search may be performed by applying a first search rule in which other users who are in a team relationship with the start node user are automatically regarded as having a first acquaintance with the start node user. Recording medium that records the program.

Images