CN112073455A

CN112073455A - Data processing method, device, equipment and storage medium

Info

Publication number: CN112073455A
Application number: CN202010723088.5A
Authority: CN
Inventors: 黄武
Original assignee: May 8 Home Co ltd
Current assignee: May 8 Home Co ltd
Priority date: 2020-07-24
Filing date: 2020-07-24
Publication date: 2020-12-11
Anticipated expiration: 2040-07-24
Also published as: CN112073455B

Abstract

The invention discloses a data processing method, a data processing device, data processing equipment and a storage medium method. The method comprises the following steps: generating a request set containing at least one request message based on the request message sent by the requester; pushing the request set to a first service provider set and starting a first timer; obtaining response results of the first set of service providers to the set of requests within a time range of the first timer; and according to the response result, performing corresponding processing on each request message in the request set. Through the technical scheme, in the process of requesting information popularization, corresponding processing can be timely carried out according to the popularized response result, network resource waste caused by comprehensive popularization is avoided, and the popularization accuracy and efficiency are improved.

Description

Data processing method, device, equipment and storage medium

Technical Field

The embodiment of the invention relates to the technical field of internet, in particular to a data processing method, a data processing device, data processing equipment and a storage medium.

Background

With the development of internet technology, more and more services are developed depending on the internet, and in the service implementation process, there are requesters that put forward service demands and service providers that provide services for the requesters. With the development of service business, it is more and more complicated to match a requester with a service provider.

In the prior art, a requester sends request information of service requirements, and a server receives the information and then sends the information to each service provider in time. Before each request message reaches an agreement, the background staff member will continuously send the request message to each same or different service provider at random. So that each requested message can be made to agree with the service provider.

Disclosure of Invention

The embodiment of the invention provides a data processing method, a data processing device, data processing equipment and a storage medium, which are used for improving the working efficiency of data processing.

In a first aspect, an embodiment of the present invention provides a data processing method, where the method includes:

generating a request set containing at least one request message based on the request message sent by the requester;

pushing the request set to a first service provider set and starting a first timer;

obtaining response results of the first set of service providers to the set of requests within a time range of the first timer;

and according to the response result, performing corresponding processing on each request message in the request set.

Optionally, the obtaining a response result of the first set of service providers to the set of requests within a time range of the first timer includes:

obtaining a response type of each first service provider in the first service provider set;

determining the number of the first service providers that respond effectively in the response type as a response result.

Optionally, the performing, according to the response result, corresponding processing on each piece of request information in the request set includes:

and if the response result corresponding to at least one request message is larger than a first threshold value, deleting the request message from the request set, and terminating the pushing of any request message.

if the response result corresponding to each of the at least one request message is smaller than a first threshold, determining the pushing times corresponding to each of the at least one request message;

grouping the at least one request message according to the pushing times to generate at least one group of first request sets respectively carrying pushing time identifiers;

and performing corresponding processing aiming at the first request set according to the pushing times identifier.

Optionally, the performing, according to the pushing number identifier, corresponding processing on the first request set includes:

setting different pushing frequencies for the first request set according to different pushing frequency identifications;

the pushing frequency is higher than the pushing frequency corresponding to the pushing frequency identification, and the pushing frequency is lower than the pushing frequency corresponding to the pushing frequency identification.

Optionally, if the pushing times respectively corresponding to the at least one request message are greater than a second threshold, sending a prompt message to the operation and maintenance client.

Optionally, the setting, according to the different pushing times identifiers, different pushing frequencies for the first request set includes:

before pushing, determining the sum of effective response results obtained by multiple times of pushing;

and deleting the request information of which the sum of the effective response results is greater than a first threshold value from the first request set, and terminating the pushing of the request information.

In a second aspect, an embodiment of the present invention provides a data processing apparatus, including:

the generating module is used for generating a request set containing at least one request message based on the request message sent by the requesting party;

the pushing module is used for pushing the request set to a first service provider set and starting a first timer;

an obtaining module, configured to obtain a response result of the first service provider set to the request set within a time range of the first timer;

and the processing module is used for correspondingly processing each request message in the request set according to the response result.

In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory, where the memory is used to store one or more computer instructions, and when executed by the processor, the one or more computer instructions implement the data processing method according to the first aspect.

In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium storing a computer program, which when executed by one or more processors causes the one or more processors to perform actions comprising:

In the embodiment of the invention, the server generates the request set after receiving the request information provided by at least one requester. And the server side sends the request set to a first service provider set consisting of a plurality of first service providers, and starts a first timer to time. And the server side acquires the response result of the first service provider counted in the time range of the first timer, and correspondingly processes the request information provided by the requester according to the response result. Through the scheme, in the process of requesting information popularization, corresponding processing can be timely performed according to the popularized response result, network resource waste caused by comprehensive popularization is avoided, and the popularization accuracy and efficiency are improved.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.

Fig. 1 is a schematic flow chart of a data processing method according to an embodiment of the present invention;

fig. 2 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of an electronic device corresponding to the data processing apparatus provided in the embodiment of fig. 2.

DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, and "a plurality" typically includes at least two.

It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

It is also noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a good or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such good or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a commodity or system that includes the element.

With the help of internet technology, the service industry has also changed greatly compared with traditional offline popularization and subscription. The service industry generally signs up for a contract by one party (e.g., a requestor) initiating an offer request and another party (e.g., a service provider) accepting the offer until the contract is successful. That is, the offer issue is not necessarily responded to, as opposed to the e-commerce shopping. In order for an offer issued by a requestor to match a service provider that accepts the offer, it is often necessary to issue the offer to the intended service provider on a preset frequency (e.g., half an hour). However, such indiscriminate frequent invitations are not effective and waste a lot of network resources.

Fig. 1 is a schematic flow chart of a data processing method provided in an embodiment of the present application, and is applied to a server, as shown in fig. 1, the method includes the following steps:

101: and generating a request set containing at least one request message based on the request message sent by the requester.

102: the request set is pushed to a first set of service providers and a first timer is started.

103: obtaining a result of a response of the first set of service providers to the set of requests within a time frame of the first timer.

104: and according to the response result, performing corresponding processing on each request message in the request set.

In practical applications, only one request message may be included in the request message set. For example, only one requesting party sends out the request information in a special time period, and when the preset pushing time is reached, the request information is pushed to at least one service provider.

In order to obtain the best effect in each push, the filtering needs to be performed according to the related information of the requester, that is, each service provider in the first set of service providers is obtained after the filtering. For example, the requestor contracts the service provider's age, native place, payroll, job type, etc. by requesting information. Furthermore, each service provider is active, for example, the service providers are marked as being available to provide services, or have recently made job requests, or are marked as being in a state of waiting for work.

For the sake of reliability and better meeting the selection requirement of the requester, at least one request message is pushed to a plurality of service providers in a set at the same time when pushing. In this way, the requestor may get multiple service providers receiving the offer, which may get multiple requests simultaneously. Therefore, matching requirements can be better met, and matching efficiency is improved.

In order to ensure the promotion efficiency and the matching success rate, after the request set is pushed to the service provider set, a first timer is started to start timing, for example, the timing time set by the first timer is half an hour. And counting the response results obtained by each request message in the request set after half an hour. The time duration of the first timer can be set according to practical requirements, and is only used as an example and is not limited to the application.

In one or more embodiments of the present application, the obtaining a response result of the first set of service providers to the request set includes: obtaining a response type of each first service provider in the first service provider set; determining the number of the first service providers that respond effectively in the response type as a response result.

The response types referred to herein may include: effective response, positive response, no response. Here, the valid response here may be understood as that the first service provider accepts the offer of the requester and responds affirmatively.

For example, the server side pushes a request set containing at least one request message to a first service provider set at the same time. The first service provider can see at least one piece of request information through the client, and then the first service provider can choose to ignore one or more pieces of request information, and the response type of the request information is no response. And if the first service provider clicks one or more pieces of request information for checking, closes after checking and does not make further determination actions, the response type of the request information is positive response. If the first service provider clicks one or more request messages for viewing and further accepts the offer in the request, the request message is responded with a response type of a valid response. And further, respectively counting response results corresponding to the request information. It is easily understood that the greater the number of effective responses in the response result, the higher the matching success rate.

In one or more embodiments of the present application, the performing, according to the response result, corresponding processing on each piece of request information in the request set includes: and if the response result corresponding to at least one request message is larger than a first threshold value, deleting the request message from the request set, and terminating the pushing of any request message.

In practical applications, if the number of valid response results is greater than a first threshold (which may be set according to actual requirements, for example, 10 or 5), it may be considered that the request information sent by the requester definitely finds a matching service provider. The request information can not be pushed again, and the request information is deleted from the request set, so that the high-efficiency popularization of the request information can be effectively ensured, and meanwhile, unnecessary network resource overhead in the popularization process of the request information is avoided.

In one or more embodiments of the present application, the performing, according to the response result, corresponding processing on each piece of request information in the request set includes: if the response result corresponding to each of the at least one request message is smaller than a first threshold, determining the pushing times corresponding to each of the at least one request message; grouping the at least one request message according to the pushing times to generate at least one group of first request sets respectively carrying pushing time identifiers; and performing corresponding processing aiming at the first request set according to the pushing times identifier.

If the number of valid responses obtained by a certain request message is smaller than the first threshold, it can be considered that the response obtained by the request message is not very reliable, in other words, the request message cannot determine whether a matching service provider can be found.

It is easy to understand that the smaller the number of effective responses is, the worse the currently obtained pushing effect is, and if the same pushing strategy is adopted for frequent pushing, the better pushing effect cannot be obtained, but excessive network resources are wasted. Therefore, in order to improve the pushing effect and avoid excessive occupation of network resources, the request information may be grouped according to the pushing times, for example, the pushing times are 2-5 times to group a, 5-8 times to group B, 8-10 times to group C, and if the pushing times exceed 10 times (i.e., the second threshold), prompt information needs to be sent to the operation and maintenance staff, so as to notify the operation and maintenance staff of manual intervention, find a problem of unsuccessful pushing, and adjust the pushing policy. ABC here may be understood as a push number identifier (of course, an actual push number may also be used as an identifier), and then corresponding processing is performed according to different push number identifiers.

In one or more embodiments of the present application, the performing, according to the pushing number identifier, corresponding processing on the first request set includes: setting different pushing frequencies for the first request set according to different pushing frequency identifications; and the pushing frequency is lower when the pushing frequency corresponding to the pushing frequency identification is higher.

In practical applications, if the number of effective responses in the response result is found to be smaller than the first threshold, it indicates that the request information does not have a good response, that is, for the request information sent by a certain requesting party, there are fewer serving parties that receive offer responses, because after the serving party receives an offer, it is necessary for both parties to communicate or perform online (or offline) interviewing to determine whether the offer behavior can reach a agreement, and in this process, various factors influence the success rate of the offer. Therefore, in order to increase the success rate of the invitation, in the actual pushing process, if the number of effective responses is smaller than the first threshold, the request information needs to be pushed again or more times.

After the first request set is grouped according to the pushing times identifier by the scheme, different pushing frequencies can be formulated for different groups. As will be readily understood, in the group that can be pushed (i.e. in the ABC group of the above-mentioned embodiment), the more times the group is pushed, the pushing frequency should be reduced, and the pushing policy should be adjusted, where the adjustment of the pushing policy may include: expanding the range of the screening condition, for example, if the appointed age range in the initial request message is nanny in 35-40 age group, the adjusted age range can be 35-50 age group; some unimportant agreed factors, such as good cuisine, etc., can also be deleted. Then, the push is performed after a longer interval (i.e. with a lower frequency, such as 12 hours).

It should be noted that the filtering conditions (or the push policies) respectively corresponding to the first request sets for different groups may change, and there may be individual service providers in the service provider set obtained based on different filtering conditions or push policies that are the same as the service provider before the filtering conditions are changed. Therefore, in order to increase the push success rate, after the service provider set is obtained through the above screening condition or policy, the service provider whose request information has been pushed before needs to be removed from the service provider set. This ensures that the set of push service providers is different each time.

In one or more embodiments of the present application, the setting, according to the different pushing times identifier, different pushing frequencies for the first request set includes: before pushing, determining the sum of effective response results obtained by multiple times of pushing; and deleting the request information of which the sum of the effective response results is greater than a first threshold value from the first request set, and terminating the pushing of the request information.

In order to avoid excessive occupation or waste of network resources in the pushing process, before each pushing, valid response results corresponding to each request message need to be summarized, if the number of valid response results corresponding to a certain request message is found to be greater than a first threshold, it indicates that the request message does not need to be pushed any more, the request message needs to be deleted from the first request set in time, and the pushing of the request message is terminated.

Based on the above embodiment, the server generates the request set after receiving the request information provided by at least one requester. And the server side sends the request set to a first service provider set consisting of a plurality of first service providers, and starts a first timer to time. And the server side acquires the response result of the first service provider counted in the time range of the first timer, and correspondingly processes the request information provided by the requester according to the response result. Through the scheme, in the process of requesting information popularization, corresponding processing can be timely performed according to the popularized response result, network resource waste caused by comprehensive popularization is avoided, and the popularization accuracy and efficiency are improved.

Based on the same idea, an embodiment of the present application further provides a data processing apparatus, and fig. 2 is a schematic structural diagram of the data processing apparatus provided in the embodiment of the present application. As can be seen in fig. 2, the device comprises:

the generating module 21 is configured to generate a request set including at least one request message based on the request message sent by the requesting party.

A pushing module 22, configured to push the request set to the first service provider set and start a first timer.

An obtaining module 23, configured to obtain a response result of the first service provider set to the request set within a time range of the first timer.

And the processing module 24 is configured to perform corresponding processing on each piece of request information in the request set according to the response result.

Optionally, the obtaining module 23 is configured to obtain a response type of each first service provider in the first set of service providers; determining the number of the first service providers that respond effectively in the response type as a response result.

Optionally, the processing module 24 is configured to delete the request information from the request set if the response result corresponding to each of the at least one request information is greater than a first threshold, and terminate the pushing of any one of the request information.

Optionally, the processing module 24 is further configured to determine, if the response result corresponding to each of the at least one request message is smaller than a first threshold, the number of times of pushing corresponding to each of the at least one request message; grouping the at least one request message according to the pushing times to generate at least one group of first request sets respectively carrying pushing time identifiers; and performing corresponding processing aiming at the first request set according to the pushing times identifier.

Optionally, the processing module 24 is configured to set different pushing frequencies for the first request set according to different pushing frequency identifiers; the pushing frequency is higher than the pushing frequency corresponding to the pushing frequency identification, and the pushing frequency is lower than the pushing frequency corresponding to the pushing frequency identification.

Optionally, the processing module 24 is configured to send a prompt message to the operation and maintenance client if the pushing times respectively corresponding to the at least one request message are greater than a second threshold.

Optionally, the processing module 24 is further configured to determine, before the pushing, a sum of valid response results obtained by multiple times of pushing; and deleting the request information of which the sum of the effective response results is greater than a first threshold value from the first request set, and terminating the pushing of the request information.

In a possible design, the structure of the data processing apparatus shown in fig. 2 may be implemented as an electronic device, and as shown in fig. 3, the electronic device corresponding to the data processing apparatus provided in the embodiment shown in fig. 2 may include: a processor 31, a memory 32, wherein the memory 32 is used for storing one or more computer instructions, and the one or more computer instructions, when executed by the processor 31, implement the steps performed by the server in the foregoing embodiments.

Optionally, the electronic device may further include a communication interface 33 for communicating with other devices.

In addition, an embodiment of the present invention provides a computer storage medium for storing a computer program, where the computer program enables a client to implement the data processing method in the embodiment shown in fig. 1 when the computer program is executed.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that the embodiments can be implemented by adding necessary general hardware platform, and of course, can also be implemented by a combination of hardware and software. With this understanding in mind, the above-described aspects and portions of the present technology which contribute substantially or in part to the prior art may be embodied in the form of a computer program product, which may be embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including without limitation disk storage, CD-ROM, optical storage, and the like.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable resource updating apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable resource updating apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable resource updating apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable resource updating apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A data processing method is applied to a server side, and the method comprises the following steps:

2. The method of claim 1, wherein obtaining response results of the first set of service providers to the set of requests within a time frame of the first timer comprises:

3. The method according to claim 2, wherein said performing, according to the response result, corresponding processing on each request information in the request set includes:

4. The method according to claim 2, wherein said performing, according to the response result, corresponding processing on each request information in the request set includes:

5. The method according to claim 4, wherein said performing corresponding processing on the first request set according to the pushing number identifier comprises:

6. The method according to claim 4, wherein if the pushing times respectively corresponding to the at least one request message are greater than a second threshold, a prompt message is sent to the operation and maintenance client.

7. The method of claim 5, wherein setting different push frequencies for the first request set according to different push times identifiers comprises:

8. A data processing apparatus, characterized in that the apparatus comprises:

9. An electronic device, comprising: a processor, a memory for storing one or more computer instructions, wherein the one or more computer instructions, when executed by the processor, implement the data processing method of any of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by one or more processors, causes the one or more processors to perform acts comprising: