CN111858617A

CN111858617A - User searching method and device, computer readable storage medium and electronic equipment

Info

Publication number: CN111858617A
Application number: CN202010782407.XA
Authority: CN
Inventors: 侯学博; 张京一; 张晓�
Original assignee: Beike Technology Co Ltd
Current assignee: Beike Technology Co Ltd
Priority date: 2020-08-06
Filing date: 2020-08-06
Publication date: 2020-10-30

Abstract

The embodiment of the disclosure discloses a user searching method and device, a computer readable storage medium and electronic equipment, wherein the method comprises the following steps: receiving a set value of a set label and a set condition corresponding to the set value; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label; determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag; according to the setting condition, m target users meeting the setting value and the setting condition are determined from a plurality of users corresponding to the n bitmap; wherein m is greater than or equal to zero; in the embodiment, based on the user portrait label, the bitmap is used as the index for searching by the user, the searching efficiency is improved, the target user is determined by combining the n bitmaps, and the accuracy of the obtained target user is improved.

Description

User searching method and device, computer readable storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of data indexing technologies, and in particular, to a user searching method and apparatus, a computer-readable storage medium, and an electronic device.

Background

In the user portrait system, a user is depicted in dimensions such as basic attributes, behavior attributes and preference attributes, and portraits are described in the form of tags. The basis of user clustering is user portrayal.

In a user representation system, a conventional indexing method is to construct a mapping relation of user ID-tags, store the data in a relational data table, and search for a qualified crowd through SQL query filtering. However, this method generally requires a full scan when searching for a user with a set condition, which is inefficient and occupies a lot of resources.

Disclosure of Invention

The present disclosure is proposed to solve the above technical problems. The embodiment of the disclosure provides a user searching method and device, a computer readable storage medium and electronic equipment.

According to an aspect of the embodiments of the present disclosure, there is provided a user search method, including:

receiving a set value of a set label and a set condition corresponding to the set value; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label;

determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag;

according to the setting condition, m target users meeting the setting value and the setting condition are determined from a plurality of users corresponding to the n bitmap; wherein m is greater than or equal to zero.

Optionally, the categories of the user tag include: enumerating one or more of a value tag, a continuous value tag, and a time tag;

when the category of the setting label is an enumeration value label, the setting condition is equal to or not equal to;

when the category of the setting label is a continuous value label or a time label, the setting condition is one of the following conditions: equal to, not equal to, greater than, less than, greater than or equal to, less than or equal to.

Optionally, the determining n bitmaps related to the setting value according to the setting value of the setting tag includes:

determining an expression relation corresponding to each effective identifier in a bitmap corresponding to the setting label according to the category of the setting label;

and determining n bitmaps related to the set value according to the expression relationship and the set value.

Optionally, the expressing relationship comprises: a first relationship, a second relationship, or a third relationship; the first relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is equal to the numerical value, the second relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is greater than or equal to the numerical value, and the third relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is less than or equal to the numerical value;

the determining according to the category of the setting tag, and the determining, according to the category of the setting tag, an expression relationship corresponding to each valid identifier in a bitmap corresponding to the setting tag includes:

in response to that the type of the set label is an enumerated value label, determining that an expression relationship corresponding to each effective identifier in a bitmap corresponding to the set label is a first relationship;

in response to that the type of the setting label is a continuous value label, determining that an expression relationship corresponding to each effective identifier in a bitmap corresponding to the setting label is a second relationship;

and in response to the fact that the type of the setting label is the time label, determining that the expression relation corresponding to each effective identifier in the bitmap corresponding to the setting label is a third relation.

Optionally, before determining n bitmaps related to the setting value according to the expression relationship and the setting value, the method further includes:

determining whether the set value is a boundary value in the numerical value corresponding to the set label;

the determining n bitmaps related to the setting value according to the expression relationship and the setting value includes:

in response to the setting value being the boundary value, determining n bitmaps related to the boundary value according to the expression relationship and the boundary value;

and in response to the setting value not being the boundary value, determining n bitmaps related to the setting value according to the expression relationship and the setting value.

Optionally, each user tag corresponds to a full bitmap, and the full bitmap expresses users corresponding to all numerical values in the user tags;

responding to the expression relationship being a first relationship, and obtaining a bitmap corresponding to the set value based on the set value, or obtaining a bitmap corresponding to the set value and the full bitmap;

in response to the expression relationship being a second relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap corresponding to the set value and the full bitmap, the bitmap corresponding to the set value and the bitmap corresponding to the next numerical value of the set value, the bitmap corresponding to the set value, the full bitmap and the bitmap corresponding to the next numerical value of the set value;

in response to the expression relationship being a third relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap corresponding to the set value and the full bitmap, the bitmap corresponding to the set value and the bitmap corresponding to the last numerical value of the set value, the bitmap corresponding to the set value, the full bitmap and the bitmap corresponding to the last numerical value of the set value.

determining n bitmaps related to the boundary value according to the expression relationship and the boundary value, wherein the determining includes:

and in response to the expression relationship being a first relationship, a second relationship or a third relationship, obtaining a bitmap corresponding to the boundary value based on the boundary value, or obtaining a bitmap corresponding to the boundary value and the full-scale bitmap.

Optionally, when the category of the setting tag is an enumeration tag;

the obtaining m target users meeting the setting value and the setting condition based on the n bitmaps includes:

in response to the set condition being equal to the set condition, taking the user corresponding to the effective identifier in the bitmap as a target user;

and in response to the set condition being unequal, performing exclusive-OR operation on the bitmap and the full bitmap, and taking the user corresponding to the effective identifier in the operation result of the exclusive-OR operation as the target user.

Optionally, when the category of the setting label is a continuous value label;

in response to the setting condition being equal to the setting condition, performing exclusive-or operation on the bitmap corresponding to the setting value and the bitmap corresponding to the next numerical value of the setting value, and taking the user corresponding to the effective identifier in the operation result as a target user, or taking the user corresponding to the effective identifier in the bitmap corresponding to the boundary value as a target user;

responding to the set condition that the set condition is not equal to the preset value, performing exclusive OR operation on the bitmap corresponding to the set value and the bitmap corresponding to the next numerical value of the set value to obtain an exclusive OR bitmap, and performing exclusive OR operation on the exclusive OR bitmap and the full bitmap to obtain a result, wherein the result is used as a target user, and the user corresponding to the effective identifier in the result is used as the target user; or executing exclusive or operation on the bitmap corresponding to the boundary value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

in response to the setting condition being greater than the preset value, taking a user corresponding to the valid identifier in the bitmap corresponding to the next digit value of the setting value as a target user, or taking the target user corresponding to the boundary value as null;

in response to the setting condition being greater than or equal to the set value, taking a user corresponding to the effective identifier in the bitmap corresponding to the set value as a target user;

in response to the setting condition being smaller than the preset value, executing exclusive OR operation on the bitmap corresponding to the setting value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

in response to the setting condition being less than or equal to the setting condition, performing exclusive-or operation on the full bitmap and a bitmap corresponding to a next digit value of the setting value, and taking a user corresponding to an effective identifier in an operation result as a target user; or taking the user corresponding to the effective identifier in the full bitmap as a target user.

Optionally, when the category of the setting tag is a time tag;

responding to the set condition being equal, executing exclusive-or operation on the bitmap corresponding to the set value and the bitmap corresponding to the last digit value of the set value, and taking the user corresponding to the effective identifier in the operation result as a target user; or taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as a target user;

responding to the set condition that the set condition is not equal to the preset value, performing exclusive OR operation on the bitmap corresponding to the set value and the bitmap corresponding to the last digit value of the set value to obtain an exclusive OR bitmap, and performing exclusive OR operation on the exclusive OR bitmap and the full bitmap to obtain a result, wherein the result is used as a target user, and the user corresponding to the effective identifier in the result is used as the target user; or executing exclusive or operation on the bitmap corresponding to the boundary value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

in response to the set condition being greater than the set condition, executing exclusive or operation on the bitmap corresponding to the set value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

in response to the setting condition being greater than or equal to the setting condition, performing exclusive-or operation on the full bitmap and a bitmap corresponding to a last digit value of the setting value, and taking a user corresponding to an effective identifier in an operation result as a target user; or taking the user corresponding to the effective identifier in the full bitmap as a target user;

in response to the setting condition being less than the preset value, taking a user corresponding to the valid identifier in the bitmap corresponding to the last digit value of the setting value as a target user, or taking the target user corresponding to the boundary value as null;

and in response to the setting condition being less than or equal to the set value, taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as the target user.

Optionally, the receiving the setting value of the setting tag and the setting condition corresponding to the setting value includes:

receiving setting values of a plurality of setting labels with a set logical operation relationship and a plurality of setting conditions corresponding to the setting values; wherein the setting of the logical operation condition comprises one of: and, or, not, xor;

the method further comprises the following steps:

executing corresponding logical operation on the multiple groups of target users based on the set logical operation relation to obtain k result users; and k is greater than or equal to zero, and each group of target users accords with one set value and a set condition corresponding to the set value.

Optionally, before receiving the setting value of the setting tag and the setting condition corresponding to the setting value, the method further includes:

screening all users stored in a database according to a preselected condition to obtain a user group; wherein, the user group comprises a plurality of users meeting the preselected condition;

and searching a target user in the user group based on the set value of the set label and the set condition corresponding to the set value.

According to another aspect of the embodiments of the present disclosure, there is provided a user search apparatus, including:

the condition receiving module is used for receiving a set value of a set label and a set condition corresponding to the set value; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label;

the bitmap acquisition module is used for determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag;

the user searching module is used for obtaining m target users which accord with the set value and the set condition based on the n bitmaps; wherein m is greater than or equal to zero.

Optionally, the bitmap obtaining module includes:

the relation determining unit is used for determining an expression relation corresponding to each effective identifier in a bitmap corresponding to the setting label according to the category of the setting label;

and the relation association unit is used for determining n bitmaps related to the set value according to the expression relation and the set value.

the relationship determining unit is specifically configured to determine, in response to that the type of the setting tag is an enumerated value tag, that an expression relationship corresponding to each valid identifier in a bitmap corresponding to the setting tag is a first relationship; in response to that the type of the setting label is a continuous value label, determining that an expression relationship corresponding to each effective identifier in a bitmap corresponding to the setting label is a second relationship; and in response to the fact that the type of the setting label is the time label, determining that the expression relation corresponding to each effective identifier in the bitmap corresponding to the setting label is a third relation.

Optionally, the bitmap obtaining module further includes:

a boundary value identification unit, configured to determine whether the setting value is a boundary value in the numerical values corresponding to the setting tag;

the relationship association unit is specifically configured to determine, in response to the setting value being the boundary value, n bitmaps related to the boundary value according to the expression relationship and the boundary value; and in response to the setting value not being the boundary value, determining n bitmaps related to the setting value according to the expression relationship and the setting value.

the relationship association unit is specifically configured to, in response to that the expression relationship is a first relationship, obtain a bitmap corresponding to the setting value based on the setting value, or obtain a bitmap corresponding to the setting value and the full bitmap;

the relationship association unit is specifically configured to, in response to that the expression relationship is a first relationship, a second relationship, or a third relationship, obtain a bitmap corresponding to the boundary value based on the boundary value, or obtain a bitmap corresponding to the boundary value and the full-size bitmap.

Optionally, when the category of the setting tag is an enumeration tag;

the user searching module is specifically configured to, in response to the setting condition being equal to the preset condition, use a user corresponding to the valid identifier in the bitmap as a target user;

Optionally, when the category of the setting label is a continuous value label;

the user searching module is specifically configured to, in response to the setting condition being equal to the setting condition, perform an exclusive or operation on the bitmap corresponding to the setting value and the bitmap corresponding to the next numerical value of the setting value, and use a user corresponding to an effective identifier in an operation result as a target user, or use a user corresponding to an effective identifier in the bitmap corresponding to the boundary value as a target user;

Optionally, when the category of the setting tag is a time tag;

the user searching module is specifically configured to, in response to the setting condition being equal to the setting condition, perform an exclusive or operation on a bitmap corresponding to the setting value and a bitmap corresponding to a last digit value of the setting value, and use a user corresponding to an effective identifier in an operation result as a target user; or taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as a target user;

Optionally, the condition receiving module is specifically configured to receive setting values of a plurality of setting labels having a set logical operation relationship, and a plurality of setting conditions corresponding to the plurality of setting values; wherein the setting of the logical operation condition comprises one of: and, or, not, xor;

the device, still include:

the logic processing module is used for executing corresponding logic operation on a plurality of groups of target users based on the set logic operation relation to obtain k result users; and k is greater than or equal to zero, and each group of target users accords with one set value and a set condition corresponding to the set value.

Optionally, the apparatus further comprises:

the preselection screening module is used for screening all users stored in the database according to preselection conditions to obtain a user group; wherein, the user group comprises a plurality of users meeting the preselected condition; and searching a target user in the user group based on the set value of the set label and the set condition corresponding to the set value.

According to an aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium storing a computer program for executing the user search method according to any of the embodiments.

According to an aspect of an embodiment of the present disclosure, there is provided an electronic apparatus including:

a processor;

a memory for storing the processor-executable instructions;

the processor is configured to read the executable instruction from the memory and execute the instruction to implement the user search method according to any of the above embodiments.

Based on the user searching method and device, the computer readable storage medium and the electronic device provided by the above embodiments of the present disclosure, a setting value of a setting tag and a setting condition corresponding to the setting value are received; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label; determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag; according to the setting condition, m target users meeting the setting value and the setting condition are determined from a plurality of users corresponding to the n bitmap; wherein m is greater than or equal to zero; in the embodiment, based on the user portrait label, the bitmap is used as the index for searching by the user, the searching efficiency is improved, the target user is determined by combining the n bitmaps, and the accuracy of the obtained target user is improved.

The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.

Drawings

The above and other objects, features and advantages of the present disclosure will become more apparent by describing in more detail embodiments of the present disclosure with reference to the attached drawings. The accompanying drawings are included to provide a further understanding of the embodiments of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the principles of the disclosure and not to limit the disclosure. In the drawings, like reference numbers generally represent like parts or steps.

Fig. 1 is a flowchart illustrating a user search method according to an exemplary embodiment of the disclosure.

Fig. 2 is a schematic flow chart of step 104 in the embodiment shown in fig. 1 of the present disclosure.

Fig. 3 is another schematic flow chart of step 104 in the embodiment shown in fig. 1 of the present disclosure.

Fig. 4a is a schematic diagram of a mapping relationship between a user and a user tag, which is constructed in an alternative example of the present disclosure.

FIG. 4b is a diagram illustrating the number id assigned to each user in the embodiment shown in FIG. 4a in the present disclosure.

Fig. 4c is a bitmap diagram established for the resident city tag in the embodiment shown in fig. 4a in the present disclosure.

Fig. 4d is a schematic diagram of a bitmap established for the user status label in the embodiment shown in fig. 4a in the present disclosure.

Fig. 4e is a bitmap diagram established for the device using the habit tag in the embodiment shown in fig. 4a in the present disclosure.

Fig. 4f is a bitmap schematic diagram established for whether to install the target application tag in the embodiment shown in fig. 4a in the present disclosure.

Fig. 4g is a schematic diagram of the full bitmap established in the embodiment shown in fig. 4a in the present disclosure.

Fig. 5a is a schematic diagram of another alternative example of the result obtained by using the bitmap shown in fig. 4c, where the resident city is beijing.

Fig. 5b is a schematic diagram of another alternative example of the present disclosure, which is obtained by using the bitmap shown in fig. 4f and has a target application installed.

FIG. 5c is a schematic diagram of the result of determining that the resident city is Beijing and the target application is installed based on the embodiment of FIGS. 5a and 5 b.

Fig. 6a is a schematic diagram of a mapping relationship between a user and a user tag, which is constructed in yet another alternative example of the present disclosure.

FIG. 6b is a diagram illustrating the number id assigned to each user in the embodiment shown in FIG. 6a in the present disclosure.

FIG. 6c is a schematic diagram of a bitmap created for the near 7 day active days tab in the embodiment shown in FIG. 6a of this disclosure.

Fig. 6d is a schematic diagram of a bitmap created for the browsing times of the last 1 day tab in the embodiment shown in fig. 6a in the present disclosure.

Fig. 6e is a bitmap diagram established for processing the time stamp in the embodiment shown in fig. 6a in the present disclosure.

Fig. 7 is a schematic structural diagram of a user finding device according to an exemplary embodiment of the present disclosure.

Fig. 8 is a block diagram of an electronic device provided in an exemplary embodiment of the present disclosure.

Detailed Description

Hereinafter, example embodiments according to the present disclosure will be described in detail with reference to the accompanying drawings. It is to be understood that the described embodiments are merely a subset of the embodiments of the present disclosure and not all embodiments of the present disclosure, with the understanding that the present disclosure is not limited to the example embodiments described herein.

It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

It will be understood by those of skill in the art that the terms "first," "second," and the like in the embodiments of the present disclosure are used merely to distinguish one element from another, and are not intended to imply any particular technical meaning, nor is the necessary logical order between them.

It is also understood that in embodiments of the present disclosure, "a plurality" may refer to two or more and "at least one" may refer to one, two or more.

It is also to be understood that any reference to any component, data, or structure in the embodiments of the disclosure, may be generally understood as one or more, unless explicitly defined otherwise or stated otherwise.

In addition, the term "and/or" in the present disclosure is only one kind of association relationship describing an associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the former and latter associated objects are in an "or" relationship.

It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and the same or similar parts may be referred to each other, so that the descriptions thereof are omitted for brevity.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

The disclosed embodiments may be applied to electronic devices such as terminal devices, computer systems, servers, etc., which are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known terminal devices, computing systems, environments, and/or configurations that may be suitable for use with electronic devices, such as terminal devices, computer systems, servers, and the like, include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, microprocessor-based systems, set top boxes, programmable consumer electronics, network pcs, minicomputer systems, mainframe computer systems, distributed cloud computing environments that include any of the above systems, and the like.

Electronic devices such as terminal devices, computer systems, servers, etc. may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. The computer system/server may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

Exemplary method

Fig. 1 is a flowchart illustrating a user search method according to an exemplary embodiment of the disclosure. The embodiment can be applied to an electronic device, as shown in fig. 1, and includes the following steps:

step 102, receiving a setting value of a setting label and a setting condition corresponding to the setting value.

The setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label.

The user in this embodiment may refer to a person or an article with any identity, and each user corresponds to at least one user tag, and each user tag has one value or multiple values, for example: the user tag is a gender, and the value of the user in the tag is unique, for example, a man; when the user tag is a preference information tag, the user's preference may be multiple, and thus the value of the user in the tag may include multiple values.

And step 104, determining n bitmaps related to the set value according to the set value of the set label.

And n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user label.

The numerical value referred to in the present embodiment includes not only a value expressed in numerical form but also a value expressed in other forms, for example, a character string or the like.

In an embodiment, each value included in each user tag corresponds to a bitmap, where a corresponding position in the bitmap of a user corresponding to a value of the bitmap is displayed as a valid identifier, for example, 1 indicates a valid identifier, and when the value corresponding to the user is different from the bitmap, the corresponding position in the bitmap of the user is displayed as a non-valid identifier, for example, 0 indicates a non-valid identifier.

And 106, acquiring m target users meeting the set value and the set condition based on the n bitmaps.

Wherein m is greater than or equal to zero. Optionally, the number of bitmaps may be zero, and at this time, the target user cannot be obtained, that is, the obtained number of target users is zero; there is also a possibility that the determined number of bitmaps is not zero, but the number of target users obtained based on the n bitmaps is zero, that is, there are no target users that meet the set values and set conditions.

The user searching method provided by the above embodiment of the present disclosure receives a setting value of a setting tag and a setting condition corresponding to the setting value; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label; determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag; according to the setting condition, m target users meeting the setting value and the setting condition are determined from a plurality of users corresponding to the n bitmap; wherein m is greater than or equal to zero; in the embodiment, based on the user portrait label, the bitmap is used as the index for searching by the user, the searching efficiency is improved, the target user is determined by combining the n bitmaps, and the accuracy of the obtained target user is improved.

In some alternative embodiments, the categories of user tags include: enumerating one or more of a value tag, a continuous value tag, and a time tag;

when the category of the label is set as an enumeration value label, setting the condition as equal to or unequal to;

when the category of the tag is set to be a continuous value tag or a time tag, the setting condition is one of the following conditions: equal to, not equal to, greater than, less than, greater than or equal to, less than or equal to.

The enumerated value tag is a tag in which the number included in the user tag is limited, and all the values can be listed by enumeration, for example, image information such as sex, constellation, marital status, resident city, and the like is described. The continuous value label is an image label describing age, browsing times, number of active days, account balance, etc., and the minimum value of these labels is usually 0, and the maximum value is theoretically infinite. The time label is a label for describing time portrait such as browsing time, registration time, activation time and the like, the value of the date label can store 8-bit numbers, and if the value of the label is selected from a date control, the value format is yyy-MM-dd; the value of the time label in this embodiment is less than or equal to the current date, that is, the maximum value of the time label is the current time, so that errors caused by the future time can be avoided.

As shown in fig. 2, based on the embodiment shown in fig. 1, step 104 may include the following steps:

step 1041, determining an expression relationship corresponding to each valid identifier in the bitmap corresponding to the setting tag according to the type of the setting tag.

Optionally, expressing the relationship corresponding to different categories may include: a first relationship, a second relationship, or a third relationship.

The first relation represents that each effective identifier in the bitmap represents that the value of the corresponding user on the setting label is equal to the numerical value, the second relation represents that each effective identifier in the bitmap represents that the value of the corresponding user on the setting label is greater than or equal to the numerical value, and the third relation represents that each effective identifier in the bitmap represents that the value of the corresponding user on the setting label is less than or equal to the numerical value. Optionally, in response to that the category of the setting tag is an enumeration value tag, determining that the expression relationship corresponding to each valid identifier in the bitmap corresponding to the setting tag is a first relationship; in response to the fact that the type of the set label is a continuous value label, determining that an expression relation corresponding to each effective identifier in a bitmap corresponding to the set label is a second relation; and in response to the fact that the type of the set label is the time label, determining that the expression relation corresponding to each effective identifier in the bitmap corresponding to the set label is a third relation.

And 1042, determining n bitmaps related to the set value according to the expression relationship and the set value.

In this embodiment, since the relationships (e.g., equal to, greater than, or less than or equal to) between the values of the users in different user tag types and the values corresponding to the bitmap are different, for example, the value corresponding to the bitmap corresponding to one enumerated value tag is 8, and at this time, the valid identifier corresponding to the user indicates that the value of the enumerated value tag of the user is 8; if the value of the bitmap corresponding to the continuous value label is 8, at this time, the effective identifier corresponding to the user indicates that the value of the enumerated value label of the user is greater than or equal to 8; and if the value of the bitmap corresponding to the time tag is 2020-05-28, at this time, the valid identifier corresponding to the user indicates that the value of the enumerated value tag of the user is less than or equal to 2020-05-28. Therefore, according to different expression relations and setting values, the number of the obtained bitmaps and the number of the obtained bitmaps are different, in the embodiment, the expression relations are firstly identified, the bitmaps are obtained by combining the expression relations and the setting values, so that the n bitmaps can be used for screening users meeting conditions, and the accuracy of the obtained target users is improved.

As shown in fig. 3, based on the embodiment shown in fig. 1, step 104 may further include the following steps:

Step 1043, determining whether the set value is a boundary value in the numerical value corresponding to the set label, if yes, executing step 1045; otherwise, go to step 1044.

And step 1044, determining n bitmaps related to the set value according to the expression relationship and the set value.

In this embodiment, each user tag corresponds to a full bitmap, and optionally, when the full bitmaps corresponding to the multiple user tags are consistent (for example, when the full bitmaps of the multiple user tags are established for the same user group, the full bitmaps of all the user tags all correspond to all users included in the user group), one full bitmap can be established for the multiple user tags and exists under one user tag, and when the full bitmaps are searched by other user tags, the full bitmaps can be obtained in an index searching manner; expressing users corresponding to all numerical values in the user label by using a full bitmap; for example, a user tag corresponds to a value comprising: 1. 2, 3; wherein, the users with the value of 1 in the user label comprise a user 1 and a user 4; wherein the users with the value of 2 in the user tag comprise a user 2; wherein, the users with the value of 3 in the user label comprise a user 3 and a user 5; at this time, it can be determined that

users

1, 2, 3, 4, and 5 in the full bitmap all correspond to valid identifiers, that is, all users corresponding to all values in the user tag can be represented.

Responding to the different expression relations, obtaining different bitmaps, responding to the first relation that the expression relation is, and obtaining a bitmap corresponding to the set value based on the set value, or obtaining a bitmap corresponding to the set value and a full bitmap; here, since the setting condition existing in the first relationship may be equal to or not equal to, different bitmaps are obtained for the two setting conditions.

When the category of the setting label is a continuous value label or a time label, the setting condition is one of the following conditions: equal to, not equal to, greater than, less than, greater than or equal to, less than or equal to; therefore, when the expression relationship is the second relationship or the third relationship, 6 different numbers of bitmaps are respectively obtained; optionally, in response to the expressive relationship being a second relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap and the full bitmap corresponding to the set value, the bitmap corresponding to the set value and the bitmap corresponding to the next numerical value of the set value, the bitmap corresponding to the set value, the full bitmap and the bitmap corresponding to the next numerical value of the set value;

in response to the expression relationship being a third relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap and the full bitmap corresponding to the set value, the bitmap corresponding to the set value and the bitmap corresponding to the last numerical value of the set value, the bitmap and the full bitmap corresponding to the set value and the bitmap corresponding to the last numerical value of the set value.

And step 1045, determining n bitmaps related to the boundary value according to the expression relationship and the boundary value.

In this embodiment, each user tag corresponds to a full bitmap, and the full bitmap expresses users corresponding to all numerical values in the user tag.

Optionally, when the setting value is a boundary value, since there is no bitmap corresponding to the next numerical value in the second relationship and no bitmap corresponding to the previous numerical value in the third relationship, when the setting value is a boundary value, the obtained bitmaps are the same regardless of whether the expression relationship is the first relationship, the second relationship, or the third relationship; for example, the bitmap corresponding to the boundary value is obtained based on the boundary value, or the bitmap corresponding to the boundary value and the full-scale bitmap are obtained.

The embodiment proposes to process the boundary value independently, so as to avoid the error that the result is empty due to the fact that the set value is the boundary value and the required bitmap cannot be acquired.

In an alternative embodiment, step 106 may comprise:

and in response to the set condition that the set condition is not equal to the set condition, performing exclusive OR operation on one bitmap and the full bitmap, and taking the user corresponding to the effective identifier in the operation result of the exclusive OR operation as the target user.

In this embodiment, the type of the set tag is an enumeration tag, and each valid identifier in the bitmap indicates that the value of the corresponding user on the set tag is equal to a numerical value, so that when a user equal to a set value needs to be obtained, only the user corresponding to the valid identifier in the bitmap corresponding to the set value needs to be obtained; and when the users not equal to the set value are obtained, carrying out XOR operation by using the full bitmap and the bitmap corresponding to the set value, wherein the users corresponding to the corresponding effective identification are all target users not equal to the set value.

In another alternative embodiment, step 106 may include:

responding to the set condition as equal, executing exclusive-or operation on the bitmap corresponding to the set value and the bitmap corresponding to the next numerical value of the set value, and taking the user corresponding to the effective identifier in the operation result as a target user or taking the user corresponding to the effective identifier in the bitmap corresponding to the boundary value as the target user;

responding to the set condition that the set condition is not equal, performing exclusive-or operation on the bitmap corresponding to the set value and the bitmap corresponding to the next digit value of the set value to obtain an exclusive-or bitmap, performing exclusive-or operation on the exclusive-or bitmap and the full bitmap, and taking the user corresponding to the effective identifier in the obtained result as a target user; or executing XOR operation by the bitmap corresponding to the boundary value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as the target user;

in response to the setting condition being greater than the preset value, taking a user corresponding to the effective identifier in the bitmap corresponding to the next numerical value of the setting value as a target user, or taking the target user corresponding to the boundary value as null;

in response to the setting condition being greater than or equal to the preset value, taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as a target user;

in response to the set condition being smaller than the set condition, executing exclusive OR operation by using the bitmap corresponding to the set value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

responding to the set condition that the set condition is less than or equal to, executing exclusive OR operation by using the full bitmap and the bitmap corresponding to the next digit value of the set value, and taking the user corresponding to the effective identifier in the operation result as a target user; or taking the user corresponding to the effective identification in the full bitmap as the target user.

In this embodiment, when the category of the setting tag is a continuous value tag, each valid identifier in the bitmap indicates that the value of the corresponding user on the setting tag is greater than or equal to a numerical value; at this time, there may be six setting conditions, and when two bitmaps are obtained (for example, a bitmap corresponding to the setting value and a full bitmap), an exclusive or operation is performed on the two obtained bitmaps, so that the target user to which the corresponding setting condition corresponds can be obtained; when a bitmap (for example, a bitmap corresponding to a setting value) is obtained, a corresponding user is effectively identified in the bitmap as a target user; when three bitmaps are obtained (for example, a bitmap corresponding to the set value, a full bitmap, and a bitmap corresponding to the next numerical value of the set value), after performing exclusive or operation on two bitmaps, performing exclusive or operation on the operation result and another bitmap, and taking the user corresponding to the effective identifier in the obtained result as the target user.

In yet another alternative embodiment, step 106 may include:

In this embodiment, when the category of the setting tag is the time tag, each valid identifier in the bitmap indicates that the value of the corresponding user on the setting tag is less than or equal to a numerical value, where the related operation is similar to the process corresponding to the continuous value tag, and the difference is that the numerical value in the time tag is gradually reduced by the current date, so as to avoid that it is impossible to determine whether the corresponding user exists on the future date. The embodiment realizes the screening of different types of user tags in different modes, solves the problem of screening processing of user figures including various different user tags for users, and improves the screening efficiency and accuracy of target users.

In some alternative embodiments, step 102 may include:

receiving setting values of a plurality of setting labels with a set logical operation relationship and a plurality of setting conditions corresponding to the plurality of setting values; wherein, the setting of the logic operation condition comprises one of the following: and, or, not, exclusive or.

The user search method provided in this embodiment further includes:

and executing corresponding logical operation on the multiple groups of target users based on the set logical operation relation to obtain k result users.

And k is greater than or equal to zero, and each group of target users accords with a set value and a set condition corresponding to the set value.

Optionally, when all or part of the target users in the multiple groups of target users are zero, the number of resulting users may be zero after logical operation (e.g., exclusive or operation); or when all the target users in the multiple groups are not zero, but the number of the obtained result users is zero after the logical operation.

In this embodiment, the user search method provided in the above embodiment is executed to obtain m target users, respectively, by using the received multiple setting values and the setting conditions thereof; then, the result user is determined based on the logical operation relationship among the plurality of setting values, for example, the receiving conditions are: equal to the first set value and not equal to the second set value (the expressed logic operation condition is exclusive or); at this time, a group of target users are obtained based on the first setting value, another group of target users are obtained based on the second setting value, the result user is obtained by performing exclusive-or operation on the group of target users and the another group of target users, and optionally, the exclusive-or operation can be performed by using the bitmap corresponding to the group of target users and the bitmap corresponding to the another group of target users, so that the result user is obtained.

The user tags comprise composite tags besides the single tags determined by the group of numerical values, the composite tags describe the same user tags of the users through a plurality of fields, for example, in different cities, the house-viewing preference of the users is different, at the moment, the house-viewing preference tags are the composite tags, for example, the house-viewing preference of the users in a first city is near subway, and the house-viewing preference of the users in a second city is not near subway; therefore, before searching for the user, the present embodiment further includes:

screening all users stored in a database according to a preselected condition to obtain a user group; the user group comprises a plurality of users meeting preselected conditions;

in the user group, a target user is searched based on a set value of the set label and a set condition corresponding to the set value.

Optionally, the composite label may be filtered according to a preselected condition, and the composite label may be understood as a combination of at least one primary label and at least one secondary label, and a bitmap obtained as a result of a logical operation of the primary label and the secondary label is used as a corresponding bitmap in the composite label. For example: there are 4 hive tables, the base table stores the basic information of the user, the device table stores the equipment information of the user, the preference table stores the preference information of the user, and the action table stores the behavior information of the user.

The tags in the base table and the device table are single tags.

The tags in both the defer and action tables are composite tags.

The composite tag in the defer table contains one primary tag (preference tag) and one secondary tag (city tag). The secondary label (city label) is an enumerated value type and can only be selected equal. The primary label is an enumerated value type, which may be selected equal/unequal. The primary label equals to the secondary label, and the corresponding bitmap is directly selected. The primary label equals not, the secondary label equals, and is used (primary label equals, secondary label equals bitmap) Xor (secondary label equals bitmap).

In some optional embodiments, before performing the user searching method provided in any of the above embodiments of the present disclosure, a plurality of bitmaps may be established for a plurality of users according to the user representation, and the process of establishing the bitmaps may include the following steps: step a, as shown in fig. 4a, constructing mapping relationships between users and user tags, where the mapping relationships can be directly obtained from user images (multiple user tags corresponding to users) stored in a database, where, taking an enumerated value tag as an example, each row corresponds to one user, and for ease of understanding, the meaning of each user tag and its corresponding numerical value is explained here, where local _ city (resident city tag): 110000 represents Beijing City, 120000 represents Tianjin City, 130000 represents Hebei province; cut _ state (user state tag): 1 represents a new user, 2 represents an active user, and 3 represents a silent user; client _ os _ type (device usage habit tag): android represents an android mobile phone, ios represents an apple mobile phone, and other represents other equipment; is _ install _ app (whether the target application is installed): 1 indicates yes and 2 indicates no.

Step b, for subsequent ease of identification and storage, each user is assigned a numerical id representation, as shown in FIG. 4 b. Optionally, the step of assigning a number id to each user comprises: 1) decomposing a user set to be allocated with id into i sub-user sets, and determining associated data among the i sub-user sets; wherein i is an integer greater than 1, the user set comprises a plurality of rows of users, and each sub-user set comprises a part of users in the user set. The embodiment provides a partition processing method, so that the efficiency of id allocation is improved, meanwhile, the relevance between the ids of data among different sub data sets is ensured through the associated data, and the accuracy of id allocation is improved. 2) And respectively distributing a first id for a plurality of rows of users included in each sub-user set to obtain n groups of first ids. Wherein each user corresponds to a first id. Optionally, by processing different sub-user sets on different cluster nodes, the id is allocated by multiple cluster nodes at the same time, and the id allocation efficiency is improved. 3) And obtaining a second id corresponding to each user in all users in the user set according to the associated users and the n groups of first ids, and realizing user id distribution of the user set. Optionally, since the allocation of the first id to the users in each sub-user set is independently completed, for the whole user set, the first ids allocated in different sub-user sets are largely repeated and cannot be consecutive, and in this embodiment, the management user processes n groups of first ids, so that the id corresponding to the user in each sub-user set is updated to the second id associated with other sub-user sets, and the allocation of the unique id to the user with a large user amount is realized.

Step c, establishing bitmaps for each numerical value of each label, and establishing 3 bitmaps for the resident city label, as shown in fig. 4 c; 3 bitmaps are built for the user status tag, as shown in fig. 4 d; build 3 bitmaps for the device usage habit tag as shown in fig. 4 e; establishing 2 bitmaps for whether to install the target application tag, as shown in fig. 4 f; the valid flag in this embodiment is denoted by 1; the full bitmap is built up according to the number of users involved, as shown in fig. 4 g.

The bitmap establishment of each user label in the user portrait is realized through the steps, at this time, the user search can be performed, for example, the set value of the received set label is that the resident city is Beijing, wherein the set value is 'Beijing', the set condition is equal to, at this time, the bitmap with the value of Beijing in the value in FIG. 4c is used for target user acquisition, and the obtained result is shown in FIG. 5 a; or, the received setting value of the setting tag is the user who installs the target application, where the setting value is "yes", and the setting condition is equal, at this time, the bitmap with the value of yes in fig. 4f is used for obtaining the target user, and the obtained result is shown in fig. 5 b; there may be a case where the two search conditions are used for searching together, that is, the user whose resident city is beijing and the target application is installed is searched, and at this time, the result shown in fig. 5c can be obtained by performing the exclusive or operation on the results shown in fig. 5a and fig. 5 b.

In other alternative embodiments, taking the continuous value tag as an example, the bitmap is established for a plurality of users, and the process of establishing the bitmap may include the following steps:

step a, as shown in fig. 6a, adding continuous value tag content and date tag content to the mapping relationship shown in fig. 4a, and constructing mapping relationships between users and user tags, where these mapping relationships can be directly obtained from user images (multiple user tags corresponding to users) stored in a database, and taking the example where a continuous value tag and a time tag are distinguished from those in fig. 4a, each row corresponds to one user, and for ease of understanding, the meaning of each user tag and its corresponding numerical value is explained here, where active _ cnt _ receiver 7 (active day number tag of near 7): the corresponding values represent specific days; browse _ cnt _1 (a browsing times tag of the last 1 day, which can be set to a value of [0,100 ]): the corresponding numerical value represents the browsing times; dead _ time (processing time stamp): the corresponding value indicates a specific time (e.g., date).

Step b, for the subsequent ease of identification and storage, each user is assigned a numerical id representation, for example, as shown in fig. 6b (fig. 6b is the same as fig. 4b since the users involved in fig. 6a are the same as fig. 4 a).

Step c, respectively establishing a bitmap for each numerical value of each label, and establishing 7 bitmaps for the labels of the active days of the near 7 days, as shown in fig. 6 c; establishing 101 bitmaps for the browsing times label of the near 1 day, as shown in fig. 6d (only a part of bitmaps are displayed under the display limitation); a bitmap of the number from the set date to the current date is created for processing the time stamp, and in this embodiment, it is assumed that the current time is 5/28/2020, and at this time, the resulting bitmap is as shown in fig. 6e (limited by display, only a part of the bitmap is displayed).

Any of the user lookup methods provided by embodiments of the present disclosure may be performed by any suitable device having data processing capabilities, including but not limited to: terminal equipment, a server and the like. Alternatively, any of the user lookup methods provided by the embodiments of the present disclosure may be executed by a processor, for example, the processor may execute any of the user lookup methods mentioned by the embodiments of the present disclosure by calling a corresponding instruction stored in a memory. And will not be described in detail below.

Exemplary devices

Fig. 7 is a schematic structural diagram of a user finding device according to an exemplary embodiment of the present disclosure. The device provided by the embodiment comprises:

the condition receiving module 71 is configured to receive a setting value of the setting tag and a setting condition corresponding to the setting value.

And a bitmap obtaining module 72, configured to determine n bitmaps related to the setting value according to the setting value of the setting tag.

And the user searching module 73 is used for obtaining m target users meeting the set value and the set condition based on the n bitmaps.

Wherein m is greater than or equal to zero.

The user searching device provided by the above embodiment of the present disclosure receives a setting value of a setting tag and a setting condition corresponding to the setting value; the setting label is any one of a plurality of user labels, and the setting value is any one of a plurality of numerical values corresponding to the setting label; determining n bitmaps related to the set value according to the set value of the set label; wherein n is greater than or equal to zero, and each bitmap corresponds to a numerical value of one user tag; according to the setting condition, m target users meeting the setting value and the setting condition are determined from a plurality of users corresponding to the n bitmap; wherein m is greater than or equal to zero; in the embodiment, based on the user portrait label, the bitmap is used as the index for searching by the user, the searching efficiency is improved, the target user is determined by combining the n bitmaps, and the accuracy of the obtained target user is improved.

Optionally, the bitmap obtaining module 72 includes:

the relation determining unit is used for determining the expression relation corresponding to each effective identifier in the bitmap corresponding to the setting label according to the category of the setting label;

and the relationship association unit is used for determining n bitmaps related to the set value according to the expression relationship and the set value.

Optionally, expressing the relationship comprises: a first relationship, a second relationship, or a third relationship; the first relation indicates that each effective identifier in the bitmap indicates that the value of the corresponding user on the set label is equal to the value, the second relation indicates that each effective identifier in the bitmap indicates that the value of the corresponding user on the set label is greater than or equal to the value, and the third relation indicates that each effective identifier in the bitmap indicates that the value of the corresponding user on the set label is less than or equal to the value;

the relationship determining unit is specifically configured to determine, in response to the type of the setting tag being an enumerated value tag, that an expression relationship corresponding to each valid identifier in a bitmap corresponding to the setting tag is a first relationship; in response to the fact that the type of the set label is a continuous value label, determining that an expression relation corresponding to each effective identifier in a bitmap corresponding to the set label is a second relation; and in response to the fact that the type of the set label is the time label, determining that the expression relation corresponding to each effective identifier in the bitmap corresponding to the set label is a third relation.

Optionally, the bitmap obtaining module 72 further includes:

a boundary value identification unit for determining whether the set value is a boundary value in the values corresponding to the set label;

the relationship association unit is specifically used for responding to the setting value as the boundary value, and determining n bitmaps related to the boundary value according to the expression relationship and the boundary value; and in response to the setting value not being a boundary value, determining n bitmaps related to the setting value according to the expression relationship and the setting value.

the relationship association unit is specifically used for responding to the first relationship of the expression relationship, and obtaining a bitmap corresponding to the set value based on the set value, or obtaining a bitmap and a full bitmap corresponding to the set value;

in response to the expression relationship being a second relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap and the full bitmap corresponding to the set value, the bitmap corresponding to the set value and the bitmap corresponding to the next numerical value of the set value, the bitmap corresponding to the set value, the full bitmap and the bitmap corresponding to the next numerical value of the set value;

in response to the expression relationship being a third relationship, obtaining one of: the bitmap corresponding to the set value, the bitmap and the full bitmap corresponding to the set value, the bitmap corresponding to the set value and the bitmap corresponding to the last numerical value of the set value, the bitmap corresponding to the set value, the full bitmap and the bitmap corresponding to the last numerical value of the set value.

and the relationship association unit is specifically configured to, in response to the expression relationship being the first relationship, the second relationship or the third relationship, obtain a bitmap corresponding to the boundary value based on the boundary value, or obtain a bitmap and a full-size bitmap corresponding to the boundary value.

In some optional embodiments, when the category of the tag is set as an enumerated tag;

the user searching module 73 is specifically configured to, in response to the setting condition being equal to the preset condition, use a user corresponding to the valid identifier in one bitmap as a target user;

In other alternative embodiments, when the category of the tag is set to a continuous value tag;

the user searching module 73 is specifically configured to, in response to the setting condition being equal to the setting condition, perform an exclusive or operation on the bitmap corresponding to the setting value and the bitmap corresponding to the next numerical value of the setting value, and use a user corresponding to the valid identifier in the operation result as a target user, or use a user corresponding to the valid identifier in the bitmap corresponding to the boundary value as a target user;

responding to the set condition that the set condition is not equal, performing exclusive-or operation on the bitmap corresponding to the set value and the bitmap corresponding to the next digit value of the set value to obtain an exclusive-or bitmap, performing exclusive-or operation on the exclusive-or bitmap and the full-size bitmap, and taking the user corresponding to the effective identifier in the obtained result as a target user; or executing XOR operation by the bitmap corresponding to the boundary value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as the target user;

In further alternative embodiments, when the category of the tag is set to be a time tag;

the user searching module 73 is specifically configured to, in response to the setting condition being equal to the preset condition, perform an exclusive or operation on the bitmap corresponding to the set value and the bitmap corresponding to the last digit of the set value, and use a user corresponding to the valid identifier in the operation result as a target user; or taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as the target user;

responding to the set condition that the set condition is not equal, performing exclusive-or operation on the bitmap corresponding to the set value and the bitmap corresponding to the last digit value of the set value to obtain an exclusive-or bitmap, performing exclusive-or operation on the exclusive-or bitmap and the full-size bitmap, and taking the user corresponding to the effective identifier in the obtained result as a target user; or executing XOR operation by the bitmap corresponding to the boundary value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as the target user;

in response to the set condition being greater than the set condition, performing exclusive-or operation on the bitmap corresponding to the set value and the full bitmap, and taking the user corresponding to the effective identifier in the operation result as a target user;

responding to the set condition that the set condition is larger than or equal to the set condition, executing exclusive OR operation by using the full bitmap and the bitmap corresponding to the last digit value of the set value, and taking the user corresponding to the effective identifier in the operation result as a target user; or taking the user corresponding to the effective identifier in the full bitmap as a target user;

in response to the set condition being less than the preset value, taking a user corresponding to the effective identifier in the bitmap corresponding to the last digit value of the set value as a target user, or taking the target user corresponding to the boundary value as null;

and in response to the setting condition being less than or equal to the preset value, taking the user corresponding to the effective identifier in the bitmap corresponding to the set value as the target user.

Optionally, the condition receiving module is specifically configured to receive setting values of a plurality of setting tags having a set logical operation relationship, and a plurality of setting conditions corresponding to the plurality of setting values; wherein, the setting of the logic operation condition comprises one of the following: and, or, not, xor;

the apparatus provided in this embodiment further includes:

the logic processing module is used for executing corresponding logic operation on a plurality of groups of target users based on the set logic operation relation to obtain k result users; and k is greater than or equal to zero, and each group of target users accords with a set value and a set condition corresponding to the set value.

Optionally, the apparatus provided in this embodiment further includes:

the preselection screening module is used for screening all users stored in the database according to preselection conditions to obtain a user group; the user group comprises a plurality of users meeting preselected conditions; in the user group, a target user is searched based on a set value of the set label and a set condition corresponding to the set value.

Exemplary electronic device

Next, an electronic apparatus according to an embodiment of the present disclosure is described with reference to fig. 8. The electronic device may be either or both of the first device 100 and the second device 200, or a stand-alone device separate from them that may communicate with the first device and the second device to receive the collected input signals therefrom.

FIG. 8 illustrates a block diagram of an electronic device in accordance with an embodiment of the disclosure.

As shown in fig. 8, the electronic device 80 includes one or more processors 81 and memory 82.

The processor 81 may be a Central Processing Unit (CPU) or other form of processing unit having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device 80 to perform desired functions.

Memory 82 may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, Random Access Memory (RAM), cache memory (cache), and/or the like. The non-volatile memory may include, for example, Read Only Memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium and executed by processor 81 to implement the user lookup methods of the various embodiments of the present disclosure described above and/or other desired functions. Various contents such as an input signal, a signal component, a noise component, etc. may also be stored in the computer-readable storage medium.

In one example, the electronic device 80 may further include: an input device 83 and an output device 84, which are interconnected by a bus system and/or other form of connection mechanism (not shown).

For example, when the electronic device is the first device 100 or the second device 200, the input device 83 may be a microphone or a microphone array as described above for capturing an input signal of a sound source. When the electronic device is a stand-alone device, the input means 83 may be a communication network connector for receiving the acquired input signals from the first device 100 and the second device 200.

The input device 83 may also include, for example, a keyboard, a mouse, and the like.

The output device 84 may output various information including the determined distance information, direction information, and the like to the outside. The output devices 84 may include, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, among others.

Of course, for simplicity, only some of the components of the electronic device 80 relevant to the present disclosure are shown in fig. 8, omitting components such as buses, input/output interfaces, and the like. In addition, the electronic device 80 may include any other suitable components depending on the particular application.

Exemplary computer program product and computer-readable storage Medium

In addition to the above-described methods and apparatus, embodiments of the present disclosure may also be a computer program product comprising computer program instructions that, when executed by a processor, cause the processor to perform the steps in the user lookup method according to various embodiments of the present disclosure described in the "exemplary methods" section above of this specification.

The computer program product may write program code for carrying out operations for embodiments of the present disclosure in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.

Furthermore, embodiments of the present disclosure may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform steps in a user lookup method according to various embodiments of the present disclosure described in the "exemplary methods" section above of this specification.

The computer-readable storage medium may take any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The foregoing describes the general principles of the present disclosure in conjunction with specific embodiments, however, it is noted that the advantages, effects, etc. mentioned in the present disclosure are merely examples and are not limiting, and they should not be considered essential to the various embodiments of the present disclosure. Furthermore, the foregoing disclosure of specific details is for the purpose of illustration and description and is not intended to be limiting, since the disclosure is not intended to be limited to the specific details so described.

In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The block diagrams of devices, apparatuses, systems referred to in this disclosure are only given as illustrative examples and are not intended to require or imply that the connections, arrangements, configurations, etc. must be made in the manner shown in the block diagrams. These devices, apparatuses, devices, systems may be connected, arranged, configured in any manner, as will be appreciated by those skilled in the art. Words such as "including," "comprising," "having," and the like are open-ended words that mean "including, but not limited to," and are used interchangeably therewith. The words "or" and "as used herein mean, and are used interchangeably with, the word" and/or, "unless the context clearly dictates otherwise. The word "such as" is used herein to mean, and is used interchangeably with, the phrase "such as but not limited to".

The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

It is also noted that in the devices, apparatuses, and methods of the present disclosure, each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be considered equivalents of the present disclosure.

The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit embodiments of the disclosure to the form disclosed herein. While a number of example aspects and embodiments have been discussed above, those of skill in the art will recognize certain variations, modifications, alterations, additions and sub-combinations thereof.

Claims

1. A method for user lookup, comprising:

obtaining m target users according with the set value and the set condition based on the n bitmaps; wherein m is greater than or equal to zero.

2. The method of claim 1, wherein the categories of user tags comprise: enumerating one or more of a value tag, a continuous value tag, and a time tag;

3. The method of claim 2, wherein determining n bitmaps associated with the settings according to the settings of the settings tag comprises:

4. The method of claim 3, wherein expressing the relationship comprises: a first relationship, a second relationship, or a third relationship; the first relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is equal to the numerical value, the second relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is greater than or equal to the numerical value, and the third relation indicates that the value of each effective identifier in the bitmap, which represents the corresponding user, on the setting label is less than or equal to the numerical value;

5. The method of claim 4, further comprising, before determining n bitmaps associated with the settings according to the expression relationship and the settings, the method further comprising:

6. The method of claim 5, wherein each of the user tags corresponds to a full-scale bitmap, and the full-scale bitmap represents users corresponding to all values in the user tags;

7. The method of claim 5, wherein each of the user tags corresponds to a full-scale bitmap, and the full-scale bitmap represents users corresponding to all values in the user tags;

8. A user lookup apparatus comprising:

9. A computer-readable storage medium, characterized in that the storage medium stores a computer program for executing the user search method of any of the preceding claims 1-7.

10. An electronic device, characterized in that the electronic device comprises:

a processor;

a memory for storing the processor-executable instructions;

the processor is configured to read the executable instructions from the memory and execute the instructions to implement the user lookup method of any one of claims 1-7.