CN111404702B

CN111404702B - Group entering method, group entering device, group management system, computer equipment and storage medium

Info

Publication number: CN111404702B
Application number: CN202010191869.4A
Authority: CN
Inventors: 黄铁鸣; 陈晓波; 林莉; 王青; 肖爽; 李斌; 朱标亦
Original assignee: Tencent Technology Chengdu Co Ltd
Current assignee: Tencent Technology Chengdu Co Ltd
Priority date: 2020-03-18
Filing date: 2020-03-18
Publication date: 2022-04-29
Anticipated expiration: 2040-03-18
Also published as: CN111404702A; CN114826802B; CN114826802A

Abstract

The application relates to the technical field of internet, and provides a group entering method, a group entering device, a group management system, computer equipment and a storage medium. The method and the device can provide the group entering link for the client to be mapped to one or more groups selected in advance, when the group entering link is triggered, the group server can return group entering invitation information such as a group entering code of the group with less than full number of group members to the client, a user waiting for group entering can join the group with less than full number of group members in a mode of scanning the group entering code and the like, the problem that the group members need to frequently generate new group two-dimensional codes for sharing when the group members directly share the group two-dimensional codes to invite external users to join the group in the related art can be solved, and the group entering efficiency is improved.

Description

Group entering method, group entering device, group management system, computer equipment and storage medium

Technical Field

The present application relates to the field of internet technologies, and in particular, to a group entry method, an apparatus, a group management system, a computer device, and a storage medium.

Background

With the development of internet technology, multi-user online group chat technology has appeared, for example, multi-user online group chat can be realized by using clients with group chat functions such as WeChat and Enterprise WeChat.

In the related art, a group member may invite a plurality of users not participating in a group to join the group by actively pulling or by sharing a group two-dimensional code. However, in the group entering mode in which the group member directly shares the group two-dimensional code to invite the external user to join the group, the group member needs to frequently generate a new group two-dimensional code for sharing, and the steps are complicated, so that the group entering efficiency is low.

Disclosure of Invention

In view of the foregoing, it is necessary to provide a clustering method, a clustering apparatus, a cluster management system, a computer device, and a storage medium for solving the technical problem of low clustering efficiency in the related art.

A method of clustering, the method comprising:

acquiring a group entering link; the group-entering link has a mapping relation with at least one group;

sending a group invitation acquisition request generated by triggering the group access link to the group server of the at least one group, so that the group server returns group invitation information corresponding to the group with less group member number based on the at least one group;

and displaying the group access invitation information for the user waiting for group access to join the group with less group member number.

A method of clustering, the method comprising:

receiving a group access invitation acquisition request generated by triggering a group access link by a client; the group-entering link has a mapping relation with at least one group;

and responding to the group invitation acquisition request, and sending group invitation information corresponding to the group with the less than full number of group members to the client based on the at least one group, so that the client displays the group invitation information for the group-waiting user to join the group with the less than full number of group members.

A crowd sourcing device, comprising:

the link acquisition module is used for acquiring the group link; the group-entering link has a mapping relation with at least one group;

a request sending module, configured to send a group invitation obtaining request generated by triggering the group entering link to a group server of the at least one group, so that the group server returns group invitation information corresponding to a group with a less than full number of group members based on the at least one group;

and the group entering information display module is used for displaying the group entering invitation information and is used for the group user waiting for group entering to join the group with the less number of the group members.

A crowd sourcing device, comprising:

the request receiving module is used for receiving a group entering invitation acquisition request generated by triggering a group entering link by a client; the group-entering link has a mapping relation with at least one group;

and the request response module is used for responding to the group invitation acquisition request, and sending the group invitation information corresponding to the group with the less than full number of group members to the client based on the at least one group so that the client displays the group invitation information and is used for the group to be entered user to join the group with the less than full number of group members.

A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:

acquiring a group entering link; the group-entering link has a mapping relation with at least one group; sending a group invitation acquisition request generated by triggering the group access link to the group server of the at least one group, so that the group server returns group invitation information corresponding to the group with less group member number based on the at least one group; and displaying the group access invitation information for the user waiting for group access to join the group with less group member number.

receiving a group access invitation acquisition request generated by triggering a group access link by a client; the group-entering link has a mapping relation with at least one group; and responding to the group invitation acquisition request, and sending group invitation information corresponding to the group with the less than full number of group members to the client based on the at least one group, so that the client displays the group invitation information for the group-waiting user to join the group with the less than full number of group members.

A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:

The group access method, the group access device, the group management system, the computer equipment and the storage medium have the advantages that the client side acquires the group access link which has a mapping relation with at least one group, and sends the group access invitation acquisition request generated by triggering the group access link to the group server of the at least one group, the group server sends the group access invitation information corresponding to the group with the incomplete group member number to the client side based on the at least one group, and the client side can display the group access invitation information so that the user to be accessed can join the group with the incomplete group member number. The scheme can provide the group entering link for the client to be mapped to one or more groups selected in advance, when the group entering link is triggered, the group server can return group entering invitation information such as a group entering code of the group with less than full number of group members to the client, a user waiting for group entering can join the group with less than full number of group members in a mode of scanning the group entering code, the problem that the group members need to frequently generate new group two-dimensional codes for sharing when the group members directly share the group two-dimensional codes to invite external users to join the group in the related technology can be solved, and the group entering efficiency is improved.

Drawings

FIG. 1 is a diagram of an application environment for a group entry method in one embodiment;

FIG. 2 is a flow diagram illustrating a clustering method in one embodiment;

FIG. 3 is a flowchart illustrating steps for obtaining an incoming group link in one embodiment;

FIG. 4 is a schematic flow chart of a clustering method in another embodiment;

FIG. 5 is a schematic flow chart diagram illustrating a clustering method in accordance with yet another embodiment;

FIG. 6 is a flowchart illustrating the steps of sending an incoming group link in one embodiment;

FIG. 7 is a flowchart illustrating steps for sending a group invitation message to a client in one embodiment;

FIG. 8 is a schematic flow chart diagram illustrating a clustering method in accordance with yet another embodiment;

FIG. 9 is a signaling diagram of a group entry method in one embodiment;

FIG. 10 is a diagram of an architecture of a group management system in an example application;

FIG. 11 is an interface diagram of adding group chat functionality in an application example;

FIG. 12 is a signaling diagram of a group entry method in an example application;

FIG. 13 is an interface diagram of creating a group two-dimensional code in an application example;

FIG. 14 is an interface diagram of joining group chat via a group-entering two-dimensional code in an application example;

FIG. 15 is a signaling diagram of another grouping method in an exemplary application;

FIG. 16 is an interface diagram of a create-into-group applet in an example application;

FIG. 17 is an interface diagram of joining a group chat via a group applet in an example application;

FIG. 18 is a block diagram of a clustering device in one embodiment;

FIG. 19 is a block diagram showing the structure of a clustering device in another embodiment;

FIG. 20 is a block diagram of the architecture of the group management system in one embodiment;

FIG. 21 is a diagram showing an internal structure of a computer device in one embodiment;

fig. 22 is an internal structural view of a computer device in another embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

The group entering method provided by the present application can be applied to the application environment shown in fig. 1, and fig. 1 is an application environment diagram of the group entering method in one embodiment. The application environment may include clients 110 and a group server 120, where the clients 110 may communicate with the group server 120 over a network, such as the internet. The client 110 may include, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, the group server 120 may be a server for managing a plurality of groups, and the group server 120 may be implemented by an independent server or a server cluster composed of a plurality of servers.

Specifically, the client 110 may obtain a group entry link with a permanent validity period, where the group entry link has a mapping relationship with at least one group, the client 110 may trigger the group entry link to generate a group entry invitation obtaining request, and send the group entry invitation obtaining request to the group server 120, where the group server 120 returns, based on the at least one group, group entry invitation information such as a group entry code corresponding to a group with a less than full number of group members to the client 110, and the client 110 may display the group entry invitation information such as the group entry code, so that the user waiting to enter the group with the less than full number of group members joins the group. The user to be grouped may be a user using the client terminal 110, so that when the client terminal 110 displays the group entry code, the user to be grouped may join a group with a group member number less than the full number by long pressing the group entry code; the group entering user may not be the user using the client 110, and in this case, the group entering user may scan the group entering code displayed by the client 110 through the client used by the group entering user to join the group with the group member number less than the full number.

The grouping method provided by the application is further explained by combining the embodiment and the attached drawings:

in an embodiment, as shown in fig. 2, fig. 2 is a schematic flow chart of a group entering method in an embodiment, and provides a group entering method, which is described by taking the method as an example applied to the client 110 in fig. 1, and includes the following steps:

step S201, acquiring a group entering link;

in this step, the client 110 may have a group link, and the group link has a mapping relationship with at least one group. The at least one group may be selected by a link creating user, that is, the link creating user may select an existing or newly created group or groups as the at least one group, and after the link creating user selects the at least one group, an incoming link having a mapping relationship with the at least one group is generated.

It should be noted that the link creating user may be a group member of the at least one group, or may not be a group member of the at least one group, and after the link creating user selects the at least one group, the group server 120 may generate an incoming link having a mapping relationship with the at least one group. Specifically, the group server 120 may determine at least one group selected by the link creating user, and generate a unique group identifier that can be mapped to the at least one group, that is, mapping the at least one group by using the group identifier, and based on the group identifier, generating a group link that may be permanently valid, for example, the group link may be a permanently valid web page link, and may be continuously provided with a corresponding service by the group server 120 from the creation of the group link, so that the validity period of the group link is different from the validity period of the group two-dimensional code provided in the conventional technology, the validity period of the group two-dimensional code is generally fixed, for example, seven days later, and the group link may be provided by the group server 120 to continuously provide the service from the creation of the link, for example, the service period may be until the group server 120 is damaged, and the like, and the service cannot be provided for the link any more. When the group entering link is triggered, the group server 120 may display the group information, such as the group entering code, the number of group members, and the like, of the related group on the webpage corresponding to the group entering link, so that the group entering invitation information, such as the group entering code, of the at least one group may be obtained by triggering the group entering link.

In some embodiments, in order to share the group entering link, the group server 120 may present the group entering link in a form of a two-dimensional code, where the two-dimensional code carrying the group entering link is referred to as a group entering two-dimensional code, and the group entering two-dimensional code may be generated by the group server 120 and then sent to the link creation user, and the group entering two-dimensional code may be shared to the client 110 by the link creation user, or may be directly sent to the client 110 by the group server 120. In addition, the client 110 may also actively obtain the group entry two-dimensional code, for example, after the other clients receive the group entry two-dimensional code, the client 110 may read the group entry two-dimensional code displayed by the other clients, or receive the group entry two-dimensional code from the other clients.

Step S202, sending a group invitation acquisition request generated by triggering a group link to a group server of at least one group, so that the group server returns a group code corresponding to a group with less group member number based on the at least one group;

in this step, the client 110 may trigger the group entry link to generate a corresponding group entry invitation obtaining request. The triggering group entering link may be in various forms, for example, for a triggering group entering link directly presented, the triggering may be performed by clicking the group entering link, or for a triggering group entering link presented in the form of a group entering two-dimensional code, the triggering group entering link may be triggered by scanning or long-pressing the group entering two-dimensional code.

After the group link is triggered, the client 110 obtains a group invitation obtaining request for accessing the group link, the group invitation obtaining request is routed to the group server 120, and the group server 120 responds to the group invitation obtaining request, for example, group invitation information in the form of a group code, a group confirmation link, and the like corresponding to a group with a less than full number of group members may be returned to the client 110 based on the number of group members of at least one group having a mapping relationship with the group link. For example, the group server 120 may randomly return a group entry code to the client 110 from the group with the lower number of group members.

Step S203, displaying the group invitation information, which is used for the user waiting for group to join the group with less group member number.

In this step, the client 110 may receive the group invitation information corresponding to the group with the less than full number of group members returned by the group server 120, for example, in the form of a group entering code, a group entering confirmation link, and display the group invitation information. In this way, the user waiting for group joining can join the group with the less number of group members through the group joining invitation information displayed by the client 110. The number of groups with the number of group members not being full may be one or more, that is, the client 110 may present one or more group invitation messages. For example, in the case of displaying the group entry code of one group, the user to be grouped may join the group corresponding to the group entry code by scanning or pressing the group entry code for a long time, and in the case of displaying the group entry codes of a plurality of groups, the user to be grouped may select one or more groups from the group to join. It should be noted that the client 110 may be a client used by the group entry user, at this time, the group entry user may perform a long-time pressing operation on the two-dimensional code displayed by the client 110 to join the corresponding group, or the client 110 may not be a client used by the group entry user, at this time, the group entry user may join the corresponding group by scanning the client used by the group entry user or shooting the group entry code displayed by the client 110.

In some embodiments, the client 110 may further display a group entering confirmation link, and the user waiting to enter the group may confirm to join the corresponding group by clicking the group entering confirmation link on the client 110.

In the group entry method, the client 110 obtains a group entry link having a mapping relationship with at least one group, and sends a group entry invitation obtaining request generated by triggering the group entry link to the group server 120 of the at least one group, the group server 120 sends group entry invitation information corresponding to the group with the less than full number of group members to the client 110 based on the at least one group, and the client 110 can display the group entry invitation information for the user waiting for group to join the group with the less than full number of group members. The scheme can provide the group entering link for the client 110 to map to one or more groups selected in advance, when the group entering link is triggered, the group server 120 can return group entering invitation information such as a group entering code of the group with the lower number of group members to the client 110, a user waiting for group entering can join the group with the lower number of group members in a mode of scanning the group entering code, and the like, so that the problem that the group members need to frequently generate new group two-dimensional codes for sharing when the group members directly share the group two-dimensional codes to invite external users to join the group in the related art can be solved, and the group entering efficiency is improved.

In one embodiment, the acquiring the group link in step S201 may include:

acquiring a group entering two-dimensional code carrying a group entering link; the two-dimension code of the group is generated by the group server according to the link of the group.

In this embodiment, the client 110 may receive the group entering two-dimensional code carrying the group entering link, so as to identify the group entering link carried by the group entering two-dimensional code from the group entering two-dimensional code. The two-dimensional code for group entry may be generated by the group server 120 according to a group entry link, specifically, the group server 120 may generate a unique group identifier for mapping to the at least one group, and then generate two-dimensional code picture data including the group identifier, an access link identified by the two-dimensional code picture data may include the group identifier, the access link corresponds to the group entry link, and the group server 120 may share the group entry two-dimensional code picture data of the group entry link to the client 110 through a link creation user, so that the client 110 may receive the group entry two-dimensional code picture data, which is shared by the link creation user and carries the group entry link.

The client 110 may identify a group entry link containing a group identifier in the two-dimensional code picture data by long-pressing or scanning the group entry two-dimensional code picture data, then access a group entry invitation acquisition request generated corresponding to the group entry link to route to the group server 120, and the group server 120 may query at least one group having a mapping relationship with the group entry link according to the group identifier carried in the group entry invitation acquisition request and return a group entry code corresponding to a group with a lower number of group members.

In this embodiment, the client 110 may receive the group entering link presented in the form of the two-dimensional code, because the two-dimensional code picture is convenient for sharing and spreading, and the group entering link may have a permanent validity period, in this way, the link creation user may persistently share the corresponding group entering two-dimensional code after selecting a plurality of groups, so that different clients join the group chat through the group entering two-dimensional code with the permanent validity period, and a new group two-dimensional code is not required to be generated by group members when the group member expires due to the inherent validity period of the group entering code, thereby improving the group entering efficiency and improving the user experience of the user entering the group.

In another embodiment, referring to fig. 3, fig. 3 is a schematic flowchart of a step of acquiring a group link in an embodiment, and the acquiring a group link in step S201 may include:

step S301, receiving subprogram data; wherein, the subprogram data is generated according to the subprogram link and the group entering link;

step S302, displaying the subprogram page including the group link according to the subprogram link.

In this embodiment, the client 110 may obtain the group link in a subroutine. In particular, client 110 may receive subroutine data that is generated based on subroutine links and group links. The client 110 may open a corresponding sub program page according to a sub program link in the sub program data, where the sub program page includes a group entering link, and the group entering link may be a button on the sub program page, and by clicking the button, the client 110 may trigger the group entering link in the sub program page.

The explanation will be given taking as an example the client 110 that installs the wechat program whose applet corresponds to the foregoing subroutine. Specifically, the client 110 may receive the applet data sent by the wechat friend or the wechat group chat in the wechat program, where the wechat friend may be the link creation user, and the link creation user may also send the applet data to the client 110 by the wechat group chat, the client 110 may open a corresponding applet page according to the applet link in the applet data, the applet page may display a button corresponding to the group entering link, and by clicking the button, the client 110 may trigger the group entering link, so that the group server 120 returns the group entering code corresponding to the group with the group member number not full, and the client 110 may display the group entering code in the wechat program, so that the group waiting user joins the corresponding group.

In one embodiment, in step S202, in the process that the group server 120 returns the group invitation information corresponding to the group with the less than full number of group members based on at least one group, the group server 120 may further perform intelligent analysis based on the user information of the user to be group-entered, and may specifically perform analysis on the user information such as interests, social habits, and the like, so as to clarify the group-entering intention of the user to be group-entered, and select the group invitation information of the group with the less than full number of group, which is matched with the user information, from the at least one group, and feed the selected group invitation information back to the client 110, so that the user to be group-entered joins the group with the interest and social habits thereof through the group invitation information. In a specific implementation, after receiving the group invitation obtaining request, the group server 120 may further feed back a user information collecting table for collecting user information of the user to be grouped to the client 110, so that the user to be grouped is fed back to the group server 120 by the client 110 for analysis after filling the user information in the user information collecting table, and thus, a group two-dimensional code of a group matching with user information such as interests and habits of the user, social habits of the user, and the like is fed back to the client 110 as group invitation information. In addition, the group server 120 may also acquire the user information of the user to be clustered for analysis by collecting the network operation data of the user to be clustered on the client 110.

In one embodiment, after the sending of the group invitation obtaining request triggering the generation of the group link to the group server of at least one group in step S202, the method may further include the following steps:

receiving group-entering invitation information returned by the group server; when a first group with less than full group member number exists in at least one group, the group invitation information is the group invitation information of the first group; the group invitation message may include a group entry code of the first group; when the number of group members of at least one group is full, the group invitation information is the group invitation information of a second group; the group entry invitation information of the second group may include a group entry code of the second group; the second group is a group created by the group server for at least one group.

In this embodiment, the group invitation information received by the client 110 from the group server 120 may include a group entry code of the first group, and may also include a group entry code of the second group.

The first group is a group with the least number of group members among the groups with less number of group members of at least one group. For example, if the number of the at least one group is 3, which are respectively a group RA, a group RB, and a group RC, and the number of group members of the three groups is not full, at this time, the group server 120 may select a group with the least number of group members from the three groups as a first group, which is a group RA, the group server 120 returns a group entry code (which may be a group two-dimensional code of the group) of the group RA to the client 110 as group entry invitation information, and the user to be grouped may join the group RA by scanning the group entry code of the group RA.

By returning the group invitation information of the group with the least number of group members to the client 110 for the joining of the user waiting for the group, the group server 120 can conveniently and uniformly coordinate the number of people distributed to each group.

Further, in some embodiments, before returning the group entry code of the group RA to the client 110, the group server 120 may update the validity period of the group entry code of the group RA, generally speaking, the validity period of the group entry code is seven days, and before sending the group entry code of the group to the client 110 each time, the group server 120 may update the group entry code of the group to have the validity period of seven days again, and then send the group entry code with the updated validity period to the client 110.

In this way, on one hand, the group access information of the at least one group can be broadcasted and shared by sharing the group access link with the permanent validity period, and on the other hand, after the client 110 triggers the group access link, the group server 120 can update the validity period of the group access code of the corresponding group in time, and send the group access code with the updated validity period as the group access invitation information to the client 110 for the user waiting for group access to join the group, so that the problem that the user cannot join the group due to the expiration of the group access code or the expiration of the number of people can be avoided, and the group access efficiency is improved.

In addition, if all group members of at least one group are full, the group server 120 may automatically regenerate a new group for the at least one group, and the owner of the new group may be generated by the group members of the at least one group, or may be reassigned, and the specific owner selection manner may be determined by the actual situation. After creating a new group, the group server 120 may obtain the group entry code of the new group as the group entry invitation information and send the group entry invitation information to the client 110.

In this way, when all the groups of the at least one group are in the full state, the group server 120 can automatically generate a new group, so that the group server 120 can continuously add new groups to the at least one group, thereby avoiding the problem that the user waiting for entering the group can not join the corresponding group even if the group number is full.

In an embodiment, a group entry method is further provided, as shown in fig. 4, fig. 4 is a schematic flow chart of the group entry method in another embodiment, and the method may include the following steps:

step S401, the client 110 obtains the group link;

wherein, the group link has a mapping relation with at least one group.

Step S402, the client 110 sends a group invitation acquiring request generated by triggering the group link to the group server of at least one group, so that the group server returns a group code corresponding to a group with less group member number based on the group member number of the at least one group;

the client 110 may obtain the group link from the link creation user or directly from the group server 120, and the group link may be presented in the form of an applet or a two-dimensional code picture. The client 110 may trigger the group entering link on the applet page, or may trigger the group entering link by scanning or long-pressing a two-dimensional code image carrying the group entering link, and send a group entering invitation acquisition request generated by triggering the group entering link to the group server 120, where the group server 120 may query the number of group members of each group in at least one group, and return a group entering code corresponding to a group with a group member number less than the number of the group members to the client 110.

Step S403, the client 110 receives the group entry code returned by the group server; when a first group with less than full group member number exists in at least one group, the group entering code is the group entering code of the first group; the first group is the group with the least number of group members in the groups with less number of group members; when the number of the group members of at least one group is full, the group entering code is the group entering code of the second group; the second group is a group newly established for at least one group by the group server;

in this step, the client 110 may receive the group entry code returned from the group server 120. When the first group with the less than full number of group members exists in the at least one group, the group entry code may be a group entry code of a group with the least number of group members in the group with the less than full number of group members, and when the group members of the at least one group are all full, the group entry code may be a two-dimensional code of a group newly created for the at least one group by the group server. The group server 120 may also update the validity period for the group entry code for the first group each time before returning it to the client 110, so that the group entry code for the first group sent to the client 110 has the longest validity period that the group entry code can have, e.g., seven days.

In step S404, the client 110 displays the group entry code for the user waiting to join the group with less group members.

According to the technical scheme of the embodiment, the client 110 may trigger the permanent and effective group entering link, so that the group server 120 returns the group entering code corresponding to the group with the less number of group members, and based on the group entering code, the user waiting for group entering may join the corresponding group, thereby avoiding the problem that the user cannot join the group due to the expired group entering code or the full number of people, and improving the group entering efficiency.

In an embodiment, a group entering method is further provided, as shown in fig. 5, fig. 5 is a schematic flow chart of a group entering method in another embodiment, which is described by taking the method as an example applied to the group server 120 in fig. 1, and the group entering method may include:

step S501, receiving a group access invitation acquisition request generated by a client triggering a group access link;

in this step, the group server 120 may receive a group invitation obtaining request generated by the client 110 triggering a group link, where the group link has a mapping relationship with at least one group. Wherein the group-entering link may be generated by the group server 120 after the link-creating user selects at least one group. Specifically, the group server 120 may generate a unique group identifier mapped to at least one group after the link creation user selects the at least one group, and further generate a group entering link carrying the unique group identifier, where the group entering link may be a permanent and effective web page link, and the group server 120 provides services, and the group server 120 may display group information, such as the number of group members, of the at least one group on the web page.

The group access link may be shared to the client 110 in a form of a two-dimensional code, the client 110 may trigger the group access link in a manner of overscan or long-pressing the group access two-dimensional code, and after the group access link is triggered, the corresponding group access invitation acquisition request may be routed to the group server 120, so that the group server 120 may receive the group access invitation acquisition request, and the group access invitation acquisition request may carry the group identifier, and may be used for the group server 120 to query at least one group having a mapping relationship with the group identifier according to the group identifier.

Step S502, in response to the group invitation acquiring request, based on at least one group, sending the group invitation information corresponding to the group with the less than full number of group members to the client, so that the client displays the group invitation information, and is used for the group-waiting user to join the group with the less than full number of group members.

In this step, the group server 120 responds to the group invitation acquiring request sent by the client 110, and since the group invitation acquiring request also has a mapping relationship with at least one group, the mapping relationship may be determined by a group identifier carried in the group invitation acquiring request. The group server 120 responds to the group invitation obtaining request, may query the number of group members of each group in the at least one group according to the mapping relationship between the request and the at least one group, and then sends the group invitation information, such as the group entering code, corresponding to the group with the less number of group members to the client 110. In some embodiments, the group server 120 may randomly return a group entry code for one of the groups to the client 110 from the groups with the lower number of group members.

The client 110 may receive the group invitation information returned by the group server 120 and present the group invitation information, such as the group invitation code, and the presented group invitation information may be used for the user waiting for group to join the group with the group member number not being full.

It should be noted that the number of the groups with the lower number of the group members queried by the group server 120 may be multiple, in this case, the group server 120 may return all the group invitation information corresponding to the groups with the lower number of the group members to the client 110, and the client 110 may display all the group invitation information, so that the user waiting to join may select one or more groups from the group invitation information to join.

In the group access method, the group server 120 receives a group access invitation acquisition request generated by triggering a group access link by the client 110, responds to the request, and sends group access invitation information corresponding to a group with a less than full number of group members to the client 110 based on at least one group, so that the client 110 can display the group access invitation information such as the group access code, and a user waiting for group access can join the group with the less than full number of group members by means of long-time pressing, scanning of the group access code, and the like. According to the scheme, after the client 110 triggers the group entering link, the group server 120 returns group entering invitation information of a group with a lower group member number in at least one group selected in advance to the client 110 for the client 110 to display, so that a user waiting for group entering can join in the corresponding group by scanning the group entering code and the like, and the group entering efficiency is improved.

In an embodiment, as shown in fig. 6, fig. 6 is a flowchart illustrating a step of sending a group incoming link in an embodiment, and before the receiving of the group incoming invitation acquisition request generated by the client triggering the group incoming link in step S501, the method may further include:

step S601, determining at least one group selected by a link creation user;

in this step, the group server 120 may determine at least one group selected by the link creation user. The link creating user may select or create one or more groups as the at least one group, the link creating user may or may not be a group member of the at least one group, after the link creating user selects the at least one group, the group server 120 may obtain the at least one group, and may further create a group list for the at least one group, where the group list may include group numbers corresponding to the groups, and the group number of each group may be found through the group list.

Step S602, generating a group identifier mapped to at least one group;

in this step, the group server 120 may assign a unique group identifier to at least one group after the link creation user selects the group, so as to construct a mapping relationship with the group. Specifically, the group server 120 may construct the group list, and generate a group identifier mapped to the group list, so as to implement a mapping relationship between the group identifier and the at least one group, and through the group identifier, the group server 120 may uniquely map to the at least one group.

Step S603, creating a user through the link, and sending the group entering link carrying the group identifier to the client.

In this step, the group server 120 may create a user through a link, share the group identifier carried in the group link to the client 110, and the group link may further have a permanent validity period. The incoming group link can be propagated and shared to the client 110 by the link creation user. In this way, after the link creating user selects multiple groups, the group entering link having a mapping relationship with the multiple groups and having a permanent validity period may be directionally shared, for example, may be shared with the client 110, so that the group entering link may be received from the client 110 by the group entering user that the link creating user desires to join the corresponding group, and is convenient to invite to enter the group chat.

In one embodiment, the creating a user through a link in step S603, and sending the group entry link carrying the group identifier to the client includes:

and generating a group entering two-dimensional code carrying the group entering link, and sending the group entering two-dimensional code to a link creation user for sending the group entering two-dimensional code to the client by the link creation user.

The present embodiment may share the group link to the client 110 in the form of a two-dimensional code. Specifically, the group server 120 may generate a group link carrying a group identifier having a mapping relationship with at least one group, and then generate two-dimensional code image data including the group link.

For example, the group server 120 may directly send the two-dimensional code picture data to the link creation user, or send a download address of the two-dimensional code picture data to the link creation user, and the link creation user downloads the two-dimensional code picture data through the download address to relieve the data processing pressure of the group server 120.

After the group server 120 sends the two-dimensional code to the link creating user, the link creating user may send the two-dimensional code to the client 110. Specifically, the client 110 may be a client 110 that installs a wechat program, the link creation user may send the group entry two-dimensional code to the wechat program, and the client 110 may obtain the group entry two-dimensional code through the wechat program.

The scheme of this embodiment provides a way of sharing the group entering link to the client 110 in a form of a two-dimensional code, the group server 120 sends the group entering two-dimensional code carrying the group entering link to the link creating user, and the link creating user shares the group entering two-dimensional code to the client 110, so that the user to be grouped, who the link creating user desires to join the corresponding group, can obtain the group entering link from the client 110 in a form of two-dimensional code picture data, and the group entering link is invited to participate in group chat and is also convenient to be widely spread and shared.

In another embodiment, the creating a user through a link in step S603, and sending the group entry link carrying the group identifier to the client includes:

and sending the group identifier to a link creation user, wherein the link creation user acquires the subprogram data according to the subprogram link and the group entering link carrying the group identifier, and sends the subprogram data to the client.

The present embodiment may share the incoming group link to the client 110 in the form of a subroutine, which may be a WeChat applet. Specifically, the group server 120 may first send a group identifier having a mapping relationship with at least one group to the link creation user, and the link creation user may obtain a subprogram link and a group entering link carrying the group identifier according to the packaging format of the subprogram page data, then obtain subprogram data according to the subprogram link and the group entering link carrying the group identifier, and send the subprogram data to the client 110. The client 110 may open a corresponding sub-program page according to the sub-program link in the sub-program data, the group entering link is displayed on the sub-program page, and the group entering link may be displayed on the sub-program page in a button form, so that the client 110 may trigger the corresponding group entering link by clicking the button on the sub-program page, and then the group server 120 may receive the corresponding group entering invitation acquisition request, and send the group entering code corresponding to the group with the lower group member number to the client 110 for displaying.

The scheme of this embodiment provides a way of sharing the group link to the client 110 in a subprogram form, where the group server 120 delivers a group identifier having a mapping relationship with at least one group to a link creation user to generate corresponding subprogram data according to a packaging format of subprogram page data, and the client 110 can access a subprogram page including the group link according to the subprogram data, so that the group link can be triggered on the subprogram page to make the group server 120 return a group code of the group, and join the corresponding group by scanning or long-pressing the two-dimensional code, so that the group mode and channel are more diverse, and the propagation and sharing of the group link are facilitated.

In an embodiment, as shown in fig. 7, fig. 7 is a flowchart illustrating a step of sending a group invitation message to a client in an embodiment, where the step S502, in response to a group invitation obtaining request, sends, to the client, a group entry code corresponding to a group with a group member number that is not full based on a group member number of at least one group, and includes:

step S701, responding to the group invitation obtaining request, and sending group invitation information of a first group to a client when the first group with less group member number exists in at least one group; the first group is the group with the least number of group members in the groups with less number of group members; the group invitation information of the first group may include a group access code of the first group;

step S702, when the number of group members of at least one group is full, a second group is newly established for the at least one group, and group invitation information of the second group is sent to the client; the group invitation information of the second group may include a group entry code of the second group.

In this embodiment, the group server 120 may return group invitation information, such as a group entry code, of the corresponding group to the client 110 according to the number of each group member in at least one group. Specifically, in the aforementioned at least one group, if the group server 120 queries that a group with less members exists in the at least one group after receiving the group invitation acquisition request, the group server 120 may select a group with the least number of group members from the group, and send the group invitation information corresponding to the group with the least number of group members to the client 110, and the group with the least number of group members may be selected to balance and coordinate the number of group members of each group.

In addition, if the group server 120 queries that the number of group members of each group of the at least one group is full after receiving the group invitation acquisition request, the group server 120 may automatically create a group for the at least one group and send the group invitation information of the created group to the client 110, so as to avoid the problem that the client 110 cannot join any group chat due to the full number of group members, and a new group may be automatically created by the group server 120 without re-creation of related group members or link creation users, thereby improving group establishment and group entry efficiency.

In an embodiment, further, the sending the group invitation information of the first group to the client in step S701 may include:

and updating the validity period of the group entering code of the first group, and sending the group entering invitation information including the group entering code of the first group with the updated validity period to the client.

The group server 120 may update the validity period of the group entry code before sending the group entry invitation message including the group entry code of the first group to the client 110, because the group entry code of the group usually sets a validity period of, for example, seven days, and if the group entry code of the first group is directly sent to the client 110, it may be possible that the group entry code of the first group scanned by the user has passed the validity period, and the user waiting for group entry cannot join the first group even after scanning, and in this embodiment, the group server 120 may update the validity period before sending the group entry code of the first group to the client 110, so that the group entry code of the first group may have the longest validity period of, for example, seven days, and the group entry invitation message including the updated group entry code of the first group of the validity period may be sent to the client 110 again, therefore, the group entering code of the first group scanned by the group entering user cannot have the overdue problem, the group entering efficiency is improved, and the group entering experience of the user is improved.

In an embodiment, a group entry method is further provided, as shown in fig. 8, fig. 8 is a schematic flow chart of the group entry method in yet another embodiment, and the group entry method may include:

step S801, the group server 120 determines at least one group selected by the link creation user;

step S802, the group server 120 generates a group id mapped to at least one group;

step S803, the group server 120 creates a user through a link, and sends a group link carrying a group identifier to the client 110;

step S804, the group server 120 receives a group invitation acquiring request generated by triggering the group link by the client 110;

step S805, in response to the group invitation obtaining request, the group server 120 updates the validity period of the group entry code of the first group when the first group with the lower number of group members exists in at least one group, and sends the group entry code of the first group with the updated validity period to the client 110; the first group is the group with the least number of group members in the groups with less number of group members; when the number of group members of at least one group is full, a second group is created for the at least one group, and the group entry code of the second group is sent to the client 110.

According to the technical scheme of the embodiment, the group server 120 may provide the client 110 with a permanent and effective group entering link, after the client 110 triggers the group entering link, the group server 120 may respond to the corresponding group entering invitation acquisition request and return the group entering code corresponding to the group with the unsatisfied number of group members, so that the client 110 displays the group entering code, based on the displayed group entering code, the user waiting for group entering may join the corresponding group, which may avoid the problem that the user cannot join the group due to the expired group entering code or the full number of people, thereby improving the group entering efficiency.

In an embodiment, a group entry method is provided, as shown in fig. 9, fig. 9 is a signaling diagram of the group entry method in an embodiment, and the group entry method may be executed by a client 910 and a group server 920 in cooperation, and includes the specific steps of:

step S901, the client 910 obtains a group link;

the group link has a mapping relation with at least one group, and can be a group link with a permanent validity period.

Step S902, the client 910 sends a group invitation acquiring request generated by triggering a group link to the group server 920;

the client 910 may trigger the group entry link and send the generated group entry invitation acquisition request to the group server 920;

step S903, the group server 920 receives a group invitation acquiring request generated by triggering the group link by the client 110;

step S904, the group server 920 sends the group invitation information corresponding to the group with less than full number of group members to the client 110 based on at least one group in response to the group invitation acquiring request;

step S905, the client 910 displays group invitation information for a user waiting for group joining a group with a less than full number of group members;

the client 910 receives the group invitation information returned by the group server 920, and displays the group invitation information such as the group access code, and the user waiting for group access can join the group with the less number of group members by scanning, pressing the group access code, and the like.

The group entering method provided by the above embodiment may be executed by the client 910 and the group server 920 in cooperation, the group server 920 may provide the client 910 with a group entering link having a permanent validity period to map to one or more groups selected in advance, the client 910 may trigger the group entering link, and then the group server 920 may return group entering invitation information of a group with a group member number that is not full among the one or more groups to the client 910, so that the client 910 may display the group entering invitation information, and a user waiting to enter the group joins the group with the group member number that is not full, thereby improving the group entering efficiency.

To further illustrate the group entering method provided by the present application, the group to be entered may be an interworking group of the enterprise wechat client and the wechat client, that is, the users in the interworking group that may include the wechat client may also include users of the enterprise wechat client, specifically, after the service staff of the enterprise wechat may add wechat users or other users of the enterprise as friends (clients), the interworking group pulled by these clients may be referred to as a client group.

The actively pulled customer group needs the relationship between the service personnel and the user as friends, and besides, the two-dimensional code of the group of the intercommunication group can be shared for other users to actively scan the code to join. However, in the manner provided by the related art, the group two-dimensional code generally has a validity period of 7 days, and after the expiration period, the group two-dimensional code cannot be scanned and added by the two-dimensional code shared before, and a new group two-dimensional code needs to be regenerated again. For example, when an enterprise wants to perform an online operation, it may need to create a plurality of client groups, such as client group a, client group B, and client group C, and then want an external user to join one of the client groups, so that it needs to send out two-dimensional codes of several client groups a, B, and C, but because of the validity period and the people fullness, the technology has the problems of low efficiency of group entering and poor experience of group entering.

The group entering method provided by the application can generate a unique two-dimensional code (also called a group entering two-dimensional code) which can be mapped to the client group A, the client group B and the client group C, the group entering two-dimensional code is permanently effective and then is sent to an external user, the external user can be dynamically allocated with the client group two-dimensional code with the least number of people among the client group A, the client group B or the client group C after scanning the two-dimensional code (meanwhile, the validity period of the client group two-dimensional code can be updated, and when the client group A, the client group B and the client group C are all full, a new client group D can be generated to return to the external user, so that the user can not encounter the problem of the validity period or the full of people when scanning the code two-dimensional code, thereby improving the group entering efficiency and improving the group entering experience of the user.

The method comprises the steps that a group two-dimensional code is entered into a group, the group two-dimensional code can be combined with a WeChat applet of an enterprise, the WeChat of the enterprise is taken as an example, the WeChat of the enterprise generates an applet plug-in identification Pluginid which can map a plurality of groups, the applet of the enterprise can bind the Pluginid with a certain page path, and therefore when a user clicks the page path of the applet, the Pluginid can be used for exchanging the WeChat of the enterprise for a randomly distributed client group two-dimensional code, the client group two-dimensional code on a service notification belt can be further pushed, and the user can join a corresponding client group according to the client group two-dimensional code.

The scheme of the application example is described with reference to the group management system shown in fig. 10, where fig. 10 is a schematic diagram of an architecture of the group management system in an application example, and the technical framework mainly includes the following parts:

1) enterprise WeChat client: generating a group entering two-dimensional code, performing interactive processing of a group entering small program, and performing conversation and group message logic.

2) Enterprise WeChat background server: the generation and management of the two-dimensional code of the group, and the management and message notification processing related to the group are the main points.

3) Intercommunicating IMUnion backstage: and transferring group-related operations and messages between the enterprise wechat background and the wechat.

4) WeChat background: group operations from WeChat clients are processed.

5) The WeChat client side: mainly group operations, group two-dimensional codes, group messages, etc.

6) WeChat OpenSDK: and the data from the enterprise wechat client to the wechat client is transmitted on the same equipment without background transfer.

As shown in fig. 11, fig. 11 is an interface diagram of a group chat function in an application example, an enterprise administrator or a service administrator (called user WW _ a, for example, zhang san may be used as the user WW _ a) may enter the "group chat" function of the client group application through a workbench on an enterprise wechat client, and the user WW _ a may select a "scan two-dimensional code to join the group chat" portal or a "join the group chat" portal in a applet "on the interface shown in fig. 11 to implement external user code scanning group processing.

The following description will be made by taking "scan two-dimensional code to join group chat" and "join group chat in applet" as examples.

First, a group entering mode of "scanning two-dimensional code to join group chat" is described, as shown in fig. 12, fig. 12 is a signaling diagram of a group entering method in an application example, and a specific flow may include:

timings S1201 to S1203:

and the user WW _ A enters a group chat adding function of the client group application through a workbench of the enterprise WeChat client, selects a two-dimensional code scanning and adding inlet of the group chat adding function, and starts a group entering two-dimensional code creating process. As shown in fig. 13, fig. 13 is an interface diagram of creating a group two-dimensional code in an application example, where the interfaces 1310 to 1330 are shown as effect display diagrams of creating a group two-dimensional code, the user WW _ a may select an existing customer group or may create a new customer group, and assuming that the user WW _ a selects multiple customer groups RA, RB, and RC, then the enterprise wechat client will automatically transfer the customer group list (roomid _ list) of the several customer groups selected by the user WW _ a to the enterprise wechat backend server. The enterprise wechat background server generates a unique group identifier (ctcode) for mapping a client group list (roomid _ list), then generates two-dimensional code picture data containing the group identifier (ctcode), wherein the identified group-in link url of the two-dimensional code picture data contains the group identifier (ctcode), and allocates a download address qrcode _ url for downloading the group-in two-dimensional code picture data.

Timings S1204 to S1205:

the user WW _ A can download the corresponding group-entering two-dimensional code picture data according to the download address qrcode _ url, and then can share the two-dimensional code picture data to the WeChat friend or the WeChat group chat of the user through the WeChat OpenSDK.

Timings S1206 to S1209:

as shown in fig. 14, fig. 14 is an interface diagram of an application example for joining a group chat by a group two-dimensional code, and referring to interfaces 1410 to 1420 shown in fig. 14, after receiving a picture of the group two-dimensional code, a long-press or a code-scan is performed on a wechat friend or other wechat users in the wechat (called user WX _ B, such as lee four, which can be used as the user WX _ B), the wechat client identifies group link url information (including a group identifier ctcode, such as a format similar to https:// work. weixin. qq. com/crmrocode. xxx) in the two-dimensional code picture, and then a request for accessing the group link url is routed to the enterprise wechat server, the enterprise wechat server reads a client group identifier list corresponding to the group identifier cte according to the group identifier cte in the group link url, and then randomly returns a population group link code corresponding to a current group chat client group chat, for example, the random return is the group two-dimensional code corresponding to the client group RA to the user WX _ B.

Timings S1210 to S1217:

referring to the interfaces 1420 to 1440 in fig. 14, the user WX _ B further presses the group two-dimensional code of the client group RA, and initiates a request to join the client group RA through the "join group chat" button, and after the join request is confirmed by the WeChat background server and the interworking server IMUnion, the user WX _ B can enter the client group RA, and then the interworking server IMUnion can further push the notification of the user WX _ B entering to other members of the client group RA group chat.

Through the above sequences S1201 to S1217, the function of inviting the external user to enter the group can be realized through the group entering manner of "scanning the two-dimensional code to join the group chat".

Next, a group entering manner of "join group chat in applet" is described, as shown in fig. 15, fig. 15 is a signaling diagram of another group entering method in an application example, and a specific flow may include:

timings S1501 to S1503;

as shown in fig. 16, fig. 16 is an interface diagram of group applet creation in an application example, where the interfaces 1610 to 1630 in fig. 16 show an effect of creating a "group applet", a flow of creating a group applet, and similar to a group two-dimensional code, a user WW _ a also selects a roomid _ list of a plurality of client groups to transmit to an enterprise wechat backend server, and the enterprise wechat backend server generates a unique applet plugin identifier plugin, stores a mapping relationship of (the plugin _ list), and returns the applet plugin identifier to the user WW _ a.

Timings S1504 to S1505;

referring to fig. 16, after the user WW _ a receives the applet plug-in identifier plugin, a page path of the applet may be spliced (for example, pages/crmrom/indexperientid ═ xxx, this page path may be combined with the applet of the enterprise where the user WW _ a is located, and it is not necessary to use the applet of the enterprise WeChat), and then the applet page data is shared to the WeChat friend or WeChat group chat provided by the WeChat OpenSDK.

Timings S1506 to S1507;

referring to fig. 16, the wechat user WX _ B opens the shared applet, jumps to the corresponding applet page by default, clicks "join group chat" (corresponding to the link into the group) on the page, and triggers the delivery of the applet plug-in identification plugin id on the page to the enterprise wechat backend server.

Timings S1508 to S1509;

as shown in fig. 17, fig. 17 is an interface diagram for joining a group chat by a group applet in an application example, where interfaces 1710 to 1740 shown in fig. 17 show an effect that a user joins the group chat by the group applet, after receiving an applet plugin identifier plugin, the enterprise wechat backend server reads the applet plugin identifier plugin corresponding to a group list roomid _ list, randomly returns group two-dimensional code information of a roomid that is not full of a current group (for example, a group two-dimensional code of a client group RA), and pushes the group two-dimensional code information to an interworking server imuon, and then pushes the group two-dimensional code information of the client group RA to a service notification session of a wechat user WX _ B in a service notification form through the wechat backend server.

Timings S1510 to S1518;

referring to fig. 17, after the wechat user WX _ B opens the group two-dimensional code message in the service notification session, the "join group chat" interface is displayed, after the join group chat is clicked, the join request is confirmed by the wechat background server and the interworking server imuion, the wechat group can enter the group chat of the client group RA, and then the notification of the wechat user WX _ B entering is pushed to other members of the client group RA group chat.

Through the above sequences S1501 to S1518, the function of inviting the external user to the group can be realized by the group-entering manner of "join group chat in applet".

Therefore, according to the scheme of the application example, a plurality of different client groups can be mapped onto a group-entering two-dimensional code or applet plug-in identification plugin which is not overdue permanently (and can be automatically grouped when people are full), so that the problem that an external user possibly encounters overdue or full group when entering the client group can be solved, the group-entering efficiency is improved, and the group-entering experience of the user is improved.

It should be understood that although the steps in the flowcharts of fig. 2 to 17 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2 to 17 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the steps or stages is not necessarily sequential, but may be performed alternately or alternately with other steps or at least some of the other steps or stages.

In one embodiment, as shown in fig. 18, fig. 18 is a block diagram of a clustering device in an embodiment, and provides a clustering device 1800, which may be a part of a computer device by using a software module or a hardware module, or a combination of the two, and specifically includes:

a link obtaining module 1801, configured to obtain a group link; the group-entering link has a mapping relation with at least one group;

a request sending module 1802, configured to send a group invitation obtaining request generated by triggering a group link to a group server of at least one group, so that the group server returns, based on the at least one group, group invitation information corresponding to a group with a less than full number of group members;

a group information display module 1803, configured to display group invitation information, where the group invitation information is used for a user waiting for group to join a group with a less than full number of group members.

In one embodiment, the clustering apparatus 1800 further includes: the group invitation receiving module is used for receiving the group invitation information returned by the group server; when a first group with less than full group member number exists in at least one group, the group invitation information is the group invitation information of the first group; the group invitation message comprises a group entering code of the first group; when the number of group members of at least one group is full, the group invitation information is the group invitation information of a second group; the group access invitation information of the second group comprises a group access code of the second group; the second group is a group created by the group server for at least one group.

In an embodiment, the link obtaining module 1801 is further configured to obtain a group entry two-dimensional code carrying a group entry link; and the group entering two-dimensional code is generated by the group server according to the group entering link.

In one embodiment, the link obtaining module 1801 is further configured to receive the subroutine data; the subprogram data is generated according to the subprogram link and the group entering link; and displaying the subprogram pages including the group links according to the subprogram links.

In one embodiment, as shown in fig. 19, fig. 19 is a block diagram of a clustering device in another embodiment, which provides a clustering device 1900, where the clustering device may be a part of a computer device using software modules or hardware modules, or a combination of the two, and the device specifically includes:

a request receiving module 1901, configured to receive a group invitation acquiring request generated by triggering a group entering link by a client; the group-entering link has a mapping relation with at least one group;

the request response module 1902, configured to, in response to the group invitation obtaining request, send, based on at least one group, group invitation information corresponding to a group with a smaller number of group members to the client, so that the client displays the group invitation information, where the group invitation information is used for a user to join the group with the smaller number of group members.

In one embodiment, the clustering apparatus 1900 further includes: a link sending module for determining at least one group selected by a link creation user; generating a group identification mapped to at least one group; and creating a user through the link, and sending the group entering link carrying the group identification to the client.

In one embodiment, the link sending module is further configured to generate a group entering two-dimensional code carrying the group entering link; and sending the two-dimension code of the group to a link creation user, wherein the link creation user is used for sending the two-dimension code of the group to the client.

In an embodiment, the link sending module is further configured to send the group identifier to a link creating user, and the link creating user acquires the subprogram data according to the subprogram link and the group entering link carrying the group identifier, and sends the subprogram data to the client.

In one embodiment, the request response module 1902, further configured to, in response to the group invitation obtaining request, send group invitation information of a first group to the client when the first group with the lower number of group members than the full number exists in at least one group; the first group is the group with the least number of group members in the groups with less number of group members; the group access invitation information of the first group comprises a group access code of the first group; when the number of the group members of at least one group is full, a second group is newly established for the at least one group, and group access invitation information of the second group is sent to the client; the group invitation information of the second group comprises a group entering code of the second group.

In one embodiment, the request response module 1902 is further configured to update the validity period of the group entry code of the first group, and send the group entry invitation message including the group entry code of the first group whose validity period is updated to the client.

For specific limitations of the clustering device, reference may be made to the above limitations of the clustering method, which are not described herein again. The modules in the grouping apparatus can be implemented wholly or partially by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In an embodiment, a group management system is further provided, as shown in fig. 20, fig. 20 is a block diagram illustrating a structure of the group management system in an embodiment, where the group management system may include: clients 2010, and group server 2020, wherein,

a client 2010 for obtaining a group entry link; the group-entering link has a mapping relation with at least one group;

the client 2010 is further configured to send a group invitation acquiring request generated by triggering the group link to the group server 2020 of at least one group;

the group server 2020, configured to receive a group invitation acquiring request generated by triggering a group link by the client 2010;

the group server 2020, further configured to send group invitation information corresponding to a group with a smaller number of group members than the full number to the client 2010 based on at least one group in response to the group invitation obtaining request;

the client 2010 is further configured to display group entry invitation information, which is used for a user waiting for group entry to join a group with an unsatisfied number of group members.

In the group management system provided in this embodiment, the interaction manner between the client 2010 and the group server 2020 may be further defined with reference to the interaction manner between the client and the group server described in the above group method embodiment. In this embodiment, the group server 2020 may provide the group entry link with the permanent validity period for the client 2010 to be mapped to one or more groups selected in advance, and when the group entry link is triggered, the group server 2020 may return the group entry code of a group with an unsatisfied number of group members among the groups to the client 2010, and a user to be grouped may join the group with an unsatisfied number of group members by scanning the group entry code displayed by the client 2010, which may overcome a problem that, when a group member directly shares the group two-dimensional code to invite an external user to join the group in the related art, the group member needs to frequently generate a new group two-dimensional code for sharing due to, for example, that the sharing time is too long, or the number of group persons corresponding to the group two-dimensional code scanned by the user is already satisfied, and improve the group entry efficiency.

In one embodiment, a computer device is provided, the computer device may be a server, the internal structure of which may be as shown in fig. 21, fig. 21 is an internal structure of the computer device in one embodiment. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing data such as group entering links, the number of group members, group entering invitation information such as group entering codes and the like. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a clustering method.

In one embodiment, a computer device is provided, which may be a client, and its internal structure diagram may be as shown in fig. 22, and fig. 22 is an internal structure diagram of the computer device in another embodiment. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless communication can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a clustering method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.

It will be appreciated by those skilled in the art that the configurations shown in fig. 21 and 22 are only block diagrams of some of the configurations relevant to the present application, and do not constitute a limitation on the computer apparatus to which the present application is applied, and a particular computer apparatus may include more or less components than those shown in the figures, or may combine some components, or have a different arrangement of components.

In one embodiment, a computer device, which may be a client or a server, is further provided, and includes a memory and a processor, where the memory stores a computer program, and the processor implements the steps in the method embodiments when executing the computer program.

In an embodiment, a computer-readable storage medium is provided, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method embodiments.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.

The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A method of clustering, the method comprising:

acquiring a group entering link; the group-entering link has a mapping relation with the created groups;

sending a group invitation acquisition request generated by triggering the group entering link to the group server of the plurality of created groups, so that the group server returns group invitation information corresponding to the group with less group member number based on the plurality of created groups;

2. The method according to claim 1, wherein after sending the group invitation obtaining request triggering the generation of the group link to the group server of the created plurality of groups, further comprising:

receiving the group-entering invitation information returned by the group server; wherein the content of the first and second substances,

when a first group with a less than full number of group members exists in the created plurality of groups, the group invitation information is the group invitation information of the first group; the group invitation information comprises a group entering code of the first group;

when the number of the group members of the created groups is full, the group invitation information is the group invitation information of a second group; the group invitation information of the second group comprises a group entering code of the second group; the second group is a group newly created by the group server for the created groups.

3. The method of claim 1, wherein obtaining the group link comprises:

acquiring a group entering two-dimensional code carrying the group entering link; the group entering two-dimensional code is generated by the group server according to the group entering link.

4. The method of claim 1, wherein obtaining the group link comprises:

receiving sub-program data; the subprogram data is generated according to subprogram links and group entering links;

and displaying the subprogram page comprising the group entering link according to the subprogram link.

5. A method of clustering, the method comprising:

receiving a group access invitation acquisition request generated by triggering a group access link by a client; the group-entering link has a mapping relation with the created groups;

and responding to the group invitation acquisition request, and sending group invitation information corresponding to the group with the less than full number of group members to the client based on the plurality of created groups so that the client displays the group invitation information for the user to be grouped to join the group with the less than full number of group members.

6. The method according to claim 5, wherein before the receiving the group invitation acquisition request generated by the client triggering the group link, the method comprises:

determining the created plurality of groups selected by a link creation user;

generating a group identification mapped to the created plurality of groups;

and creating a user through the link, and sending the group entering link carrying the group identification to the client.

7. The method according to claim 6, wherein the creating a user through the link, and sending the incoming group link carrying the group identifier to the client comprises:

generating a group entering two-dimensional code carrying the group entering link;

and sending the group entering two-dimensional code to the link creating user, wherein the link creating user is used for sending the group entering two-dimensional code to the client.

8. The method according to claim 6, wherein the creating a user through the link, and sending the incoming group link carrying the group identifier to the client comprises:

and sending the group identifier to the link creation user, wherein the link creation user acquires subprogram data according to a subprogram link and a group entering link carrying the group identifier, and sends the subprogram data to the client.

9. The method according to claim 5, wherein said sending, to the client, the group invitation information corresponding to the group with the lower number of group members than the full number of group members based on the created plurality of groups in response to the group invitation obtaining request includes:

responding to the group invitation obtaining request, and when a first group with less than full number of group members exists in the created groups, sending group invitation information of the first group to the client; the first group is the group with the least number of group members in the groups with the less number of group members; the group access invitation information of the first group comprises a group access code of the first group;

when the number of the group members of the created groups is full, creating a second group for the created groups, and sending group invitation information of the second group to the client; the group invitation information of the second group comprises the group entering code of the second group.

10. The method according to claim 9, wherein sending the group invitation information of the first group to the client comprises:

11. A crowd sourcing device, comprising:

the link acquisition module is used for acquiring the group link; the group-entering link has a mapping relation with the created groups;

a request sending module, configured to send a group invitation obtaining request generated by triggering the group entering link to the group server of the created multiple groups, so that the group server returns group invitation information corresponding to a group with a smaller number of group members based on the created multiple groups;

12. The apparatus of claim 11, further comprising: the group invitation receiving module is used for receiving the group invitation information returned by the group server; when a first group with a less than full number of group members exists in the created plurality of groups, the group invitation information is the group invitation information of the first group; the group invitation information comprises a group entering code of the first group; when the number of the group members of the created groups is full, the group invitation information is the group invitation information of a second group; the group invitation information of the second group comprises a group entering code of the second group; the second group is a group newly created by the group server for the created groups.

13. The apparatus according to claim 11, wherein the link obtaining module is configured to obtain a group entry two-dimensional code carrying the group entry link; the group entering two-dimensional code is generated by the group server according to the group entering link.

14. The apparatus of claim 11, wherein the link obtaining module is configured to receive subroutine data; the subprogram data is generated according to subprogram links and group entering links; and displaying the subprogram page comprising the group entering link according to the subprogram link.

15. A crowd sourcing device, comprising:

the request receiving module is used for receiving a group entering invitation acquisition request generated by triggering a group entering link by a client; the group-entering link has a mapping relation with the created groups;

and the request response module is used for responding to the group invitation acquisition request, sending group invitation information corresponding to the group with the less than full number of group members to the client based on the plurality of established groups, so that the client displays the group invitation information and is used for the group-waiting user to join the group with the less than full number of group members.

16. The apparatus of claim 15, further comprising: a link sending module for determining the created groups selected by the link creation user; generating a group identification mapped to the created plurality of groups; and creating a user through the link, and sending the group entering link carrying the group identification to the client.

17. The apparatus of claim 16, wherein the link sending module is configured to generate a grouping two-dimensional code carrying the grouping link; and sending the group entering two-dimensional code to the link creating user, wherein the link creating user is used for sending the group entering two-dimensional code to the client.

18. The apparatus according to claim 16, wherein the link sending module is configured to send the group identifier to the link creating user, and is configured to the link creating user obtain sub-program data according to a sub-program link and a group entering link that carries the group identifier, and send the sub-program data to the client.

19. The apparatus according to claim 15, wherein the request response module is configured to send, in response to the group invitation obtaining request, group invitation information of a first group to the client when the first group with a lower number of group members than the created plurality of groups exists; the first group is the group with the least number of group members in the groups with the less number of group members; the group access invitation information of the first group comprises a group access code of the first group; when the number of the group members of the created groups is full, creating a second group for the created groups, and sending group invitation information of the second group to the client; the group invitation information of the second group comprises the group entering code of the second group.

20. The apparatus of claim 19, wherein the request response module is configured to update a validity period of the group entry code of the first group, and send the group entry invitation message to the client including the group entry code of the first group with the updated validity period.

21. A group management system is characterized by comprising a client and a group server; wherein the content of the first and second substances,

the client is used for acquiring the group entering link; the group-entering link has a mapping relation with the created groups;

the client is also used for sending a group access invitation acquisition request generated by triggering the group access link to the group servers of the plurality of established groups;

the group server is used for receiving a group access invitation acquisition request generated by triggering a group access link by a client;

the group server is further configured to respond to the group invitation obtaining request, and send group invitation information corresponding to a group with a less than full number of group members to the client based on the created groups;

the client is further configured to display the group entry invitation information, and the user waiting for group entry joins the group with the less number of group members.

22. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor realizes the steps of the method of any one of claims 1 to 10 when executing the computer program.

23. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 10.