Schedule reminding method and device, equipment, storage medium and program product

Abstract

The invention provides a schedule reminding method and device, equipment, a storage medium and a program product, and relates to the field of financial science and technology or other related fields, and the method comprises the steps: determining a target push terminal of first schedule information according to the participation user information of a target schedule in the first schedule information; determining a schedule type of the target schedule, and determining a to-be-jumped function interface corresponding to the target schedule according to the schedule type; generating an access link of the to-be-jumped function interface; adding the access link to the first schedule information to generate updated schedule information; and pushing the updated schedule information to the target pushing terminal. According to the method provided by the invention, the operation burden of the user can be reduced, and the schedule processing instantaneity and convenience are improved.

Description

Technical Field

[0001] This application relates to the field of financial technology or other related fields, and in particular to a method, device, equipment, storage medium and program product for scheduling reminders. Background Technology

[0002] In large enterprises such as banks, employees have to handle a large number of daily schedules such as meetings, business trips, and deadlines. Reliable schedule reminders not only help with personal time management, but also reduce the number of key activities (such as important meetings or approval deadlines) that employees miss, thereby improving the overall work efficiency of the enterprise.

[0003] Currently, common schedule reminder technologies mainly rely on basic notification systems, such as sending text reminder messages through enterprise OA platforms, email, or instant messaging tools. In practice, the system usually triggers notifications based on preset schedule time thresholds, pushing basic information (such as event subject and time) to the user's terminal in the form of simple text.

[0004] However, traditional calendar reminder technology only provides notifications. After receiving the notification, users must perform multiple manual steps (such as switching apps, entering verification information, or navigating to the function interface), which makes the operation cumbersome and easy to miss key events. Summary of the Invention

[0005] This application provides a schedule reminder method, apparatus, device, storage medium, and program product to solve the technical problem that traditional schedule reminders only provide notifications, requiring users to manually open the relevant application to handle the schedule, resulting in cumbersome operation and easy to miss key events.

[0006] In a first aspect, this application provides a schedule reminder method, the method comprising:

[0007] Based on the participating user information of the target schedule in the first schedule information, determine the target push terminal of the first schedule information;

[0008] Determine the schedule type of the target schedule, and based on the schedule type, determine the corresponding function interface to be redirected to;

[0009] Generate the access link for the function interface to be redirected to;

[0010] Add the access link to the first schedule information to generate the updated schedule information;

[0011] The updated schedule information is pushed to the target push terminal.

[0012] Secondly, this application provides a schedule reminder device, the device comprising:

[0013] The terminal determination module is used to determine the target push terminal of the first schedule information based on the participating user information of the target schedule in the first schedule information.

[0014] The interface determination module is used to determine the schedule type of the target schedule and, based on the schedule type, determine the corresponding functional interface to be redirected to.

[0015] The link generation module is used to generate access links for the functional interface to be redirected to.

[0016] The push module is used to add the access link to the first schedule information and generate updated schedule information;

[0017] The updated schedule information is pushed to the target push terminal.

[0018] Thirdly, this application provides an electronic device, including: a processor, and a memory communicatively connected to the processor;

[0019] The memory stores computer-executed instructions;

[0020] The processor executes computer execution instructions stored in the memory to implement the method as described in the first aspect.

[0021] Fourthly, this application provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, are used to implement the method described in the first aspect.

[0022] Fifthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the method described in the first aspect.

[0023] The schedule reminder method, device, equipment, storage medium, and program product provided in this application have the following technical effects:

[0024] This method can dynamically determine the corresponding functional interface based on the type of schedule and automatically generate access links. After receiving the schedule information reminder, participating users can directly click the link to jump to the relevant functional interface without having to manually search or switch applications. This simplifies the multiple steps that participating users originally needed to take into one step, reducing the user's operational burden and improving the immediacy and convenience of schedule processing. Attached Figure Description

[0025] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0026] Figure 1Flowchart of the schedule reminder method provided in the embodiments of this application Figure 1 ;

[0027] Figure 2 Flowchart of the schedule reminder method provided in the embodiments of this application Figure 2 ;

[0028] Figure 3 This is a schematic diagram of the method for generating an updated participation time period provided in an embodiment of this application;

[0029] Figure 4 A schematic diagram of the structure of the schedule reminder device provided in the embodiments of this application;

[0030] Figure 5 This is a schematic diagram of the electronic device structure provided in an embodiment of this application.

[0031] The accompanying drawings illustrate specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to particular embodiments. Detailed Implementation

[0032] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0033] It should be noted that the schedule reminder method, device, equipment, storage medium and program product provided in this application can be used in the fintech field, or in any field other than fintech. The application field of the schedule reminder method, device, equipment, storage medium and program product in this application is not limited.

[0034] First, the terms used in the embodiments of this application will be explained:

[0035] Structured field extraction from text (SFA) is a core capability of large language models (LLMs). Leveraging the deep understanding and pattern recognition capabilities of large models of natural language, it automatically identifies, parses, and extracts predefined key information fragments (such as time, location, people, event topics, and task descriptions) from unstructured raw text (such as email bodies, chat logs, and meeting minutes). This information is then accurately populated into structured data fields or templates (such as titles, times, locations, participants, and notes for schedule events) in the target application. Its core function is to efficiently and accurately transform free text into computer-processable structured data, thereby achieving intelligent information filling and process automation, significantly improving user experience and work efficiency.

[0036] DMQS (Distributed Message Queue Service) is a message middleware technology based on a distributed architecture. It achieves highly reliable, low-latency cross-system data transmission by decoupling producers and consumers, asynchronous communication, traffic shaping, and message persistence mechanisms. Its core is building horizontally scalable message storage and forwarding pipelines to ensure eventual consistency and disaster recovery capabilities in inter-service communication within a distributed environment. Typical applications include scenarios such as second-level delivery of schedule reminders and inter-system event synchronization.

[0037] Large-scale intent recognition is a core task in Natural Language Processing (NLP), aiming to determine the underlying goals, needs, or action intentions expressed by user input (such as queries, commands, and statements). For example, if a user says "book a flight to Beijing tomorrow," their intent is "to book a flight."

[0038] Traditional schedule reminders only provide schedule notifications. For example, for meeting-type schedules, users need to manually open the relevant meeting application to handle the schedule, which leads to cumbersome operation and the risk of missing key events. The inventors considered that a link to the corresponding function interface of the schedule could be added to the schedule notification. For example, for meeting-type schedules, a link to the meeting in the meeting application could be added to the schedule notification. This way, after receiving the schedule notification, participants can click the link to jump to the corresponding function interface, solving the problems of cumbersome operation and the risk of missing key events in the existing technology.

[0039] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will be described below with reference to the accompanying drawings.

[0040] Example 1

[0041] Figure 1 Flowchart of the schedule reminder method provided in the embodiments of this application Figure 1 This method can be applied to servers, such as... Figure 1 As shown, the method includes:

[0042] S101. Based on the participating user information of the target schedule in the first schedule information, determine the target push terminal of the first schedule information;

[0043] Specifically, users can create their first schedule information in the following ways:

[0044] 1. When a user forwards an email containing schedule information to a designated public email address, the server can leverage the natural language processing capabilities of a large language model to perform deep parsing of the email body. It can then use its text structured field extraction capabilities to identify and extract predefined key fields, including start time, end time, participating users, schedule type (e.g., meeting, business trip), and event content. For example, the large language model uses pattern recognition algorithms to parse time expressions (such as "tomorrow afternoon at 3 PM") in the email and maps them to a standard timestamp. Simultaneously, it uses named entity recognition technology to extract participating user names, schedule type, and event content. After parsing, the server can automatically populate these fields into the schedule creation template. For schedules created via email, the server can use "created via email" as the schedule type and store the email ID, ultimately generating the corresponding schedule data as the primary schedule information.

[0045] 2. When a user switches to the schedule creation interface from an email, meeting card, or instant messaging scenario, the server can automatically retrieve the context information of the previous scenario. For example, when switching from an email scenario, the server can obtain the email's metadata (such as sending time, recipient list, and subject) through the API interface, and use the rule engine to filter out the schedule-related fields (such as schedule type, time, and location) and fill this information into the corresponding fields of the schedule form. The user only needs to confirm or make minor adjustments, thus creating the first schedule information conveniently and quickly.

[0046] Third, users can interact with the AI ​​big data model through natural language. For example, a user can type "Schedule a project review meeting for me tomorrow afternoon." The server first calls the big data model, which uses its intent recognition capabilities to analyze the user's statement for its underlying purpose (e.g., recognizing "schedule a meeting" as the core intent). Then, a multi-turn dialogue engine collects necessary parameters: the model uses pre-configured prompts to guide the user to fill in missing information (e.g., "What is the meeting topic and who are the participants?"). After collecting all the information, the big data model generates structured schedule data and submits it, thus forming the first schedule information.

[0047] After obtaining the first schedule information, since the participating user information has been filled in during the creation phase, the server can extract the participating user information of the target schedule from the first schedule information, and verify the participating user status (such as whether they are employed or have permissions).

[0048] Furthermore, for each participating user, the server can obtain their registered terminals, which can be, for example, smartphones, tablets, desktop computers, etc., without specific limitations in this application. For each user's registered terminals, the server can select the most recently active terminal based on the login timestamp and determine the most recently active terminal as the target push terminal.

[0049] S102. Determine the schedule type of the target schedule, and based on the schedule type, determine the corresponding function interface to be redirected to;

[0050] During the initial schedule information creation phase, the schedule information may include fields for schedule type, such as "meeting," "business trip," or "created via email." The server parses these fields to determine the schedule type of the target schedule.

[0051] Furthermore, the server can determine the interface to be redirected to based on the schedule type. For example, for a target schedule of the meeting type, the server can obtain the meeting ID from the first schedule information and determine the meeting application interface identified by the meeting ID as the interface to be redirected to. For schedule types created via email, the server can extract the email ID and use the email page that created the target schedule in the email application as the interface to be redirected to.

[0052] S103. Generate access links for the functional interfaces to be redirected to;

[0053] In this step, the server first obtains the basic access address that leads to the desired interface, such as the API endpoint of a conferencing application or the query interface of an email application. Then, it extracts contextual parameters from the initial schedule information, such as the meeting ID and email ID, and combines them with the aforementioned basic access address to form the access link.

[0054] S104. Add the access link to the first schedule information and generate the updated schedule information;

[0055] In this step, the server can add the access link generated by S103 to a specific field in the first schedule information, such as "Operation Link", thereby forming the updated schedule information.

[0056] S105. Push the updated schedule information to the target push terminal.

[0057] In this step, DMQS distributed message queue service can be used for asynchronous push. Updated schedule information can be persistently stored first, and then pushed by the message middleware according to the terminal type, such as sending it to the mobile phone through the APP push channel, or sending it to the computer through the WebSocket network transmission protocol (a network technology for full-duplex communication between browser and server). When there are a large number of first schedule information that need to be pushed at the same time (such as meeting reminders during peak commuting hours), the first schedule information to be pushed can be stored in the DMQS message queue first, and the message queue can use a first-in-first-out (FIFO) method to push the first schedule information.

[0058] The schedule reminder method provided in this embodiment has the following technical effects:

[0059] This method can dynamically determine the corresponding functional interface based on the type of schedule and automatically generate access links. After receiving the schedule information reminder, participating users can directly click the link to jump to the relevant functional interface without having to manually search or switch applications. This simplifies the multiple steps that participating users originally needed to take into one step, reducing the user's operational burden and improving the immediacy and convenience of schedule processing.

[0060] Example 2

[0061] Figure 2 Flowchart of the schedule reminder method provided in the embodiments of this application Figure 2 ,like Figure 2 As shown, the method includes:

[0062] S201. Obtain the participating user information input by the user who created the schedule, and the participation time period information of the target schedule;

[0063] In this step, users can interact with the AI ​​big model through natural language dialogue. The server uses the big model's intent recognition technology to parse the user's statement and extract the participating user information (such as identifying "Zhang San" and "Li Si" from "Please invite Zhang San and Li Si") and the participation time period (such as "Tomorrow afternoon from 2 pm to 4 pm"). Users can also fill out a form and submit it, so that the server can obtain the participating user information and the participation time period information of the target schedule by parsing the form.

[0064] S202. Based on the participating user information, determine the participating users of the target schedule, and based on the participating time period information, determine the participating time period of the target schedule;

[0065] In this step, the server can use the participating user information to query the user database and determine the unique user identifier (such as employee ID) of the participating user.

[0066] For participating time period information, the server can use a time parsing engine to convert natural language time expressions (such as "next Monday afternoon") into standard timestamp intervals (start time and end time).

[0067] S203. Obtain the second schedule information of the participating user during the participation period. The second schedule information is used to indicate whether the participating user has any schedule to participate in during the participation period.

[0068] Specifically, the server can query the database that stores schedule information to retrieve all existing schedule events for each participating user within a specified participation period, i.e., the second schedule information.

[0069] S204. Based on the second schedule information, determine whether each participating user is in an idle state during the participation period;

[0070] In this step, the server can perform conflict detection. Specifically, it can perform time interval overlap analysis between the target schedule's participation time period and each participating user's existing schedule time period to check for any time overlap. If none of the participating users' existing schedules overlap with the target time period, then the system is determined to be in an idle state.

[0071] If each participating user is idle during the participation period, then execute S205;

[0072] If at least one participating user is not idle during the participation period, then execute S206;

[0073] S205. Generate the first schedule information based on the participating user information and the participation time period;

[0074] If each participating user is idle during the participation period, the server can generate the first schedule information by generating a unique schedule ID for the target schedule and filling in fields (such as topic, list of participants, and participation period).

[0075] S206. Update the participation time period to generate an updated participation time period. During the updated participation time period, each user is in an idle state.

[0076] This step can update the participation time period based on a sliding window strategy. For example, starting from the original participation time period, the time window can be slid forward or backward (e.g., in 30-minute increments) to re-query the busy / idle status of participating users. After each slide, the conflict detection in steps S203-S204 is repeated until the first time period where all users are idle is found. This sliding window strategy can prioritize times adjacent to the original time period, thereby reducing the adjustment range of the original participation time period.

[0077] S207. Generate the first schedule information based on the participating user information and the updated participation time period;

[0078] In this step, the server can generate the first schedule information by generating a unique schedule ID for the target schedule and filling in fields such as topic, participant list, and updated participation time period.

[0079] S208. Based on the participating user information of the target schedule in the first schedule information, determine the target push terminal of the first schedule information;

[0080] This step can be referred to in the aforementioned embodiments, and will not be repeated here.

[0081] S209. Determine the schedule type of the target schedule, and based on the schedule type, query the preset mapping rule table to determine the functional interface type corresponding to the schedule type. The mapping rule table is used to indicate the correspondence between schedule types and functional interface types.

[0082] In this step, the server can analyze the subject keywords or category fields of the first schedule information to identify the schedule type, such as "meeting," "business trip," or "leave." Then, the server can query the mapping rule table in memory—this table is pre-configured with the correspondence between schedule types and functional interface types. For example, the "meeting" type is mapped to the "video conferencing interface," and the "business trip" type is mapped to the "travel approval interface."

[0083] S210. Based on the functional interface type, determine the identification information that matches the functional interface type in the associated information of the first schedule information. The identification information is used to identify the functional interface to be jumped to.

[0084] In this step, based on the functional interface type determined in S209, the server can extract the corresponding identification information from the associated information of the schedule. For example, for the "Meeting" type, the identification information might be the meeting ID or room number; for "Email-generated Schedule," the identification information is the original email ID. It should be noted that the associated information is metadata or a set of additional data associated with the first schedule information, used to describe the schedule's source, context, or extended attributes. For example, it may include the following categories:

[0085] Source system identification information: If the schedule is generated through intelligent recognition, the associated information will include the identifier of the original source. For example, when the schedule is created via email forwarding, the associated information may include the unique ID of the original email (such as the email message ID); when the schedule is created via a conversation or message scenario, the associated information may include the chat session ID or message hash value.

[0086] Function-related identification information: Depending on the schedule type, the associated information can store key identifiers that match specific function interfaces. For example, for the "meeting" type, the associated information may include the video conferencing room number of the meeting application, the meeting agenda ID, etc.; for the "business trip" type, the associated information may include the travel approval number or the financial system association code; for the "leave" type, the associated information may include the leave record ID.

[0087] S211. Obtain the link template corresponding to the functional interface type, insert the identification information into the link template, and generate the access link.

[0088] In this step, the server can pre-store URL templates for various functional interface types. For example, the video conferencing link template is https: / / meet.com / join?room={ID}. As you can see, this template only requires filling in the meeting ID in the ID placeholder to generate the access link. Therefore, the server can use string replacement operations to insert the identification information of S210 (such as the meeting ID) into the template placeholder to generate a complete access link.

[0089] S212. Add the access link to the first schedule information, generate the updated schedule information, and push the updated schedule information to the target push terminal.

[0090] This step can be referred to in the foregoing embodiments, and will not be repeated here.

[0091] Figure 2 The method shown, S201-S205, automatically detects whether there is a conflict between the current participation time of the schedule and the existing schedules of the participants. This avoids the tedious communication in the traditional schedule creation stage and prevents participants from being unable to participate in the currently created schedule due to existing schedules.

[0092] Steps S206-S207 automatically update the original participation time slots to generate updated time slots, ensuring that all participating users are idle during the updated participation time slots. This eliminates the need for the schedule creator to communicate with each participant individually and manually arrange complex schedule time slots, thus improving the schedule creator's work efficiency.

[0093] S209 determines the type of functional interface by using a rule table for standardized mapping, ensuring that the generated access links accurately match the schedule type. Furthermore, in practical applications, the generated access links can be easily and quickly adjusted by modifying this rule table to meet the diverse needs of enterprise schedules.

[0094] By extracting relevant identifier information based on the type of functional interface, S210 can accurately identify the identifier information of the interface to be navigated to when multiple identifier information exists in the schedule information.

[0095] S211 uses link templates to generate access links, and these templates can be updated independently according to changes in the application environment without modifying the code, thus offering high flexibility.

[0096] Figure 3 This is a schematic diagram of the method for generating updated participation time periods provided in an embodiment of this application, such as... Figure 3 As shown, the method includes:

[0097] S301. Obtain the schedule information for each participating user;

[0098] In this step, the server can send batch query requests to the database storing schedule information to retrieve all scheduled events for each participating user within the current participation time of the target schedule. That is, the scheduled events for each participating user, such as meetings or business trips. After processing the query requests, the database returns the scheduled events for each participating user, which may include fields such as the event's ID, topic, start time, and end time.

[0099] S302. Based on the schedule information to be participated in, determine the available time slots for each participating user;

[0100] In this step, the server can process the schedule information to be participated in obtained by S301. For example, it can convert the schedule list to be participated in by each user into a set of time intervals (it should be noted that each time interval includes the start time and the end time). For example, if user A has a meeting from 14:00 to 15:00 in the target time period, then the interval is [14:00, 15:00].

[0101] Furthermore, the server first sorts each user's schedule intervals by start time and merges overlapping or adjacent intervals (e.g., [14:00, 15:00] and [15:00, 16:00] are merged into [14:00, 16:00]) to reduce redundancy. Then, starting from the start point of the currently participating time period, the server traverses the merged schedule interval sequence to deduce the free intervals. For example, if the target time period is [09:00, 18:00] and the user's schedule intervals are [10:00, 12:00] and [14:00, 16:00], then the free intervals are [09:00, 10:00], [12:00, 14:00], and [16:00, 18:00].

[0102] S303. Determine the updated participation time period based on the idle time period of each participating user.

[0103] In this step, the server can first take the list of available time slots of the first user as the initial candidate for intersection, and then find the intersection with the lists of other users in turn. For example, if user A's available time slots are [09:00, 10:00] and [12:00, 14:00], and user B's available time slots are [13:00, 15:00], then the intersection is [13:00, 14:00].

[0104] It should be noted that since the above intersection operation may generate multiple candidate time periods, the server can prioritize the time period that is long enough and closest to the original target time period. For example, if the original time period is in the afternoon, then the afternoon time period will be selected first.

[0105] Figure 3 The method shown avoids the multiple calculations and queries required by the sliding time window algorithm by determining the idle time period of each participating user and then calculating the intersection of the idle time periods, thereby reducing computational resource and time overhead.

[0106] Figure 4 This is a schematic diagram of the structure of the schedule reminder device provided in the embodiments of this application, such as... Figure 4 As shown, the device 40 includes:

[0107] Terminal determination module 401 is used to determine the target push terminal of the first schedule information based on the participating user information of the target schedule in the first schedule information.

[0108] The interface determination module 402 is used to determine the schedule type of the target schedule and, based on the schedule type, determine the corresponding function interface to be redirected to.

[0109] Link generation module 403 is used to generate access links for the functional interfaces to be navigated to;

[0110] The push module 404 is used to add the access link to the first schedule information and generate the updated schedule information.

[0111] The updated schedule information will be pushed to the target push terminal.

[0112] Figure 5 This is a schematic diagram of the electronic device structure provided in the embodiments of this application, such as... Figure 5 As shown, the device 50 includes at least one processor 501 and a memory 502. Optionally, the device 50 also includes a communication component 503. The processor 501, memory 502, and communication component 503 are connected via a bus 504.

[0113] In a specific implementation, at least one processor 501 executes computer execution instructions stored in memory 502, causing at least one processor 501 to perform the above-described method.

[0114] The specific implementation process of processor 501 can be found in the above method embodiments, and its implementation principle and technical effect are similar. It will not be repeated here.

[0115] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above-described method.

[0116] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.

[0117] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily essential to this application.

[0118] It should be further noted that although the steps in the flowchart are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowchart may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the sub-steps or stages of other steps.

[0119] It should be understood that the above-described device embodiments are merely illustrative, and the device of this application can also be implemented in other ways. For example, the division of units / modules in the above embodiments is only a logical functional division, and there may be other division methods in actual implementation. For example, multiple units, modules, or components may be combined, or integrated into another system, or some features may be ignored or not executed.

[0120] Furthermore, unless otherwise specified, the functional units / modules in the various embodiments of this application can be integrated into one unit / module, or each unit / module can exist physically separately, or two or more units / modules can be integrated together. The integrated units / modules described above can be implemented in hardware or as software program modules.

[0121] When integrated units / modules are implemented in hardware, the hardware can be digital circuits, analog circuits, etc. The physical implementation of the hardware structure includes, but is not limited to, transistors, memristors, etc. Unless otherwise specified, the processor can be any suitable hardware processor, such as a CPU, GPU, FPGA, DSP, and ASIC, etc. Unless otherwise specified, the storage unit can be any suitable magnetic or magneto-optical storage medium, such as Resistive Random Access Memory (RRAM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), Enhanced Dynamic Random Access Memory (EDRAM), High-Bandwidth Memory (HBM), Hybrid Memory Cube (HMC), etc.

[0122] If the integrated unit / module is implemented as a software program module and sold or used as an independent product, it can be stored in a computer-readable storage device (CMD). Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned memory includes various media capable of storing program code, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard drive, magnetic disk, or optical disk.

[0123] In the above embodiments, the descriptions of each embodiment have their own emphasis. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments. The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as the combination of these technical features does not contradict each other, it should be considered within the scope of this specification.

[0124] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this application are indicated by the following claims.

[0125] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of this application is limited only by the appended claims.

Claims

1. A schedule reminder method, characterized in that, The method includes: Based on the participating user information of the target schedule in the first schedule information, determine the target push terminal of the first schedule information; Determine the schedule type of the target schedule, and based on the schedule type, determine the corresponding function interface to be redirected to; Generate the access link for the function interface to be redirected to; Add the access link to the first schedule information to generate the updated schedule information; The updated schedule information is pushed to the target push terminal.

2. The method according to claim 1, characterized in that, The step of determining the corresponding function interface to be redirected to based on the schedule type includes: Based on the schedule type, a preset mapping rule table is queried to determine the functional interface type corresponding to the schedule type. The mapping rule table is used to indicate the correspondence between the schedule type and the functional interface type. Based on the aforementioned functional interface type, the functional interface to be navigated to is determined.

3. The method according to claim 2, characterized in that, The step of determining the function interface to be navigated to based on the function interface type includes: Based on the functional interface type, identification information matching the functional interface type is determined in the associated information of the first schedule information. The identification information is used to identify the functional interface to be navigated to.

4. The method according to claim 3, characterized in that, The process of generating the access link for the function interface to be redirected includes: Obtain the link template corresponding to the aforementioned functional interface type; The identification information is inserted into the link template to generate the access link.

5. The method according to claim 1, characterized in that, Before determining the target push terminal for the first schedule information based on the participating user information of the target schedule in the first schedule information, the method further includes: Obtain the participating user information input by the user who created the schedule, and the participation time period information of the target schedule; Based on the participating user information, determine the participating users of the target schedule, and based on the participating time period information, determine the participating time period of the target schedule; Obtain the second schedule information of the participating user during the participation period, wherein the second schedule information is used to indicate whether the participating user has any scheduled activities to participate in during the participation period; Based on the second schedule information, determine whether each participating user is in an idle state during the participation period; If each participating user is idle during the participation period, the first schedule information is generated based on the participating user information and the participation period.

6. The method according to claim 5, characterized in that, After determining, based on the second schedule information, whether each participating user is in an idle state during the participation period, the method further includes: If at least one of the participating users is not in an idle state during the participation period, the participation period is updated to generate an updated participation period, during which each user is in an idle state. The first schedule information is generated based on the participating user information and the updated participation time period.

7. The method according to claim 6, characterized in that, The step of updating the participation time period to generate an updated participation time period includes: Obtain the schedule information for each participating user; Based on the schedule information to be participated in, determine the available time slots for each participating user; The updated participation time period is determined based on the idle time period of each participating user.

8. A schedule reminder device, characterized in that, The device includes: The terminal determination module is used to determine the target push terminal of the first schedule information based on the participating user information of the target schedule in the first schedule information. The interface determination module is used to determine the schedule type of the target schedule and, based on the schedule type, determine the corresponding functional interface to be redirected to. The link generation module is used to generate access links for the functional interface to be redirected to. The push module is used to add the access link to the first schedule information and generate updated schedule information; The updated schedule information is pushed to the target push terminal.

9. An electronic device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1 to 7.

11. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method as described in any one of claims 1 to 7.

Images