A method, apparatus, medium and electronic device for processing lead data

Abstract

Embodiments of the present application provide a method, device, medium and electronic equipment for processing lead data, the method comprising: storing process data corresponding to a first type of lead in a temporary partition, wherein the first type of lead belongs to an uncompleted lead, and the uncompleted lead is a lead that needs business tracking; monitoring each lead stored in the temporary partition, and deleting process data corresponding to a second type of lead from the temporary partition and storing the process data in a fixed partition, wherein the second type of lead is a completed lead, and the completed lead is a lead that does not need continued business tracking. Through the embodiments of the present application, the data processing amount can be effectively reduced by monitoring the leads in the temporary partition, thereby saving the computing time and computing resources wasted by the join association operation of massive data.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of big data processing, and in particular, the embodiments of the present application relate to a method and device for processing lead data, a medium and an electronic device. BACKGROUND

[0002] The data carrier is a lead, that is, user information. The information is divided into multiple facts, and the facts include: warehousing, issuing, dialing, recycling, transferring to manual, and closing a deal, which are connected by a lead information string. However, there is no operation management platform at present, so it is impossible to associate upstream and downstream data when counting cross-fact data. For example, real-time records are single and individual at present, and there is no end-of-life tracking for periodic observation.

[0003] All data related to each lead is recorded and tracked by using a table when the existing data volume is small, that is, the lead state in the table can be directly updated when the data volume is not large. However, there are many upstream and downstream data of large data (for example, the existing lead state update algorithm has a very large input data volume), and the existing technology adopts a full scanning mode to track each lead, thereby causing a serious time consumption and affecting the processing speed. SUMMARY

[0004] The embodiments of the present application aim to provide a method and device for processing lead data, a medium and an electronic device. Through the embodiments of the present application, the data processing amount can be effectively reduced by monitoring the leads in the temporary partition, and the effect of saving the calculation time and calculation resources wasted by the join association operation of the massive data is achieved.

[0005] In a first aspect, the embodiments of the present application provide a method for processing lead data, which includes: storing process data corresponding to a first type of lead in a temporary partition, wherein the first type of lead belongs to an unfinished lead, and the unfinished lead is a lead that needs to be tracked; monitoring each lead stored in the temporary partition, and deleting process data corresponding to a second type of lead from the temporary partition and storing the process data in a fixed partition, wherein the second type of lead is a completed lead, and the completed lead is a lead that does not need to be continuously tracked.

[0006] Some embodiments of the present application put the unfinished leads into the temporary partition, and only monitor the unfinished leads, which can effectively improve the problem of serious time consumption and slow processing speed caused by the full scanning of all leads in the existing technology.

[0007] In some embodiments, the storing of the process data corresponding to the first type of lead in the temporary partition includes: storing the process data corresponding to the first type of lead in the temporary partition by using a cumulative snapshot mode.

[0008] Some embodiments of the present application improve the tracking effect of the clue by periodically updating the data in the temporary partition.

[0009] In some embodiments, before the storing the process data corresponding to the first type of clue in the temporary partition, the method further comprises: obtaining first process data corresponding to the first clue; determining that the first clue belongs to the first type of clue according to the first process data; searching for a target storage area corresponding to a clue identifier of the first clue in the temporary partition; and the storing the process data corresponding to the unfinished clue in the temporary partition comprises: modifying a target field in the target storage area according to the first process data corresponding to the first clue.

[0010] Some embodiments of the present application determine whether to store the latest process data in the temporary partition or in the fixed area by determining whether the latest process data causes the corresponding clue to end, so as to improve the temporary partition to store only the data corresponding to the unfinished clue.

[0011] In some embodiments, the method further comprises: reading a rule table; and wherein the determining that the first clue belongs to the first type of clue comprises: determining that the first clue belongs to the first type of clue according to the rule table.

[0012] Some embodiments of the present application determine whether each type of clue is an unfinished clue by the determination rule set in the rule table, so as to improve the accuracy and flexibility of the clue attribute determination.

[0013] In some embodiments, the rule table can configure the length of the life cycle of at least one clue.

[0014] Some embodiments of the present application can change the latest clue state determination rule in real time by updating or reconfiguring the rule table, so as to improve the universality of the technical solution.

[0015] In some embodiments, the method further comprises: dividing the storage area into the temporary partition and the fixed partition by using a dynamic partition algorithm.

[0016] In some embodiments of the present application, the dynamic partition algorithm is used to divide the storage area.

[0017] In some embodiments, the data in the temporary partition is updated periodically.

[0018] Some embodiments of the present application can store the process data corresponding to the first type of clue in the temporary partition in the form of cumulative snapshots by periodically updating the data in the temporary partition.

[0019] In some embodiments, the second type of lead includes: a lead deal, a lead recycling, or a lead logical deletion.

[0020] Some embodiments of the present application provide various examples of completing a lead.

[0021] In a second aspect, some embodiments of the present application provide a device for processing lead data, the device comprising: a first processing module configured to store process data corresponding to a first type of lead in a temporary partition, wherein the first type of lead belongs to an uncompleted lead, and the uncompleted lead is a lead that needs business tracking; and a second processing module configured to monitor each lead stored in the temporary partition, and delete process data corresponding to a second type of lead from the temporary partition and store the process data in a fixed partition, wherein the second type of lead is a completed lead, and the completed lead is a lead that does not need further business tracking.

[0022] In a third aspect, some embodiments of the present application provide a computer readable storage medium having stored thereon a computer program, the program being executable by a processor to implement the method according to any of the embodiments of the first aspect.

[0023] In a fourth aspect, some embodiments of the present application provide an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, can implement the method according to any of the embodiments of the first aspect. BRIEF DESCRIPTION OF DRAWINGS

[0024] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following will briefly introduce the drawings needed to be used in the embodiments of the present application. It should be understood that the following drawings only show some embodiments of the present application, and therefore should not be regarded as a limitation on the scope, and for those skilled in the art, other related drawings can also be obtained without creative labor on the basis of these drawings.

[0025] Figure 1 The architecture diagram of the system for processing lead data provided by the embodiments of the present application;

[0026] Figure 2 One of the flowcharts of the method for processing lead data provided by the embodiments of the present application;

[0027] Figure 3 The second flowchart of the method for processing lead data provided by the embodiments of the present application;

[0028] Figure 4 The composition block diagram of the device for processing lead data provided by the embodiments of the present application;

[0029] Figure 5An electronic device composition schematic diagram provided by an embodiment of the present application. DETAILED DESCRIPTION

[0030] The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.

[0031] It should be noted that: similar reference numerals and letters represent similar items in the following drawings, therefore, once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. Meanwhile, in the description of the present application, the terms "first", "second", etc. are only used for distinguishing description, and cannot be understood as indicating or implying relative importance.

[0032] Some embodiments of the present application aim at mass case operation data tracking problems, utilize dynamic partitioning technology (for example, hive sql dynamic partitioning technology), firstly judge whether a clue or a case is a terminal state, secondly associate the clue which is not a terminal state with the latest burying point log data, and finally judge whether the clue is completed according to the associated data, put the data of the clue which is not completed in a temporary partition and put the data of the clue which is completed in an operation date partition, so as to save the effect of wasting computing time and computing resources of mass data through join association operation.

[0033] It can be understood that some embodiments of the present application adopt the cumulative snapshot mode to put the clue which is not completed into a temporary partition, only monitor the clue which is not completed, and do not need to adopt the related technology to perform full table scanning and full table update state of all data corresponding to all clues every day, thereby saving the io expenditure and increasing the data processing efficiency in the big data scenario.

[0034] Please refer to Figure 1 , Figure 1 A system for processing clue data, the system includes a plurality of terminal devices (for example, Figure 1 a first terminal device 101 and a second terminal device 102) and a server 201, wherein each terminal device can generate clue related data, for example, the clue is used to represent user information of a user, in the process of converting the user, a lot of process data corresponding to the clue will be generated, the types of the process data include: outbound volume, connection volume, transfer to manual volume, transaction volume, etc., in some embodiments of the present application, the dimensional data of the clue and these process data are combined together to form a process data of the clue, which is stored as data in a temporary partition.

[0035] It should be noted that the clue is the basic material of the work. According to the case (i.e. the clue) provided by Party A, the work platform will call out, add micro and other work. Some cases (or called clues) will become non-follow-up tracking state (i.e. belong to completed clues) after a series of work, on the contrary, a part of cases (clues) need follow-up tracking transformation (i.e. mathematics and unfinished clues), these cases (clues) and corresponding data need to be placed in the temporary partition. The completion of the clue includes: clue transaction, clue recycling, clue logical deletion, Party A repeated case, etc.

[0036] The following will be combined Figure 2 Exemplary description of the method for processing clue data provided by some embodiments of the present application.

[0037] As Figure 2 shown, the method for processing clue data provided by the embodiments of the present application comprises:

[0038] S101, the process data corresponding to the first type of clue is stored in the temporary partition, wherein the first type of clue belongs to the unfinished clue, and the unfinished clue is the clue which needs business tracking.

[0039] For example, in some embodiments of the present application, S101 exemplarily comprises: adopting the cumulative snapshot mode to store the process data corresponding to the first type of clue in the temporary partition. In some embodiments of the present application, the state corresponding to each clue cannot be completed by taking a snapshot on the same day, and the unfinished clue needs to be updated in a period of time, so it is called cumulative snapshot. The unfinished clue needs to be tracked for a period of time. In some embodiments of the present application, the tracking effect of the clue is improved by periodically updating the data in the temporary partition.

[0040] In some embodiments of the present application, the second type of clue comprises: clue transaction, clue recycling or clue logical deletion. Some embodiments of the present application provide examples of various completed clues.

[0041] S102, each clue stored in the temporary partition is monitored, and the process data corresponding to the second type of clue is deleted from the temporary partition and stored in the fixed partition, wherein the second type of clue is a completed clue, and the completed clue is a clue which does not need to continue business tracking.

[0042] That is, some embodiments of the present application put the unfinished clue into the temporary partition, and only monitor the unfinished clue, which can effectively improve the problem of time-consuming and slow processing speed caused by the way of scanning all clues in the prior art.

[0043] It should be noted that in some embodiments of the present application, before S101, the method further comprises: obtaining first process data corresponding to the first clue; determining that the first clue belongs to the first type of clue through the first process data; finding a target storage area corresponding to a clue identifier of the first clue in the temporary partition; and storing process data corresponding to an unfinished clue in the temporary partition comprises: modifying a target field in the target storage area according to the first process data corresponding to the first clue. Some embodiments of the present application determine whether the latest process data causes the corresponding clue to end, and then determine whether to store the process data in the temporary partition or in the fixed area, so as to improve the fact that only data corresponding to unfinished clues is stored in the temporary partition.

[0044] In order to update the rule of determining whether a certain clue is finished in real time, in some embodiments of the present application, the method further comprises: reading a rule table; wherein the determination that the first clue belongs to the first type of clue comprises: determining that the first clue belongs to the first type of clue according to the rule table. Some embodiments of the present application determine whether each type of clue is an unfinished clue through the determination rule set in the rule table, so as to improve the accuracy and flexibility of the determination of the clue attribute.

[0045] For example, in some embodiments of the present application, the length of the life cycle of at least one clue can be configured through the rule table. Some embodiments of the present application can change the latest clue state determination rule in real time through the way of updating or reconfiguring the rule table, so as to improve the universality of the technical solution.

[0046] In some embodiments of the present application, the method further comprises: dividing the storage area into the temporary partition and the fixed partition by using a dynamic partition algorithm. In some embodiments of the present application, the dynamic partition algorithm is used to divide the storage area.

[0047] In some embodiments of the present application, the data in the temporary partition is updated periodically. Some embodiments of the present application can store the process data corresponding to the first type of clue in the temporary partition in the form of cumulative snapshots by periodically updating the data in the temporary partition.

[0048] The following will be described in combination with Figure 3 The method for processing clue data according to some embodiments of the present application is exemplarily described.

[0049] S201, new business data, i.e. process data.

[0050] The new business data is data related to a certain clue. For example, if a user corresponding to a certain clue makes a telephone contact, the information of the telephone contact belongs to the new business data.

[0051] S202, start.

[0052] S203, associate the temporary partition data with the new business data through the primary key.

[0053] For example, each unfinished clue stored in the temporary partition is separately stored using the corresponding clue identifier, and when new business data is received, the new business data is stored with other data corresponding to the clue according to the clue identifier. For example, the primary key is the clue identifier of the clue corresponding to the new business data.

[0054] S204, determine whether the case has reached the final state, if yes, execute S206, if not, execute S205.

[0055] S205, store the new business data in the temporary partition.

[0056] S206, archive the data.

[0057] Example 1

[0058] The clue with clue ID (i.e. clue identifier of a certain clue) 1001 was reported on August 21, 2022, and was called out once, so the next day at T+1, the 1001 data will be placed in the temporary partition, and the data called out on the same day will also be associated with the clue ID (i.e. clue identifier of a certain clue) as new business data. Since the case was only called out and did not have conversion, recycling or other operations to indicate that it has reached the completed state, the data with clue ID 1001 will be placed in the temporary partition with one call record.

[0059] On August 25, another call was made, but no deal was made, so on August 26, after the script was executed in the morning, the data with clue ID 1001 was updated to 2 calls, and since it did not reach the completed state, it was still placed in the temporary partition.

[0060] On August 30, 1 call was made, and after the call was connected, a transfer to an operator occurred, and a final deal was made. When the script is run in the morning on the 24th, the new business data (1 call, 1 transfer to an operator, 1 deal, and 1,000 yuan) will be stored in the temporary partition. After that, the data with clue ID 1001 will no longer be associated with new business data and monitored, reducing the amount of monitoring work.

[0061] It should be noted that the position of the temporary partition in some embodiments of the present application: a field in a table, using the field to distinguish, integrated a table, based on each service flow to separate the service key node into a table. The key node comes from the buried point data of the job data, such as the buried point log data of the outbound call of the lead identified as 1001 at a certain time, according to the case ID and the case in the temporary partition, the field is associated and updated.

[0062] It can be understood that the final state may change as the business develops, for example, it is considered to reach A to correspond to the lead to belong to the completion yesterday, but as the business develops, the final state may be B state to complete the lead, for such cases, some embodiments of the present application maintain a rule table, and the state of the stored lead is updated by configuring the rule table. For example, the program automatically reads the latest rule table and completes the comparison according to the new rules of the rule table to determine whether a certain lead can be completed.

[0063] For example, in some embodiments of the present application, when the script is run every day, the rule table is read first, and the case is circled according to the latest rule table to determine whether the terminal state is reached, such as the life cycle is modified from one month to two weeks. The case data in the temporary partition is judged whether the terminal state is reached according to the latest rule.

[0064] For example, in some embodiments of the present application, the data in the temporary partition is updated every day, and all the data in the partition is deleted before writing. The rule in the rule table can be understood as a rule for configuring the life cycle of a lead, such as the validity period of a batch of leads is one month, then after one month, whether there is conversion or not, is deleted from the temporary partition and put into the fixed partition. The rule in the rule table is responsible for circumscribing a batch of leads, such as the validity period of the leads stored in the database the next day is one week.

[0065] Please refer to Figure 4 , Figure 4 The device for processing lead data provided by the embodiments of the present application is shown, it should be understood that the device corresponds to the above-mentioned Figure 2 method embodiments, can execute each step involved in the above-mentioned method embodiments, the specific functions of the device can be referred to the description in the above, to avoid repetition, the detailed description is appropriately omitted here. The device includes at least one software function module which can be stored in the form of software or firmware in the memory or solidified in the operating system of the device, the device for processing lead data, comprising: a first processing module 401 and a second processing module 402.

[0066] The first processing module is configured to store process data corresponding to the first type of clues in a temporary partition, wherein the first type of clues belong to uncompleted clues, and the uncompleted clues are clues that need to be tracked.

[0067] The second processing module is configured to monitor each clue stored in the temporary partition, and delete process data corresponding to the second type of clues from the temporary partition and store the process data in a fixed partition, wherein the second type of clues are completed clues, and the completed clues are clues that do not need to be tracked.

[0068] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the foregoing method, and will not be described in detail here.

[0069] Some embodiments of the present application provide a computer readable storage medium having a computer program stored thereon, wherein the program is executed by a processor to implement the method described in any of the embodiments of the method of processing clue data.

[0070] As shown in Figure 5 Some embodiments of the present application provide an electronic device 500, which includes a memory 510, a processor 520, and a computer program stored in the memory 510 and executable on the processor 520, wherein the processor 520 reads the program from the memory 510 through a bus 530, and the program is executed to implement the method described in any of the embodiments of the method of processing clue data.

[0071] The processor 520 can process digital signals, and can include various computing structures. For example, a complex instruction set computer structure, a reduced instruction set computer structure, or a structure implementing a combination of multiple instruction sets. In some examples, the processor 520 can be a microprocessor.

[0072] The memory 510 can be used to store instructions executed by the processor 520 or data related to the execution process of the instructions. These instructions and / or data can include code for implementing some or all functions of one or more modules described in embodiments of the present application. The processor 520 of the present disclosure can be used to execute instructions in the memory 510 to implement the method shown in Figure 2 The memory 510 includes a dynamic random access memory, a static random access memory, a flash memory, an optical memory, or other memories well known to those skilled in the art.

[0073] In several embodiments provided in the present application, it should be understood that the disclosed apparatus and method can also be implemented by other means. The apparatus embodiments described above are only illustrative, for example, the flowcharts and block diagrams in the drawings show the possible implementation architecture, function and operation of the apparatus, method and computer program product according to the embodiments of the present application. In this regard, each block in the flowchart or block diagram can represent a module, a program segment or a part of code, which contains one or more executable instructions for implementing the specified logic function. It should also be noted that in some alternative implementations, the functions noted in the blocks can occur in different order from that shown in the drawings. For example, two consecutive blocks can actually be executed substantially in parallel, and sometimes they can be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and the combination of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system for performing the specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions.

[0074] In addition, the functional modules in the embodiments of the present application can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.

[0075] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various program code storage media.

[0076] The above merely provides an example of the present application and is not intended to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, and thus, once an item is defined in one drawing, it need not be further defined and explained in subsequent drawings.

[0077] The above merely provides an example of the present application and is not intended to limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, and thus, once an item is defined in one drawing, it need not be further defined and explained in subsequent drawings.

[0078] It should be noted that the relational terms herein such as first and second and the like are used solely to distinguish one entity or action from another, without necessarily requiring or implying any actual relationship or order between such entities or actions. Moreover, the terms "comprises", "comprising", or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but can include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by "comprises... a" does not, without more constraints, exclude the existence of additional identical elements in the process, method, article, or apparatus that comprises the element.

Claims

1. A method for processing clue data, characterized in that, The method includes: Obtain the first process data corresponding to the first clue; The data from the first process confirms that the first clue belongs to the first type of clue, wherein the first type of clue is an unresolved clue, and the unresolved clue is a clue that needs to be tracked in the business. Locate the target storage area in the temporary partition that corresponds to the clue identifier of the first clue; Storing the process data corresponding to the first type of clue in a temporary partition includes: modifying the target field in the target storage area according to the first process data; Monitor each clue stored in the temporary partition, and delete the process data corresponding to the second type of clue from the temporary partition and store it in the fixed partition. The second type of clue is a completed clue, which is a clue that does not need to be tracked for further business.

2. The method as described in claim 1, characterized in that, The process data corresponding to the first type of clue is stored in a temporary partition, including: The process data corresponding to the first type of clue is stored in the temporary partition using a cumulative snapshot method.

3. The method as described in claim 1, characterized in that, The method further includes: Read the rule table; Wherein, confirming that the first clue belongs to the first type of clue includes: According to the rule table, the first clue belongs to the first type of clue.

4. The method as described in claim 3, characterized in that, The rule table allows configuration of the lifecycle length of at least one clue.

5. The method according to any one of claims 1-3, characterized in that, The method further includes: The storage area is divided into the temporary partition and the fixed partition using a dynamic partitioning algorithm.

6. The method as described in claim 1, characterized in that, The data in the temporary partition is updated periodically.

7. The method as described in claim 1, characterized in that, The second type of clues includes: clue transactions, clue recycling, or clue logical deletion.

8. An apparatus for processing clue data, characterized in that, The device includes: The first processing module is configured as follows: Obtain the first process data corresponding to the first clue; The data from the first process confirms that the first clue belongs to the first type of clue, wherein the first type of clue is an unresolved clue, and the unresolved clue is a clue that needs to be tracked in the business. Locate the target storage area in the temporary partition that corresponds to the clue identifier of the first clue; Storing the process data corresponding to the first type of clue in a temporary partition includes: modifying the target field in the target storage area according to the first process data; The second processing module is configured to monitor each clue stored in the temporary partition, and delete the process data corresponding to the second type of clue from the temporary partition and store it in a fixed partition. The second type of clue is a completed clue, which is a clue that does not need to be followed up on further.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by a processor, it can implement the method described in any one of claims 1-7.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein, When the processor executes the program, it can implement the method described in any one of claims 1-7.

Images