CN112073455B

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

Info

Publication number: CN112073455B
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: 2023-08-08
Anticipated expiration: 2040-07-24
Also published as: CN112073455A

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 requesting party; pushing the request set to a first service provider set and starting a first timer; obtaining a response result of the first service provider set for the request set in the time range of the first timer; and according to the response result, carrying out corresponding processing on each piece of request information 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 response result of popularization, network resource waste caused by comprehensive popularization is avoided, and 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 device, equipment and a storage medium.

Background

With the development of internet technology, more and more services are developed by means of the internet, and in the service implementation process, there are requesters for providing service requirements and service providers for providing services for the requesters. As service traffic evolves, it becomes increasingly complex to match requesters with service providers.

In the prior art, a requester sends out request information of a service requirement, and a service side receives the information and then sends the information to each service provider in time. Before the agreement is reached on each request message, the background staff can continuously send the request message to each same or different service provider at random. So that each request message can be agreed with the service provider.

Disclosure of Invention

The embodiment of the invention provides a data processing method, a device, 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, including:

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

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

obtaining a response result of the first service provider set for the request set in the time range of the first timer;

and according to the response result, carrying out corresponding processing on each piece of request information in the request set.

Optionally, the obtaining a response result of the first service provider set to the request set in the time range of the first timer includes:

acquiring response types of all the first service providers in the first service provider set;

the number of the first service provider of valid responses in the response type is determined as a response result.

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

and if the response results corresponding to at least one piece of request information respectively are larger than a first threshold value, deleting the request information from the request set, and terminating the pushing of any piece of request information.

if the response results respectively corresponding to the at least one request message are smaller than a first threshold value, determining the pushing times respectively corresponding to 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 carrying pushing times identifiers respectively;

and according to the pushing frequency identification, carrying out corresponding processing on the first request set.

Optionally, the performing corresponding processing on the first request set according to the push frequency identifier includes:

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

the larger the corresponding pushing times in the pushing times identifier, the lower the corresponding pushing frequency.

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

Optionally, the setting different push frequencies for the first request set according to different push frequency identifiers includes:

before pushing, determining the sum of effective response results obtained by pushing for a plurality of times;

and deleting the request information with the sum of the effective response results being larger 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 the 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 carrying out corresponding processing on each piece of request information 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 configured to store one or more computer instructions, and the one or more computer instructions implement the data processing method according to the first aspect when executed by the processor.

In a fourth aspect, embodiments of the present invention provide a computer-readable storage medium storing a computer program that, 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 a request set after receiving the request information provided by at least one requester. Further, the server sends the request set to a first service provider set composed of a plurality of first service providers, and simultaneously starts a first timer to start timing. The server side obtains the statistical response result of the first service provider in the time range of the first timer, and carries out corresponding processing on the request information provided by the requester according to the response result. Through the scheme, in the request information promotion process, corresponding processing can be timely carried out according to the promoted response result, network resource waste caused by comprehensive promotion is avoided, and promotion 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, a brief description will be given below of the drawings required for the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

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 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 shown in fig. 2.

DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION

For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the 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 this application 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, the "plurality" generally includes at least two.

It should be understood that the term "and/or" as used herein is merely one relationship describing the association of the associated objects, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a product 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 product or system. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a commodity or system comprising such elements.

With the help of internet technology, the service industry has also changed greatly from traditional offline popularization and subscription. Subscription of the service industry is generally performed by a party (such as a requesting party) initiating an offer request, and another party (such as a service provider) accepting the offer, so as to calculate that subscription is successful. That is, the offer issuance does not necessarily respond, as opposed to the e-commerce purchase of goods. In order for an offer issued by a requestor to match a service provider accepting the offer, it is often necessary to issue the offer to the intended service provider at a preset frequency (e.g., half an hour). However, such indistinguishable frequent offers are of little benefit and waste much network resources.

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

101: a request set including at least one request message is generated based on the request message sent by the requestor.

102: pushing the set of requests to the first set of service providers and starting a first timer.

103: a response result of the first set of service providers to the set of requests within a time range of the first timer is obtained.

104: and according to the response result, carrying out corresponding processing on each piece of request information in the request set.

In practical applications, the set of request information may include only one request information. For example, in a specific period, only one requester sends out request information, and when a preset push time is reached, the request information is pushed to at least one service provider.

In order to obtain the best effect for each push, screening is required according to the relevant information of the requesting party, that is, each service provider in the first service provider set is obtained after screening. For example, the requestor agrees with the service provider's age, native place, payroll, job type, etc. by requesting information. Moreover, each service provider is active, such as if the service provider is marked as available for service, or has recently issued a job request, or is marked as pending.

For the sake of stability, and also for better meeting the selection requirements of the requesting party, at least one request message is pushed to multiple service providers in a set at the same time when pushing is performed. In this way, the requestor may get multiple service providers receiving the offers, and the service provider may get multiple requests at the same time. Therefore, the matching requirement can be better met, and the matching efficiency is improved.

In order to ensure popularization efficiency and 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 after half an hour, counting response results obtained by each piece of request information in the request set. The duration of this first timer may be set according to actual needs, and is merely illustrated herein and not meant to limit the present application.

In one or more embodiments of the present application, the obtaining a response result of the first service provider set to the request set includes: acquiring response types of all the first service providers in the first service provider set; the number of the first service provider of valid responses in the response type is determined as a response result.

The types of responses referred to herein may include: effective response, positive response, no response. Wherein, a valid response as referred to herein may be understood as an affirmative answer from the first service provider accepting the solicitation of the requestor.

For example, the server pushes a request set containing at least one request message to the first service provider set at the same time. The first service provider may view at least one request message through the client, and then the first service provider may choose to ignore one or more request messages therein, and then the response type of the request messages is no response. If the first service provider clicks one or more pieces of request information to check, the first service provider closes after checking, and does not make further determination, the response type of the request information is positive response. If the first service provider clicks one or more pieces of request information to check, and further accepts the offer in the request, the request information obtains a response type as a valid response. Further, the response results corresponding to the request information are counted. It is easy to understand that the greater the number of effective responses in the response results, the higher the matching success rate.

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

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

In one or more embodiments of the present application, the performing, according to the response result, corresponding processing for each piece of request information in the request set includes: if the response results respectively corresponding to the at least one request message are smaller than a first threshold value, determining the pushing times respectively corresponding to 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 carrying pushing times identifiers respectively; and according to the pushing frequency identification, carrying out corresponding processing on the first request set.

If the number of valid responses obtained by a certain request message is smaller than the first threshold, the response obtained by the request message may be considered to be 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, the worse the pushing effect obtained at present, and if the same pushing strategy is adopted for frequent pushing, the better pushing effect will not be obtained, and instead, excessive network resources will be wasted. Therefore, in order to improve the pushing effect and avoid too much occupying network resources, the request information can be grouped according to the pushing times, for example, the pushing times are divided into groups A and B, the pushing times are divided into groups 5-8, the pushing times are divided into groups C, and if the pushing times are 8-10, the pushing times exceed 10 (namely, the second threshold value), prompt information needs to be sent to the operation and maintenance personnel so as to inform the operation and maintenance personnel to perform manual intervention, find the unsuccessful pushing problem, and adjust the pushing strategy. ABC is herein understood to be a number of push identifiers (of course, the actual number of push identifiers may also be used as an identifier), and further, corresponding processing is performed according to different number of push identifiers.

In one or more embodiments of the present application, the performing, according to the pushing frequency identifier, corresponding processing on the first request set includes: setting different pushing frequencies for the first request set according to different pushing frequency identifiers; the larger the corresponding pushing times in the pushing times identifier, the lower the corresponding pushing frequency.

In practical application, if the effective response number in the response result is found to be smaller than the first threshold, the request information is not well responded, that is, the number of the service sides receiving the offer response is small for the request information sent by a certain request side, because after the service sides receive the offer, both sides are required to communicate or after online (or offline) interview, whether the offer behavior can be agreed can be determined, and in the process, the offer success rate is influenced by various factors. Therefore, in order to improve the success rate of the offer, in the actual pushing process, if the number of effective responses is smaller than the first threshold, pushing operation needs to be performed on the request information again or more times.

After grouping the first request set according to the pushing frequency identification through the scheme, different pushing frequencies can be formulated for different groups. It will be readily appreciated that, in a group that can be pushed (i.e., in the ABC group of the above embodiment), the more times a push should be made, the less frequent the push should be and the push policy should be adjusted, where the adjustment of the push policy may include: enlarging the screening condition range, for example, the nurse with the age range of 35-40 age groups contracted in the initial request information can be adjusted to be 35-50 age groups; some unimportant conventions may also be deleted, such as deleting a good news tie, etc. Then pushing is performed after a longer interval (i.e. with a lower frequency, such as 12 hours).

It should be noted that, the screening conditions (or the push policies) corresponding to the first request sets of different packets may be changed, and there may be an individual service provider that is the same as the service provider before the change of the screening conditions in the service provider set obtained based on the different screening conditions or the push policies. Therefore, in order to increase the success rate of push, after the service provider set is obtained through the above screening condition or policy, the service provider that has previously pushed the request information needs to be removed therefrom. 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 push frequency identifiers, different push frequencies for the first request set includes: before pushing, determining the sum of effective response results obtained by pushing for a plurality of times; and deleting the request information with the sum of the effective response results being larger 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, effective response results corresponding to each piece of request information need to be summarized before each pushing, if the number of effective response results corresponding to a piece of request information is found to be larger than a first threshold value, the request information is not needed to be pushed any more, the request information needs to be deleted from a first request set in time, and pushing of the request information is terminated.

Based on the above embodiment, the server generates the request set after receiving the request information provided by at least one requester. Further, the server sends the request set to a first service provider set composed of a plurality of first service providers, and simultaneously starts a first timer to start timing. The server side obtains the statistical response result of the first service provider in the time range of the first timer, and carries out corresponding processing on the request information provided by the requester according to the response result. Through the scheme, in the request information promotion process, corresponding processing can be timely carried out according to the promoted response result, network resource waste caused by comprehensive promotion is avoided, and promotion accuracy and efficiency are improved.

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

a generating module 21, configured to generate a request set containing at least one request information based on the request information sent by the requesting party.

A pushing module 22 is 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, an obtaining module 23, configured to obtain a response type of each first service provider in the first service provider set; the number of the first service provider of valid responses in the response type is determined as a response result.

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

Optionally, the processing module 24 is further configured to determine the number of pushing times corresponding to the at least one request information, where the response result corresponding to the at least one request information is smaller than a first threshold; grouping the at least one request message according to the pushing times to generate at least one group of first request sets carrying pushing times identifiers respectively; and according to the pushing frequency identification, carrying out corresponding processing on the first request set.

Optionally, the processing module 24 is configured to set different pushing frequencies for the first request set according to different pushing frequency identifiers; the larger the corresponding pushing times in the pushing times identifier, the lower the corresponding pushing frequency.

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

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

In one 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, a schematic structural diagram of an electronic device corresponding to the data processing apparatus provided in the embodiment shown in fig. 2 may include: the system comprises a processor 31 and a memory 32, wherein the memory 32 is used for storing one or more computer instructions, and the one or more computer instructions realize the steps executed by the server in the previous embodiments when being executed by the processor 31.

Optionally, a communication interface 33 may also be included in the electronic device for communicating with other devices.

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

The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.

From the above description of embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by adding necessary general purpose hardware platforms, or may be implemented by a combination of hardware and software. Based on such understanding, the foregoing aspects, in essence and portions contributing to the art, may be embodied in the form of a computer program product, which may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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 device 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 one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

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

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 storage media for a computer 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, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A data processing method, applied to a server, the method comprising:

obtaining a response result of the first set of service providers to the request set within a time range of the first timer, including: acquiring response types of all the first service providers in the first service provider set; determining the number of the first service provider of effective response in the response type as a response result;

according to the response result, carrying out corresponding processing on each piece of request information in the request set, wherein the processing comprises the following steps:

if the response results corresponding to at least one piece of request information are larger than a first threshold value, deleting the request information from the request set, and terminating pushing of any piece of request information;

if the response results respectively corresponding to the at least one request message are smaller than a first threshold value, determining the pushing times respectively corresponding to 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 carrying pushing times identifiers respectively; according to the pushing frequency identification, corresponding processing is carried out on the first request set;

the corresponding processing is performed on the first request set according to the pushing frequency identification, and specifically includes: setting different pushing frequencies for the first request set according to different pushing frequency identifiers; the larger the corresponding pushing times in the pushing times identifier, the lower the corresponding pushing frequency.

2. The method of claim 1, wherein if the number of pushes corresponding to the at least one request message is greater than a second threshold, sending a prompt message to the operation and maintenance client.

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

4. A data processing apparatus, the apparatus comprising:

an obtaining module, configured to obtain a response result of the first service provider set to the request set in a time range of the first timer, where the response result includes: acquiring response types of all the first service providers in the first service provider set; determining the number of the first service provider of effective response in the response type as a response result;

the processing module is configured to perform corresponding processing on each piece of request information in the request set according to the response result, and includes:

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

6. 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 acts comprising: