Method, device, electronic device and storage medium for creating SMS tasks

Abstract

The present invention provides a method, device, electronic device and storage medium for creating a short message task, and relates to the field of communication technology. The method comprises: in response to a request for creating a short message task, selecting multiple target fence areas from multiple fence areas that have been created; adding the multiple target fence areas to a cache queue; acquiring configuration information of the short message task; and traversing the cache queue according to the configuration information of the short message task to create multiple short message tasks, each of which corresponds to one target fence area.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a method, device, electronic device and storage medium for creating a short message task. Background Art

[0002] The existing method of sending SMS messages in coverage only supports sending messages to administrative areas and a single fenced area. In order to send SMS messages to a certain administrative area or fenced area, you need to create an SMS task for that area.

[0003] However, in actual use scenarios, sending by administrative area will cause the target area to be too large. Sending by fence area is accurate, but only one fence area can be selected at a time. When SMS group messaging needs to be sent to multiple fence areas, users need to create multiple SMS tasks and plan a fence area for each SMS task. The whole process is cumbersome and inefficient. Summary of the invention

[0004] In view of the above problems, embodiments of the present invention provide a method, device, electronic device and storage medium for creating a short message task, so as to overcome the above problems or at least partially solve the above problems.

[0005] According to a first aspect of an embodiment of the present invention, a method for creating a short message task is provided, comprising:

[0006] In response to a request to create a short message task, selecting multiple target fence areas from multiple fence areas that have been created;

[0007] Adding the multiple target fence areas to a cache queue;

[0008] Obtain configuration information of the SMS task;

[0009] According to the configuration information of the SMS task, the cache queue is traversed to create a plurality of the SMS tasks, each of which corresponds to one of the target fence areas.

[0010] Optionally, after creating the plurality of SMS tasks, the method further includes:

[0011] Acquire each telephone number that has stayed on each base station in the plurality of target fence areas;

[0012] Deduplication processing is performed on each of the telephone numbers to obtain a plurality of processed telephone numbers;

[0013] The SMS content corresponding to the SMS task is sent to the multiple processed telephone numbers.

[0014] Optionally, the configuration information of the SMS task includes the SMS sending time and the SMS content; and the group-sending the SMS corresponding to the SMS task to the multiple processed phone numbers includes:

[0015] When the SMS sending time arrives, the SMS content is group-sent to the multiple processed phone numbers.

[0016] Optionally, before selecting a plurality of target fence areas from the plurality of fence areas that have been created, the method further includes:

[0017] Draw a plurality of candidate fence areas on a map, and obtain the coordinates and fence type of each candidate fence area;

[0018] Verify whether each of the candidate fence areas meets the validity condition, and determine each of the candidate fence areas that meets the validity condition as one of the multiple fence areas for storage. A candidate fence area that meets the validity condition means that the candidate fence area contains a base station and there is a telephone number in the base station.

[0019] Optionally, it also includes:

[0020] Editing the candidate fence area that does not meet the validity condition to obtain an edited fence area, wherein the edited fence area is a fence area that meets the validity condition, and the editing includes at least one or more of the following: translation and deformation;

[0021] Each of the edited fence areas is determined as one of the multiple fence areas, and the multiple fence areas are stored.

[0022] Optionally, before verifying whether each of the candidate fence areas meets the validity condition, the method further includes:

[0023] Obtaining the fence type of each candidate fence area;

[0024] In a case where the fence type of the candidate fence area is a non-cross-administrative area fence, determining a first administrative area to which the candidate fence area belongs;

[0025] Obtaining the coordinate range of the first administrative region;

[0026] The coordinates in the candidate fence area that do not belong to the first administrative area are eliminated.

[0027] Optionally, when the fence type of the candidate fence area is a cross-administrative area fence, the method further includes:

[0028] Determine the second administrative region to which the candidate fence area belongs;

[0029] Acquire a third administrative region adjacent to the second administrative region;

[0030] Query whether the candidate fence area overlaps with the third administrative area;

[0031] In the event of overlap, it is determined that the candidate fence area does not require correction.

[0032] A second aspect of an embodiment of the present invention provides a device for creating a short message task, comprising:

[0033] A selection module is configured to select a plurality of target fence areas from a plurality of fence areas that have been created in response to a request to create a short message task;

[0034] An adding module, configured to add the plurality of target fence areas to a cache queue;

[0035] An acquisition module, configured to acquire configuration information of the SMS task;

[0036] The creation module is configured to traverse the cache queue according to the configuration information of the SMS task, and create a plurality of the SMS tasks, each of which corresponds to one target fence area.

[0037] According to a third aspect of an embodiment of the present invention, an electronic device is provided, comprising: a processor; and a memory for storing instructions executable by the processor; wherein the processor is configured to execute the instructions to implement the method for creating a text message task as described in the first aspect.

[0038] According to a fourth aspect of an embodiment of the present invention, a computer-readable storage medium is provided. When instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device is enabled to execute the method for creating a text message task as described in the first aspect.

[0039] According to a fifth aspect of an embodiment of the present invention, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the method for creating a text message task as described in the first aspect is implemented.

[0040] The embodiments of the present invention include the following advantages:

[0041] In this embodiment, in response to a request to create a text message task, multiple target fence areas are selected from multiple fence areas that have been created; the multiple target fence areas are added to a cache queue; the configuration information of the text message task is obtained; according to the configuration information of the text message task, the cache queue is traversed to create multiple text message tasks, each of which corresponds to one target fence area. In this way, the user only needs to configure the configuration information of a text message task, and then each target fence area in the cache queue can be automatically traversed, and according to the configuration information of the text message task, a text message task is created for each target fence area, thereby realizing the rapid creation of multiple text message tasks for multiple fence areas. Moreover, the target fence area is a fence area that has been created in advance, and the process of creating multiple text message tasks is relatively simple and efficient. In addition, each created text message task is for a fence area, which has the advantage of a relatively accurate range. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments of the present invention will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative labor.

[0043] Figure 1 is a flowchart of a method for creating a text message task in an embodiment of the present invention;

[0044] Figure 2 is a schematic diagram of the candidate fence area created;

[0045] Figure 3 is a schematic diagram of a process of creating a fenced area in an embodiment of the present invention;

[0046] Figure 4 It is a schematic diagram of the working principle of the method for creating a text message task in an embodiment of the present invention;

[0047] Figure 5 The invention is a block diagram of a device for creating a short message task in an embodiment of the present invention. DETAILED DESCRIPTION

[0048] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0049] Reference Figure 1 As shown, a flowchart of a method for creating a short message task in an embodiment of the present invention is shown. The method can be used in electronic devices such as servers, computers, and electronic terminals. Figure 1As shown, the method for creating the SMS task may specifically include steps S11 to S14.

[0050] Step S11: In response to the SMS task creation request, multiple target fence areas are selected from multiple fence areas that have been created.

[0051] When it is necessary to create a short message task, an area requirement corresponding to the short message task is determined, and multiple target fence areas are selected from multiple fence areas that have been created according to the area requirement.

[0052] Multiple fence areas are pre-created and stored fence areas. Each time you create a text message task, you only need to select the target fence area corresponding to the text message task from the stored multiple fence areas, without having to re-create the fence area each time you create a text message task. The method of creating multiple fence areas will be introduced later.

[0053] In this way, the stored fence area can be used multiple times, avoiding the need to create the fence area each time and consuming computing resources. In addition, when creating a text message task, directly selecting the created fence area can effectively simplify the process of creating text message tasks and improve efficiency compared to creating a new fence area during the process of creating a text message task.

[0054] Step S12: adding the multiple target fence areas to a cache queue.

[0055] The selected multiple target fence areas are added to the cache queue, and the sum of the multiple target fence areas is the sending area corresponding to the SMS task to be created.

[0056] Optionally, before adding multiple target fence areas to the cache queue, the multiple target fence areas may be subjected to adjacency verification. The adjacency verification of multiple target fence areas is essentially to calculate the size of the overlapping areas between the multiple target fence areas. If the adjacency verification fails, a prompt message may be issued to prompt the user to reselect the target fence area.

[0057] For example, the target fence area A is a subset of the target fence area B. Since the target fence area B completely covers the target fence area A, the target fence area A and the target fence area B fail the adjacency verification; therefore, only the target fence area B needs to be added to the cache queue without adding the target fence area A to the cache queue.

[0058] Optionally, before adding multiple target fence areas to the cache queue, the validity of the multiple target fence areas can be verified. Verifying the validity of the target fence area means verifying whether the target fence area meets the validity condition. A target fence area meets the validity condition if the target fence area contains a base station and the base station has a phone number. Optionally, the number of base stations in the validity condition and the number of phone numbers in the base station can also be set. When a target fence area does not meet the validity condition, there is no phone number in the target fence area that can be used for group text messaging, and naturally there is no need to create a text message task for the target fence area. Therefore, there is no need to add the target fence area to the cache queue.

[0059] Step S13: Obtain the configuration information of the SMS task.

[0060] The configuration information of the SMS task may include the SMS sending time, SMS content, sending type, roaming type, number of messages sent, etc. The SMS configuration information may be configured by the user according to the needs. Among them, the SMS content may be the content that has passed the verification, so as to avoid sending abnormal content to various phone numbers.

[0061] Step S14: According to the configuration information of the SMS task, the cache queue is traversed to create a plurality of the SMS tasks, each of which corresponds to one of the target fence areas.

[0062] Traverse the cache queue, obtain each target fence area in the cache queue, and automatically generate a SMS task corresponding to the target fence area according to the configuration information of the SMS task and each target fence area. In this way, multiple SMS tasks can be automatically generated, and each SMS task corresponds to a target fence area. One SMS task corresponds to one fence area, and the phone number that receives the SMS content of the SMS task is the phone number in the fence area.

[0063] By adopting the technical solution of the embodiment of the present invention, the user only needs to configure the configuration information of a short message task, and then each target fence area in the cache queue can be automatically traversed, and a short message task is created for each target fence area according to the configuration information of the short message task, thereby realizing the rapid creation of multiple short message tasks for multiple fence areas. Moreover, the target fence area is a fence area that has been created in advance, and the process of creating multiple short message tasks is relatively simple and efficient. In addition, each created short message task is targeted at a fence area, which has the advantage of a relatively accurate range.

[0064] Optionally, a task acquisition timer can be set to pull information every two minutes, and determine whether to create a text message task based on the pulled information. The pulled information can also include configuration information of the text message task and information of the cache queue, and the cache queue includes multiple target fence areas. Based on the pulled information, multiple text message tasks can be automatically created, and each text message task corresponds to a target fence area.

[0065] Optionally, based on the above technical solution, after creating multiple SMS tasks, each base station in multiple target fence areas can be obtained. The coordinate range of each fence area can be obtained, and the coordinates of each base station can be obtained, so as to determine the base station in each target fence area. Optionally, the base station in each fence area can be determined in advance, and when storing each fence area, the information of the base station in the fence area is stored accordingly.

[0066] After the base station is determined, the big data ETL (Extract-Transform-Load) or component program can be used to perform calculation analysis to collect the phone numbers that have stayed at the base station. Optionally, the phone numbers that have stayed at the base station can be all the phone numbers that have stayed in the past, or can be the phone numbers that have stayed in a certain historical time period. The phone numbers that have stayed at the base station are the phone numbers that have stayed in the target fence area.

[0067] After obtaining each phone number, you can perform deduplication processing on each phone number to obtain multiple processed phone numbers. Create a new table in the database to cache the obtained phone numbers, and perform duplication judgment before sending group text messages to prevent the same text message content from being sent to the same phone number multiple times, causing user complaints. Because the number of phone numbers sent is often huge, exceeding 10 million, the requirements for insertion and query performance are high, so high-performance database support is required to achieve data insertion at the 10 million level and ensure that the query response speed is within 10ms, thereby improving the response speed and text message sending efficiency.

[0068] After obtaining a plurality of processed telephone numbers after deduplication processing, the SMS content corresponding to the SMS task can be sent to the plurality of processed telephone numbers.

[0069] In this way, according to the multiple SMS tasks created, it is possible to accurately send the SMS content corresponding to the SMS tasks to multiple phone numbers within multiple target fence areas.

[0070] Optionally, the SMS content corresponding to the group SMS task to the multiple processed phone numbers may be sent to the multiple processed phone numbers when the SMS sending time included in the configuration information of the SMS task is reached. Optionally, it may be detected periodically whether the SMS sending time is reached, for example, whether the SMS sending time is reached every 10 minutes.

[0071] Optionally, group-sending SMS content to multiple processed phone numbers can be done by sending the SMS content to the phone numbers through a gateway, where the gateway can process the SMS content using the telecommunications SMP protocol and can be connected to the telecommunications gateway through the Smgp protocol. Currently, the gateway has a sending rate of 40 messages per second, which is sufficient to support current business development.

[0072] Optionally, after the SMS is sent, the SMS sending result can be obtained through the Smgp protocol, and the atomic counter Incr of Redis (Remote Dictionary Server) can be used to count the number of successful and failed SMS sending.

[0073] You can create a timer for getting task results, which is executed every half hour. Every time the task result timer is executed, the recorded number of successful and failed SMS messages will be updated to the relevant information of the SMS task. This relevant information can be displayed to the user to help the user understand the current SMS sending status in a timely manner.

[0074] The following is an introduction to a method for creating multiple fence areas. The creation of fence areas, before selecting multiple target fence areas from the multiple fence areas that have been created, includes: drawing multiple candidate fence areas on a map, obtaining the coordinates and fence type of each of the candidate fence areas; verifying whether each of the candidate fence areas meets a validity condition, and determining each of the candidate fence areas that meets the validity condition as one of the multiple fence areas, wherein a candidate fence area meets the validity condition if the candidate fence area contains a base station and the base station has a telephone number.

[0075] Figure 2It is a schematic diagram of the candidate fence area created. The candidate fence area can be circular or polygonal. When the candidate fence area is circular, the candidate fence area can be drawn by marking the longitude and latitude coordinates (lon, lat) and radius (radius) of the circle. The area size judgment criteria of the circular candidate fence area are: the longitude and latitude of the center point (lon, lat) * radius (radius) = Point; Point_area_w <= Point_lon <= Point_area_e; Point_area_s <= Point_lat <= Point_area_n. Among them, Point_area_w, Point_area_e, Point_area_s and Point_area_n are the boundary coordinates of the candidate fence area.

[0076] When the candidate fence area is a polygon, the candidate fence area can be drawn by marking the coordinates of multiple points of the polygon. <point>=(lon,lat); Point(0), Point(1), Point(2)......Point(N); The size judgment criteria of the candidate fence area of ​​the polygon are: list <point>.size()>N;(N>=3);Point(0)=Point(N);List_Point_area_w<=Point_lon<=Point_area_e;List_Point_area_s<=Point_lat<=Point_area_n。 Among them, Point_area_w, Point_area_e, Point_area_s and Point_area_n are the boundary coordinates of the candidate fence area.

[0077] Optionally, after the longitude and latitude coordinates of the candidate fence area are determined, the longitude and latitude coordinates may be converted into an internationally used 84 coordinate system to ensure correct positioning of the fence position.

[0078] The validity of multiple candidate fence areas can be verified. The validity verification of the candidate fence area means verifying whether the candidate fence area meets the validity condition. A candidate fence area meets the validity condition if the candidate fence area contains a base station and the base station has a telephone number. Optionally, the number of base stations in the validity condition and the number of telephone numbers in the base station can also be set. If a candidate fence meets the validity condition, the candidate fence area can be determined as one of the multiple fence areas, and the candidate fence area determined as the fence area is stored.

[0079] Optionally, if a candidate fence area does not meet the validity condition, there is no phone number in the candidate fence area to which group text messages can be sent, and the candidate fence area is useless. The candidate fence area that does not meet the validity condition can be edited to obtain an edited fence area, wherein the edited fence area is a fence area that meets the validity condition, and the editing includes at least one or more of the following: translation and deformation. Each edited fence area is determined as one of the multiple fence areas, and the multiple fence areas are stored.

[0080] The candidate fence area that does not meet the validity condition can be edited by performing operations such as translation, deformation, and expansion on the candidate fence area, so that the edited fence area meets the validity condition.

[0081] It is understandable that, because the target fence area is determined from the candidate fence area, if the candidate fence area is verified for validity when the fence area is determined, there is no need to verify the validity of the target fence area when the target fence area is added to the cache queue.

[0082] In this way, it can be ensured that the determined fence area meets the validity condition, and the situation that there is no phone number available for group text messaging content in the created text message task can be avoided.

[0083] Optionally, based on the above technical solution, before verifying whether each candidate fence area meets the validity condition, the fence type of each candidate fence area may be obtained. The fence type of the candidate fence area may be determined in advance.

[0084] When the fence type of the candidate fence area is a non-cross-administrative area fence, determine the first administrative area to which the candidate fence area belongs; obtain the coordinate range of the first administrative area; and eliminate the coordinates in the coordinate range of the candidate fence area that do not belong to the first administrative area.

[0085] When the fence type of a candidate fence area is a non-cross-administrative area fence, it is proved that the candidate fence area exists in at most one administrative area (the first administrative area), and the first administrative area can be located by the area code of the first administrative area. Then, the coordinate system judgment is performed in the first administrative area, and the coordinates in the candidate fence area that are not in the first administrative area are discarded, leaving only the coordinates in the first administrative area.

[0086] Optionally, based on the above technical solution, when the fence type of a candidate fence area is a cross-administrative area fence, it is also possible to: determine the second administrative area to which the candidate fence area belongs; obtain a third administrative area adjacent to the second administrative area; query whether the candidate fence area overlaps with the third administrative area; and if there is an overlap, determine that the candidate fence area does not need to be corrected.

[0087] When the fence type of a candidate fence area is a cross-administrative area fence, and the candidate fence area exceeds the scope of an administrative area, the second administrative area to which the candidate fence area mainly belongs can be obtained first, and the third administrative area adjacent to the second administrative area can be cached in advance. The coordinates of the second administrative area and the third administrative area are obtained, and the coordinates of the candidate fence area are used to determine whether the candidate fence area overlaps with the third administrative area.

[0088] If the candidate fence area overlaps with the third administrative area, the candidate fence area is indeed a cross-administrative area fence, proving that the information of the candidate fence area is correct. Therefore, there is no need to correct the candidate fence area, and the candidate fence area can be determined as one of multiple fence areas.

[0089] If the candidate fence area does not overlap with the third administrative area, the candidate fence area is not a cross-administrative area fence, which proves that the information of the candidate fence area is incorrect. Therefore, the candidate fence area needs to be corrected to make the information of the candidate fence area correct.

[0090] Figure 3 It is a flow chart of creating a fence area in an embodiment of the present invention. The fence area can be drawn on the map first, and the fence type and the administrative area to which the fence area belongs can be used to determine whether to edit the fence area, thereby obtaining the fence area. After obtaining the fence area, determine whether the number of base stations in the fence area meets the requirements and satisfies the validity condition. If the validity condition is not met, edit the fence area until the fence area meets the validity condition. Step 1: Locate the area through the area code, and then make a longitude and latitude coordinate system judgment in the area, discard the coordinates that are not in the area, and only keep the fence in the area. Step 2: Store the fence area that has passed the verification so that the user can directly use the fence information in subsequent use without re-positioning on the map. Step 3: Verify whether there are base stations in the fence area, and obtain the number of base stations under the fence coordinates through the fence coordinates. If there are base stations, it means that the fence is valid.

[0091] Figure 4 Schematic diagram of the working principle of the method for creating a text message task in an embodiment of the present invention. The work platform creates N fence areas, obtains the administrative area code corresponding to each fence area, and the latitude and longitude information, so as to determine whether the information of the fence area is correct. The fence area is verified for validity and adjacency. The actual sending area under each fence area is obtained, and all base station information under each area is obtained, so as to obtain the mobile phone number that has stayed on the base station. The phone number is deduplicated, and finally a group text message is sent through the gateway. The phone numbers in the N fence areas receive the group text messages.

[0092] By adopting the scheme of the embodiment of the present invention, a multi-fence area sending scenario can be realized, which is convenient for user operation and avoids wasting time by repeated workload. Multiple fences are stored in a cache queue (Region (A), Region (B), Region (C), Region (N)), and then the fences in each region are calculated for validity and adjacency in the manner of sending a single fence across regions. The fence information of all regions that pass the calculation is cached in a new list, and multiple tasks are created by looping through the task creation, and all fences that pass the verification are cached in the system to facilitate subsequent fence creation.

[0093] Create a timer for obtaining SMS tasks, pull SMS tasks every two minutes, verify the SMS content, and after successful creation, create a new record table in the database to record each work order and the corresponding task. When multiple SMS tasks need to be created at one time, when a single SMS task is created, the SMS task will be immediately reported to the user and will not affect the creation of subsequent SMS tasks.

[0094] Create a SMS task timer to check every 10 minutes whether the task has reached the start time. When the task reaches the start time, use the coordinate information to immediately obtain the mobile phone numbers that have stayed on the base station in the area using big data ETL or component programs for calculation and analysis. After obtaining each phone number, you can deduplicate each phone number to obtain multiple processed phone numbers. Create a new table in the database to cache the obtained phone numbers, and perform a repeatability check before sending group SMS to prevent the same SMS content from being sent to the same phone number multiple times, causing user complaints. Because the number of phone numbers sent is often huge, more than 10 million, the requirements for insertion and query performance are high, so a high-performance database support is required to achieve data insertion at the 10 million level and ensure that the query response speed is within 10ms, thereby improving the response speed and SMS sending efficiency.

[0095] After the phone number analysis is completed, you can start sending SMS messages, which can be sent to the phone number through the gateway. The gateway can use the telecommunications smp protocol to process the SMS content, and can connect to the telecommunications gateway through the Smgp protocol. The current gateway sending rate is 40 messages per second, which is sufficient to support the current business development. After the SMS is sent, you can also get the SMS sending results through the Smgp protocol, and use the atomic counter Incr of Redis (Remote Dictionary Server, i.e. remote dictionary service) to count the number of successful and failed SMS messages sent. You can create a task result acquisition timer that executes every half an hour. When the task result timer is executed, the recorded number of successful and failed SMS messages will be updated to the relevant information of the SMS task. The relevant information can be displayed to the user to help the user understand the current SMS sending status in a timely manner.

[0096] It should be noted that, for the sake of simplicity, the method embodiments are described as a series of action combinations, but those skilled in the art should be aware that the embodiments of the present invention are not limited by the order of the actions described, because according to the embodiments of the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present invention.

[0097] Figure 5 is a schematic diagram of the structure of a device for creating a short message task according to an embodiment of the present invention. Figure 5 As shown, the device includes a selection module, a joining module, an acquisition module or a creation module, wherein:

[0098] A selection module is configured to select a plurality of target fence areas from a plurality of fence areas that have been created in response to a request to create a short message task;

[0099] An adding module, configured to add the plurality of target fence areas to a cache queue;

[0100] An acquisition module, configured to acquire configuration information of the SMS task;

[0101] The creation module is configured to traverse the cache queue according to the configuration information of the SMS task, and create a plurality of the SMS tasks, each of which corresponds to one target fence area.

[0102] Optionally, after creating the plurality of SMS tasks, the method further includes:

[0103] A number acquisition module is configured to acquire each telephone number that has stayed on each base station in the plurality of target fence areas;

[0104] a deduplication processing module, configured to perform deduplication processing on each of the telephone numbers to obtain a plurality of processed telephone numbers;

[0105] The group sending module is configured to group send the SMS content corresponding to the SMS task to the multiple processed phone numbers.

[0106] Optionally, the configuration information of the SMS task includes the SMS sending time and the SMS content; and the group sending module includes:

[0107] The group sending unit is configured to send the content of the short message to the multiple processed phone numbers in a group when the short message sending time arrives.

[0108] Optionally, before selecting a plurality of target fence areas from the plurality of fence areas that have been created, the method further includes:

[0109] A drawing module is configured to draw a plurality of candidate fence areas on a map and obtain the coordinates and fence type of each candidate fence area;

[0110] The verification module is configured to verify whether each of the candidate fence areas meets the validity condition, and determine each of the candidate fence areas that meets the validity condition as one of the multiple fence areas for storage. A candidate fence area that meets the validity condition means that the candidate fence area contains a base station and there is a telephone number in the base station.

[0111] Optionally, it also includes:

[0112] An editing module is configured to edit the candidate fence area that does not meet the validity condition to obtain an edited fence area, wherein the edited fence area is a fence area that meets the validity condition, and the editing includes at least one or more of the following: translation and deformation;

[0113] The determination module is configured to determine each of the edited fence areas as one of the multiple fence areas and store the multiple fence areas.

[0114] Optionally, before verifying whether each of the candidate fence areas meets the validity condition, the method further includes:

[0115] A type acquisition module, configured to acquire the fence type of each candidate fence area;

[0116] A first region determination module is configured to determine, when the fence type of the candidate fence region is a non-cross-administrative region fence, a first administrative region to which the candidate fence region belongs;

[0117] A range acquisition module, configured to acquire a coordinate range of the first administrative area;

[0118] The elimination module is configured to eliminate the coordinates in the candidate fence area that are within a coordinate range that does not belong to the first administrative area.

[0119] Optionally, when the fence type of the candidate fence area is a cross-administrative area fence, the method further includes:

[0120] A second area determination module is configured to determine a second administrative area to which the candidate fence area belongs;

[0121] A third region determining module, configured to obtain a third administrative region adjacent to the second administrative region;

[0122] A query module is configured to query whether the candidate fence area overlaps with the third administrative area;

[0123] The correction determination module is configured to determine that the candidate fence area does not need to be corrected when there is overlap.

[0124] It should be noted that the device embodiment is similar to the method embodiment, so the description is relatively simple, and the relevant parts can be referred to the method embodiment.

[0125] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0126] It will be appreciated by those skilled in the art that the embodiments of the present invention may be provided as methods, devices or computer program products. Therefore, the embodiments of the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0127] The embodiments of the present invention are described with reference to the flowcharts and / or block diagrams of the methods, apparatuses, electronic devices, and computer program products according to the embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0128] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0129] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0130] Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present invention.

[0131] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or terminal device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or terminal device. In the absence of further restrictions, the elements defined by the sentence "including a..." do not exclude the existence of other identical elements in the process, method, article or terminal device including the elements.

[0132] The above is a detailed introduction to the method, device, electronic device and storage medium for creating a text message task provided by the present invention. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.< / point> < / point>

Claims

1. A method for creating a text message task, characterized in that: include: In response to a request to create a short message task, selecting multiple target fence areas from multiple fence areas that have been created; Adding the multiple target fence areas to a cache queue; Obtain configuration information of the SMS task; According to the configuration information of the SMS task, traverse the cache queue and create a plurality of the SMS tasks, each of which corresponds to one of the target fence areas; The multiple fence areas include: multiple candidate fence areas, and the multiple candidate fence areas are obtained by the following steps: Draw a plurality of candidate fence areas on a map, and obtain the coordinates and fence type of each candidate fence area; For each of the candidate fence areas, when the fence type of the candidate fence area is a non-cross-administrative area fence, determine the first administrative area to which the candidate fence area belongs, obtain the coordinate range of the first administrative area, and remove the coordinates in the coordinate range of the candidate fence area that do not belong to the first administrative area; For each of the candidate fence areas, when the fence type of the candidate fence area is a cross-administrative area fence, determine the second administrative area to which the candidate fence area belongs, obtain the third administrative area adjacent to the second administrative area, query whether the candidate fence area overlaps with the third administrative area, and if there is an overlap, determine that the candidate fence area does not need to be corrected.

2. The method according to claim 1, characterized in that After creating the plurality of SMS tasks, the method further includes: Acquire each telephone number that has stayed on each base station in the plurality of target fence areas; Deduplication processing is performed on each of the telephone numbers to obtain a plurality of processed telephone numbers; The SMS content corresponding to the SMS task is sent to the multiple processed telephone numbers.

3. The method according to claim 2, characterized in that The configuration information of the SMS task includes the SMS sending time and the SMS content; the group sending of SMS corresponding to the SMS task to the multiple processed phone numbers includes: When the SMS sending time arrives, the SMS content is group-sent to the multiple processed phone numbers.

4. The method according to claim 1, characterized in that: Before selecting a plurality of target fence areas from the plurality of fence areas that have been created, the method further includes: Verify whether each of the candidate fence areas meets the validity condition, and determine each of the candidate fence areas that meets the validity condition as one of the multiple fence areas for storage. A candidate fence area that meets the validity condition means that the candidate fence area contains a base station and there is a telephone number in the base station.

5. The method according to claim 4, characterized in that Also includes: Editing the candidate fence area that does not meet the validity condition to obtain an edited fence area, wherein the edited fence area is a fence area that meets the validity condition, and the editing includes at least one or more of the following: translation and deformation; Each of the edited fence areas is determined as one of the multiple fence areas, and the multiple fence areas are stored.

6. A device for creating a short message task, characterized in that: include: A selection module is configured to select a plurality of target fence areas from a plurality of fence areas that have been created in response to a request to create a short message task; An adding module, configured to add the plurality of target fence areas to a cache queue; An acquisition module, configured to acquire configuration information of the SMS task; A creation module is configured to traverse the cache queue according to the configuration information of the SMS task, and create a plurality of the SMS tasks, each of which corresponds to one of the target fence areas; The multiple fence areas include: multiple candidate fence areas; the device also includes: A drawing module is configured to draw a plurality of candidate fence areas on a map and obtain the coordinates and fence type of each candidate fence area; A type acquisition module, configured to acquire the fence type of each candidate fence area; A first region determination module is configured to determine, when the fence type of the candidate fence region is a non-cross-administrative region fence, a first administrative region to which the candidate fence region belongs; A range acquisition module, configured to acquire a coordinate range of the first administrative area; A removal module is configured to remove coordinates in the candidate fence area that are within a coordinate range that does not belong to the first administrative area; A second region determination module is configured to determine the second administrative region to which the candidate fence region belongs when the fence type of the candidate fence region is a cross-administrative region fence; A third region determining module is configured to obtain a third administrative region adjacent to the second administrative region; A query module is configured to query whether the candidate fence area overlaps with the third administrative area; The correction determination module is configured to determine that the candidate fence area does not need to be corrected when there is overlap.

7. An electronic device, characterized in that: include: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement the method for creating a text message task as described in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that: When the instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device is enabled to execute the method for creating a text message task as described in any one of claims 1 to 5.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method for creating a text message task as claimed in any one of claims 1 to 5 is implemented.

Images