Cache updating method and device, medium and electronic equipment

Abstract

The invention provides a cache updating method and device, a medium and electronic equipment, and relates to the technical field of cache updating, and the method comprises the steps: obtaining a digital tag corresponding to a target task in response to the detection that the target task is executed; if the corresponding digital tag when the executed server executes the target task is smaller than the corresponding target digital tag of the target task in the cache of the to-be-updated server, obtaining a to-be-updated plan time period corresponding to the to-be-updated server; acquiring a key plan task list W corresponding to the to-be-updated server in the to-be-updated plan time period; and controlling the to-be-updated server to call the digital label of each corresponding scheduled task from each to-be-updated data source so as to update the digital label of each scheduled task on the display interface corresponding to each to-be-updated server. According to the invention, more choices of travel time are provided for the user and other subsequent users, and accurate prices are provided for the corresponding airline tickets at the same time. And the user experience is improved.

Description

Background Art

[0002] With the rapid development of Internet technology, online flight ticket reservation has become the main way for people to book flight tickets when traveling. Nowadays, numerous flight ticket reservation platforms have emerged like mushrooms after a spring rain, providing users with rich choices. In such a highly competitive market environment, when making flight ticket reservations, in order to obtain the most favorable price, users often compare prices on multiple platforms. To improve the user experience and reduce the waiting time for users, each flight ticket reservation platform usually adopts caching technology to store flight ticket-related data. The caching technology can quickly respond to users' query requests, enabling users to obtain information such as flight ticket prices and flight schedules within a short time. However, this caching mechanism also brings a series of problems.

[0003] Since flight ticket prices are affected by multiple factors, such as the remaining number of seats on the flight, peak and off-peak travel seasons, airline promotion activities, etc., the prices change frequently in real time. If a flight ticket reservation platform fails to update the cached data in a timely manner, it may lead to a deviation between the price data in the cache and the actual price. When a user queries flight tickets before making a reservation, it is very likely that the price obtained on this platform is higher than that on other platforms that have been updated in a timely manner.

[0004] This price difference has a significant impact on users' decisions. Driven by the consumption psychology of pursuing cost-effectiveness, users are more inclined to choose a platform with a lower price for reservation. Therefore, a platform that fails to update the cached data in a timely manner is likely to cause the loss of users, which not only damages the commercial interests of the platform but also reduces the competitiveness of the platform in the market. How to ensure the timely update of the cached data of the flight ticket reservation platform and avoid the loss of users due to price differences has become an important technical problem that needs to be solved urgently. Summary of the Invention

[0005] In view of the above technical problems, the present application provides a caching update method, device, medium, and electronic device, which at least partially solve the problems existing in the prior art.

[0006] In the first aspect of the present application, a caching update method is provided, and the method includes the following steps:

[0007] S100. In response to detecting that a target task has been executed, obtain a digital tag corresponding to the target task. Here, the target task has a corresponding executed server, where the executed server is one of multiple executable servers corresponding to the target task. The target task has a corresponding digital tag on each executable server. The target task also has a corresponding target planned execution time, target planned execution route, and target data source. The digital tag corresponding to the target task on each executable server is provided by the target data source corresponding to the target task. Each executable server has a corresponding multiple planned tasks, and the target task is a planned task executed by the executed server among the corresponding multiple planned tasks.

[0008] S200. If the digital tag corresponding to the target task when the executed server executes the target task is less than the target digital tag corresponding to the target task in the cache of the server to be updated, obtain the planned time period to be updated corresponding to the server to be updated. Here, the server to be updated is any executable server different from the executed server. The target planned execution time is the middle time point within the planned time period to be updated.

[0009] S300. Obtain the list of key planned tasks W=(W1, W2, …, W i , …, W n ) corresponding to the server to be updated within the planned time period to be updated, where i = 1, 2, …, n. Here, n is the number of key planned tasks corresponding to the planned time period to be updated. W i is the task identifier corresponding to the i-th key planned task within the planned time period to be updated. The planned execution route of the key planned task is the same as that of the target task, the planned execution time of the key planned task is different from that of the target task, and the planned execution time of the key planned task is within the planned time period to be updated. The digital tag corresponding to the key planned task in the cache of the server to be updated is greater than the digital tag corresponding to the target task when the executed server executes the target task. The key planned task has a corresponding key data source.

[0010] S400. Control the server to be updated to retrieve the digital tag of each planned task corresponding to each data source to be updated, so as to update the digital tag of each planned task on the display interface corresponding to each server to be updated. Here, the data sources to be updated include the target data source and each key data source.

[0011] In the second aspect of the present application, there is provided a cache update device, and the device includes:

[0012] A label acquisition unit, configured to acquire a digital label corresponding to a target task in response to detecting that the target task has been executed; wherein, the target task has a corresponding executed server; the executed server is one of multiple executable servers corresponding to the target task; the target task has a corresponding digital label on each executable server; the target task also has a corresponding target planned execution time, target planned execution route, and target data source; the digital label corresponding to the target task on each executable server is provided by the target data source corresponding to the target task; each executable server has a corresponding multiple planned tasks; the target task is a planned task executed by the executed server among the corresponding multiple planned tasks.

[0013] A time period determination unit, configured to, if the digital label corresponding to the executed server when executing the target task is less than the target digital label corresponding to the target task in the cache of the server to be updated, acquire the planned time period to be updated corresponding to the server to be updated; wherein, the server to be updated is any executable server different from the executed server; the target planned execution time is the intermediate time point within the planned time period to be updated.

[0014] A task list acquisition unit, configured to acquire the critical planned task list W=(W1, W2,..., W i ,..., W n ) corresponding to the server to be updated within the planned time period to be updated; i = 1, 2,..., n; wherein, n is the number of critical planned tasks corresponding to the planned time period to be updated; W i is the task identifier corresponding to the i-th critical planned task within the planned time period to be updated; the planned execution route of the critical planned task is the same as that of the target task, the planned execution time of the critical planned task is different from that of the target task, and the planned execution time of the critical planned task is within the planned time period to be updated; the digital label corresponding to the critical planned task in the cache of the server to be updated is greater than the digital label corresponding to the executed server when executing the target task; the critical planned task has a corresponding critical data source.

[0015] An update unit, configured to control the server to be updated to retrieve the digital label of each planned task from each data source to be updated, so as to update the digital label of each planned task on the display interface corresponding to each server to be updated; wherein, the data sources to be updated include the target data source and each critical data source.

[0016] In the third aspect of the present application, a non-transitory computer-readable storage medium is provided, in which at least one instruction or at least one program segment is stored, and the at least one instruction or at least one program segment is loaded and executed by a processor to implement the foregoing cache update method.

[0017] In a fourth aspect of the present application, an electronic device is provided, including a processor and the above-mentioned non-transitory computer-readable storage medium.

[0018] The present application has at least the following beneficial effects:

[0019] For any user of this platform, after detecting a low-price ticket purchase event on other platforms, the cache update method provided by the present application triggers the behavior of this platform to retrieve the data corresponding to the low-price ticket purchase event from the airline corresponding to the low-price ticket purchase event according to the information corresponding to the low-price ticket purchase behavior. Under the control of the verification ratio, triggering the retrieval of data from the airline by the low-price ticket purchase event facilitates the timely update of data to avoid the loss of many customers on the platform. On the other hand, in order to provide more choices of departure times for subsequent other users, the present application not only updates the data of the airline corresponding to the low-price ticket purchase event, but also simultaneously updates the price data of the high-price tickets (the corresponding price is higher than the price of the low-price ticket purchase event) of the airline within a period of time before and after the planned departure time of the ticket corresponding to the low-price ticket purchase event. In this way, more choices of departure times are provided for this user and subsequent other users, and at the same time, a relatively accurate price is provided for the corresponding ticket. The user experience is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0021] Figure 1 It is a flowchart of the cache update method provided by the embodiment of the present application;

[0022] Figure 2 It is a structural block diagram of the cache update device provided by the embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0023] The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments of the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present application.

[0024] It should be noted that the terms "first", "second", etc. in the description, claims and above-mentioned drawings of this application are used to distinguish similar objects, and do not necessarily have to be used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application described here can be implemented in an order other than those illustrated or described here. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or server that includes a series of steps or units does not necessarily have to be limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or are inherent to these processes, methods, products or devices.

[0025] It should be noted that the following description relates to various aspects of embodiments within the scope of the appended claims. It should be apparent that the aspects described herein can be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on this application, those skilled in the art should understand that one aspect described herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, any number of aspects described herein can be used to implement a device and / or practice a method. Additionally, this device and / or this method can be implemented using other structures and / or functionality in addition to one or more of the aspects described herein.

[0026] Please refer to Figure 1 As shown, an embodiment of the present application provides a cache update method, and the method includes the following steps:

[0027] S100, in response to detecting that the target task has been executed, obtain the digital tag corresponding to the target task; wherein, the target task has a corresponding executed server; the executed server is one of the multiple executable servers corresponding to the target task; the target task has a corresponding digital tag on each executable server; the target task also has a corresponding target planned execution time, target planned execution route, and target data source; the digital tag corresponding to the target task on each executable server is provided by the target data source corresponding to the target task; each executable server has a corresponding multiple planned tasks; the target task is a planned task executed by the executed server among the corresponding multiple planned tasks.

[0028] Specifically, as an example: The target task can be: the ticketing task for a flight ticket from Place A to Place C at 2:00 PM on December 31, 2024; the digital tag corresponding to the target task is the price of the flight ticket; the executed server corresponding to the target task is the platform for purchasing the flight ticket; among them, the same flight ticket can be purchased from multiple platforms. And the prices of the same flight ticket on different platforms may be different. The target planned execution time, target planned execution route, and target data source corresponding to the target task are respectively: planned departure time: 2:00 PM on December 31, 2024; flight route: from Place A to Place C and airline: Airline B. The digital tag corresponding to the target task on each executable server is provided by the corresponding airline. As an example: The prices of the flight ticket from Place A to Place C at 2:00 PM on December 31, 2024 by Airline B on Platform A and on Platform B may be different, but both are provided by Airline B. Each flight ticket purchase platform is an executable server, and there are multiple ticketing tasks for flight tickets executable on each platform.

[0029] S200, if the digital tag corresponding to the executed server when executing the target task is less than the target digital tag corresponding to the target task in the cache of the server to be updated, then obtain the planned time period to be updated corresponding to the server to be updated; where the server to be updated is any executable server different from the executed server; the target planned execution time is the middle time point within the planned time period to be updated.

[0030] Specifically, as an example, if it is detected that the target task has been executed, as an example: that is, it is detected that the ticketing task for a flight ticket from Place A to Place C at 2:00 PM on December 31, 2024 has been executed, and the executed server corresponding to this ticketing task is Platform A. At this time, the target server is Platform B. If searching for flight tickets from Place A to Place C on December 31, 2024 on Platform B, based on the above search conditions, the price displayed by Platform B on the current display interface is the lowest price on that day, that is, the target digital tag. Platform B has a corresponding cache space. Based on the above search conditions, first search for the prices of all flight tickets from Place A to Place C on December 31, 2024 in the cache space of Platform B and display the lowest price on the current interface. If the lowest price displayed on the current interface is still higher than the ticketing price of the flight ticket from Place A to Place C at 2:00 PM on December 31, 2024 that has been executed on Platform A, it means that the prices of the flight tickets of the corresponding airline may have been updated at this time, but based on rules such as the preset update mechanism of Platform B, the corresponding cache space has not timely retrieved the latest data from the airline to update the cache data. At this time, obtain the planned time period to be updated corresponding to the server to be updated. Here, the planned time period to be updated is the time period with the target planned execution time as the middle time point.

[0031] S300, obtain the list of key planned tasks W=(W1, W2,..., W corresponding to the server to be updated within the planned time period to be updatedi , …, W n ); i = 1, 2, …, n; where n is the number of key planned tasks corresponding to the to-be-updated planned time period; W i is the task identifier corresponding to the i-th key planned task in the to-be-updated planned time period; the planned execution route of the key planned task is the same as that of the target task, the planned execution time of the key planned task is different from that of the target task, and the planned execution time of the key planned task is within the to-be-updated planned time period; the digital label corresponding to the key planned task in the cache of the to-be-updated execution server is greater than the digital label corresponding to the execution of the target task by the executed server; the key planned task has a corresponding key data source.

[0032] Specifically, after determining the to-be-updated planned time period, obtain the key planned tasks that have the same route (target planned execution route) as the target task during this period and whose corresponding digital labels are greater than the digital label corresponding to the target task. That is, these key planned tasks are flights with take-off times close to the same day as the target task, and are flights with the same take-off and landing locations, and the prices of these flights are higher than the price corresponding to the target task.

[0033] S400, control the to-be-updated server to retrieve the digital label of each planned task corresponding to each to-be-updated data source to update the digital label of each planned task on the display interface corresponding to each to-be-updated server; where the to-be-updated data sources include the target data source and each key data source.

[0034] Specifically, after determining W, in order to provide more flight ticket options for this user or subsequent other users in this application, platform B retrieves data from the key data source (airline company) corresponding to each key planned task in W and the target data source (the airline company corresponding to the target task), updates the display data on each executable server (platform), and simultaneously updates the corresponding cache data.

[0035] In this embodiment, for any user of Platform B, after detecting a low-price ticket purchase event on other platforms, according to the information corresponding to the low-price ticket purchase behavior, it triggers Platform B to retrieve the data corresponding to the low-price ticket purchase event from the airline corresponding to the low-price ticket purchase event. Under the control of the verification ratio, triggering the retrieval of data from the airline with the low-price ticket purchase event facilitates the timely update of the data so that the user may re-select the platform to place an order. Additionally, the timely data update can prevent the platform from losing too many customers. On the other hand, in order to provide more choices of departure times for other subsequent users, in this embodiment, not only the data of the airline corresponding to the low-price ticket purchase event is updated, but also the price data of the high-price tickets (with prices higher than the price of the low-price ticket purchase event) of the airline corresponding to a period of time before and after the planned departure time of the ticket corresponding to the low-price ticket purchase event is updated. In this way, more choices of departure times are provided for this user or other subsequent users, and at the same time, a relatively accurate price is provided for the corresponding ticket. This improves the user experience.

[0036] In an exemplary embodiment of the present application, after step S100, the method further includes:

[0037] S500, if the digital tag corresponding to the target task when the execution server executes the target task is less than the target digital tag corresponding to the target task in the cache of the server to be updated, then control the server to be updated to retrieve the digital tag of each planned task corresponding to each data source to be updated from each data source to be updated, so as to update the digital tag of each planned task on the display interface corresponding to each server to be updated; wherein, the data sources to be updated include the target data source.

[0038] Specifically, in this embodiment, only the digital tag of each planned task corresponding to the target data source is updated because in some cases, users have preference information for certain data sources. As an example, a certain user may be a loyal user of a certain data source (airline). At this time, there is no need to update the data of other data sources (airlines), which saves the occupancy of resources and reduces the time for data retrieval.

[0039] In an exemplary embodiment of the present application, after step S200, the method further includes:

[0040] S600, obtain the historical task execution times N of the execution user corresponding to the target task.

[0041] Specifically, obtain the number of times the execution user corresponding to the target task has purchased tickets historically. Here, in the present application, the execution user of the target task is a registered user of Platform B (the server to be updated), so the ticket purchase information of the user on other platforms (the executable server) can be obtained. Here, the historical tasks may be performed on multiple platforms respectively.

[0042] S700. If N is equal to or less than the preset number threshold Nc, determine that the executing user corresponding to the target task is a first type of user, and jump to step S300.

[0043] Specifically, if N is equal to or less than the preset number threshold Nc, it indicates that the user may rarely take a plane and the number of times of purchasing tickets is small. For such users, not only update the data of the airline corresponding to the low-price ticket purchase event, but also update the price data of the airlines corresponding to the high-price tickets (the corresponding price is higher than the price of the low-price ticket purchase event) within a period of time before and after the planned departure time of the ticket corresponding to the low-price ticket purchase event. In this way, provide more travel time options for this user or subsequent other users, and at the same time provide a relatively accurate price for the corresponding ticket. Improve the user experience.

[0044] In an exemplary embodiment of the present application, after step S600, the method further includes:

[0045] S800. If N is greater than the preset number threshold Nc, obtain the data source corresponding to the executing user of the target task when executing each historical task, so as to obtain a data source identifier list Y = (Y1, Y2,..., Y j ,..., Y m ); j = 1, 2,..., m; where m is the number of data sources corresponding to the N historical tasks; Y j is the data source identifier of the corresponding j-th data source.

[0046] Specifically, if N is greater than the preset number threshold Nc, it indicates that the user corresponding to the target task may take a plane more frequently. At this time, obtain the data source (airline) corresponding to the executing user of the target task when executing each historical task.

[0047] S900. According to Y, obtain a data source proportion list B = (B1, B2,..., B j ,..., B m ); where B j is the proportion corresponding to the i-th data source; B j = BN j / N; BN j is the historical execution times corresponding to the j-th data source.

[0048] As an example: If N = 50, B j is the proportion of taking airline A, and BNj = 10, then B j = 1 / 5.

[0049] S1000. If the j-th data source is the target data source and B jIf it is equal to or less than a preset ratio threshold, obtain the digital tags corresponding to the executing user of the target task when executing each historical task, so as to obtain a historical digital tag list S=(S1, S2, …, S a , …, S N ); a = 1, 2, …, N; where S a is the digital tag corresponding to the executing user of the target task when executing the a-th historical task; each historical task also has a corresponding departure date.

[0050] Specifically, if the j-th data source is the target data source and B j is equal to or less than the preset ratio threshold, that is, if the ratio corresponding to the target data source is less than the preset ratio threshold, it means that the user does not prefer to purchase flights from the target data source, and may prefer other flights or is more inclined to low-price flights.

[0051] S1100, according to S and the departure date corresponding to each historical task, obtain a first digital tag list YP=(YP1, YP2, …, YP a , …, YP N ); where YP a is the first average digital tag corresponding to the a-th historical task; the first average digital tag is the average of the digital tags corresponding to several first key historical tasks when they are executed; the execution route corresponding to the first key historical task is the same as the execution route of the corresponding historical task, and the execution date corresponding to the first key historical task is within the first time window before the departure date of the corresponding historical task; the end time of the first time window is the departure date of the corresponding historical task.

[0052] S1200, according to S and the departure date corresponding to each historical task, obtain a second digital tag list EP=(EP1, EP2, …, EP a , …, EP N ); where EP a is the second average digital tag corresponding to the a-th historical task; the second average digital tag is the average of the digital tags corresponding to several second key historical tasks when they are executed; the execution route corresponding to the second key historical task is the same as the execution route of the corresponding historical task, and the execution date corresponding to the second key historical task is within the second time window before the departure date of the corresponding historical task; the time length of the second time window is greater than the time length of the first time window, and the end time of the second time window is the departure date of the corresponding historical task.

[0053] Specifically, for each historical task corresponding to the target task, obtain the average price at which other users purchase the same route within the first time window and the second time window immediately before the execution date (departure date) of the historical task for the executing user corresponding to the historical task. Among them, the first time window can be one week before the execution date (departure date) of the historical task, and the second time window can be one month before the execution date (departure date) of the historical task.

[0054] S1300, according to S, the first digital label list, and the second label list, obtain the third type of preference score SP.

[0055] SP meets the following conditions:

[0056] SP = Σ N a＝1 AI a / N

[0057] Among them, AI a is the digital label advantage index corresponding to S, and AI a meets the following conditions: a meets the following conditions:

[0058] If S a ≤ EP a , then AI a = 1 + (EP a - S a ) / EP a ;

[0059] If EP a < S a ≤ YP a , then AI a = (YP a - S a ) / YP a ;

[0060] If S a > YP a , then YP a = 0.

[0061] Specifically, if the digital label (purchase price) corresponding to the executing user of the target task when executing the a-th historical task is less than or equal to the monthly average price EP of the same route a, it means that the price advantage is relatively large, because in order to plan the flight occupancy rate in advance, airlines will launch some discounted tickets long before the flight takes off to encourage passengers to book in advance. One month in advance is relatively ample time, and airlines are more likely to release low-priced tickets to attract passengers to confirm their itineraries as early as possible and fill up the flight seats. As the departure date approaches, the number of remaining tickets decreases, and airlines may increase prices to obtain higher profits. Moreover, one month in advance, passengers' travel plans are relatively more scattered and market demand is relatively stable. In order to attract more customers, airlines will offer relatively low prices. One week in advance, the travel needs of many passengers have been determined, and the market demand is relatively concentrated. Airlines will take advantage of this increase in demand to increase ticket prices. If the digital label (purchase price) corresponding to the executing user of the target task is greater than the monthly average price EP of the same route when executing the ath historical task a However, if it is less than or equal to the weekly average price of the same route, it means that the price advantage is smaller than the monthly average price. Otherwise, the price advantage is 0.

[0062] Furthermore, the price advantage index of each ticket purchase price in history is summed up to obtain the third type of preference score SP.

[0063] S1400: If the third category preference score is greater than the preset preference score threshold, it is determined that the executing user corresponding to the target task is a second category user, and the process jumps to step S300.

[0064] Specifically, if the third category preference score is greater than the preset preference score threshold, it means that the executing user corresponding to the target task prefers to buy low-priced tickets. At this time, not only the data of the airline corresponding to the low-priced ticket purchase event is updated, but also the price data of the airline corresponding to the high-priced tickets (the corresponding price is higher than the price of the low-priced ticket purchase event) for a period of time before and after the scheduled departure time of the ticket corresponding to the low-priced ticket purchase event is updated. In this way, more travel time and ticket price options are provided for the user to change the ticket or other subsequent users, and more accurate prices are provided for the corresponding tickets. Improve the user experience.

[0065] In this embodiment, the user's multiple historical purchase behaviors corresponding to the target task are used to obtain the user's portrait, thereby obtaining the user's preferences and providing the user with a suitable ticket update plan. On the one hand, for the user, many options for changing the ticket can be provided, and more accurate prices can also be provided for other users who purchase tickets later.

[0066] In an exemplary embodiment of the present application, after step S900, the method further includes:

[0067] S1500, if B jIf it is greater than the preset ratio threshold and the j-th data source is the target data source, then determine that the execution user corresponding to the target task is a third type of user, and jump to step S500.

[0068] In this embodiment, if B j is greater than the preset ratio threshold and the j-th data source is the target data source, it means that the execution user corresponding to the target task is a loyal user of the target data source and does not care much about price factors. They give priority to the airline. At this time, in order to save resources and improve the update efficiency, only data is retrieved from the target data source to update the display interface of the corresponding platform, so as to provide the user with the updated price information.

[0069] In an exemplary embodiment of the present application, the update of the above digital tags can also be in response to receiving a target query request from the user, specifically as follows:

[0070] Sa1, in response to receiving a target query request from the user, obtain the target request server corresponding to the target query request of the user; wherein, the target query request includes a target planned departure location, a target planned destination, and a target planned start date; the target request server is used to query the target query request of the user according to the corresponding data source; each data source has at least one data interface; the permissions of each data interface to obtain data from the corresponding data source are different; each data source sets a data interface for the target request server.

[0071] Specifically, the target query request includes a target planned departure location, a target planned destination, and a target planned start date. As an example: the target query request is: query flights from location A to location B on December 31, 2024. The request server corresponding to the target query request can be any sales channel, such as a small program, an APP, etc. Each request server can retrieve data from several data sources to process the user's query request. It has a corresponding display interface to display the corresponding query results for the user's query request. As an example: the data sources can be airline C and airline A. And each data source has at least one data interface, and the data interface can be a direct sales interface or an agent interface. The permissions of each data interface to obtain data from the corresponding data source are different. As an example: the agent interface of airline A can only obtain the quotes of the direct flights provided by airline A from airline A, and cannot obtain the quotes of the transit routes provided by airline A.

[0072] It should be noted that each data source sets a data interface for each request server. That is, the permissions of each request server to obtain data from the corresponding data source are different. Therefore, the data obtained by each request server from the corresponding data source is different, and the query results obtained by the user for the same query request on different request servers may also be different.

[0073] Sa2. Determine at least one critical executable route from a preset basic route library according to the target query request; wherein, the preset basic route library contains several executable routes; each executable route has a corresponding executable date and a corresponding data source; any date among the executable dates corresponding to the critical executable routes is the same as the target planned start date, and the starting point and destination of the critical executable route are the same as the target planned starting point and the target planned destination, respectively.

[0074] Specifically, the preset basic route library includes several executable routes; wherein, each executable route has a corresponding executable date and a corresponding data source. Further, the several executable routes are divided into direct executable routes and indirect executable routes. Among them, the direct executable route is a direct route, and the indirect executable route is a transfer route. Among them, the data construction of the direct executable route comes from the AV database, and the AV database contains all flight plans of each flight route within the planned time in the future. In addition, due to airline authority restrictions, the airline data covered in the AV is incomplete. Therefore, the data construction of the direct executable route also inputs all flight plans of each flight route in the future planned time through the airline interface. In addition, manual supplementation is also carried out through the management terminal. For the data construction of the direct executable route, on the one hand, it comes from the algorithm, which determines whether it can be executed according to the transfer routes corresponding to the issued tickets to obtain the transfer plans corresponding to some flight routes. In addition, the guaranteed transfer plans of other platforms can also be obtained through crawling as the transfer plans of some flight routes. The transfer plans determined by the airline official can also be accessed from the airline. Each executable route in the preset basic route library has a corresponding date or schedule, and also has a corresponding data source (airline). As an example: Query the flight from place A to place B on December 31, 2024: The preset database includes executable route 1: Airline B can fly directly from place A to place B on December 31, 2024; executable route 2: Airline A can fly directly from place A to place B on December 31, 2024; executable route 3: Airline C can transfer at place C and then reach place B from place A on December 31, 2024.

[0075] In this embodiment, according to the target planned starting point, the target planned destination, and the target planned start date in the target query request, at least one corresponding critical executable route can be determined from the preset basic route library.

[0076] Here, the critical executable route can be direct or transfer. That is, the critical executable route is a route that can meet the user's target query request.

[0077] Sa3. Obtain at least one data source to be updated according to each critical executable route; wherein, the data source to be updated is the data source corresponding to the critical executable route.

[0078] Specifically, at least one data source to be updated is obtained according to each key executable route. Since each executable route in each preset basic route library has a corresponding data source, that is, each key executable route has a corresponding data source. As an example: the user's target query request is to query flights from place A to place B on December 31, 2024. The preset database includes executable route 1: airline B can directly reach place B from place A on December 31, 2024; executable route 2: airline A can directly reach place B from place A on December 31, 2024; executable route 3: airline C can reach place B after transferring at place C from place A on December 31, 2024. Then the data sources to be updated are airline B, airline A, and airline C.

[0079] Sa4, control the target request server to obtain the query data corresponding to the target query request according to the permissions of each data source to be updated for the data interface set by the target request server; wherein, the query data is sourced from the data corresponding to the permissions of the data source to be updated for the data interface set by the target request server cached in the target request server or the data obtained by the target request server from the data source to be updated according to the permissions of the data source to be updated for the data interface set by the target request server.

[0080] Specifically, as an example: The user's target query request is to query flights from place A to place B on December 31, 2024. The preset database includes executable route 1: On December 31, 2024, airline B can fly directly from place A to place B; executable route 2: On December 31, 2024, airline A can fly directly from place A to place B; executable route 3: On December 31, 2024, airline C can fly from place A via place C and then reach place B. Then the data sources to be updated are airline B, airline A, and airline C. The target request server corresponding to the target query request is the WeChat mini-program; the permission of airline B for the data interface of the WeChat mini-program is to only obtain data for direct flight tasks; the permissions of airline A and airline C for the data interface of the WeChat mini-program are to obtain all data; then first determine whether there is cached data for the direct flight tasks of airline B and the direct flight tasks and transfer tasks of airline A and airline C in the cache space of the WeChat mini-program. If so, according to the corresponding cached data, update all the direct flight task data of airline B on that date and all the direct flight tasks and all transfer task data of airline A and airline C on that date, and obtain the corresponding query result from the updated data according to the target query request. Among them, the query result includes the flight route of the corresponding flight (if it is a transfer, the transfer location is displayed), the departure time, and the price (numeric label). If there is no cached data for the direct flight tasks of airline B and the direct flight tasks and transfer tasks of airline A and airline C in the WeChat mini-program, then obtain all the direct flight task data from airline B, and obtain all the direct flight tasks and all transfer task data corresponding to that date from airline A and airline C, and obtain the corresponding query result from the updated data according to the target query request.

[0081] In this embodiment, through the preset basic route library, when receiving the user's query request, the data sources to be updated can be determined according to the data sources corresponding to the key executable routes with high matching degrees in the preset basic route library, so as to avoid performing a full-scale query on all data sources every time a query request is received, reducing the number of queries, controlling the query-booking ratio within a reasonable range, saving the occupancy of computer resources, and saving query time, thus improving the user experience.

[0082] In an exemplary embodiment of the present application, the step Sa3 includes:

[0083] Sa31, obtain at least one initial data source to be updated according to the data source corresponding to each key executable route.

[0084] Sa32, if a preset label is set for each key executable route corresponding to any initial data source to be updated, then delete the initial data source to be updated to obtain at least one data source to be updated; wherein, the preset label indicates that there is no data to be queried in the corresponding data source for the corresponding key executable route within a preset time period.

[0085] Among them, the end time of the preset time period is the time when the target query request of the user is received. The data to be queried is the digital label corresponding to the key executable route.

[0086] In this embodiment, the sources of the executable routes in the preset basic route library are diverse. Due to the variability of the planned tasks, there may be some executable routes that, due to plan changes, are no longer executed or will not be executed within a current period of time. However, since they are set as executable routes in the preset basic route library, when matching according to the user's query request, the key executable route may be matched. And since it is no longer executed or will not be executed within a current period of time, there is no corresponding data (digital label and specific execution information) in the corresponding data source. At this time, in order to avoid waste of resources, a preset label is set for such data. The preset label indicates that within the preset time period, there is no data to be queried in the corresponding data source for the corresponding key executable route. If a preset label is set for each key executable route corresponding to any initial data source to be updated, it means that each executable route corresponding to the initial data source to be updated is not currently executed, so the initial data source to be updated is deleted. In this way, the final effective data source to be updated is obtained.

[0087] In an exemplary embodiment of the present application, after step Sa4, the method further includes:

[0088] Sa5, according to the target query request of the user, obtain the feature list T=(T1, T2,..., T x ,..., T y ); x = 1, 2,..., y; where y is the number of date features of the target planned start date corresponding to the target query request; T x is the feature value corresponding to the xth date feature.

[0089] Specifically, the feature value can be the day of the week: mark the day of the week corresponding to each target planned start date (0 represents Monday, 1 represents Tuesday, and so on, 6 represents Sunday); whether it is a weekend: generate a binary feature according to the mark of the day of the week, 1 represents a weekend (Saturday and Sunday), 0 represents a working day; whether it is a holiday: combine national legal holidays, local special holidays and internationally common holidays to mark whether the target planned start date is a holiday (1 represents yes, 0 represents no); and features such as whether the target planned start date is within 3 days of a holiday. Obtain the corresponding feature value list.

[0090] Sa6, according to T, obtain the historical extension frequency corresponding to each date feature within the historical time window, so as to obtain the corresponding extension frequency list C=(C1, C2,..., C x ,..., C y ); where Cx The historical extension frequency corresponding to the x-th date feature; C x = YC x / ZC x ; where ZC x is the number of query requests whose corresponding target planned start date within the historical time window conforms to the x-th date feature; YC x is the number of query requests for extending the target planned start date within the historical time window.

[0091] Specifically, as an example: If T x is the feature of "whether the target planned start date is within 3 days of a holiday", and the corresponding feature value is 1, that is, within 3 days; then ZC x is the number of query requests whose target planned start date within the historical time window is within 3 days of a holiday and also queries the days before and after that day; and YC x is the total number of query requests whose target planned start date within the historical time window is within 3 days of a holiday.

[0092] Sa7, according to C, the comprehensive extension similarity ZH = (Σ y x＝1 (α x × C x )) / Σ y x＝1 α x ; where α x is the feature weight corresponding to C x ; 0 < α x < 1.

[0093] Specifically, the larger ZH is, the easier it means that the date feature of the date corresponding to the above-mentioned user's target query request is not only easy to query the data of that day, but also easy to query the data of the days before and after that day at the same time. At this time, due to certain reasons, such as: being close to a holiday, etc., the choice of travel time is flexible, so it is also easy to query the data of the days before and after that day at the same time. In addition, a corresponding weight is assigned to each feature. When the importance of the feature to the comprehensive extension similarity is different, the corresponding weight is different. The influence of important features is highlighted through the weighted average method.

[0094] Sa8, if ZH is greater than the preset similarity threshold, then control the target request server to obtain the query data within the preset time period before and after the target planned start date corresponding to the target query request according to the permissions of each data source to be updated for the data interface set by the target request server.

[0095] Specifically, if ZH is greater than a preset similarity threshold, it indicates that the date feature corresponding to the target query request of the above user is more likely to not only query the data on the day of the date, but also easily query the data in the few days before and after the date at the same time. At this time, the target request server is controlled to obtain the query data within a preset time period before and after the target planned start date corresponding to the target query request according to the permissions of each data source to be updated for the data interface set by the target request server. As an example: the preset time period can be one day.

[0096] In this embodiment, by obtaining the date feature in the target query request of the user, it is determined whether the corresponding date is likely to control the target request server to obtain the query data within a preset time period before and after the target planned start date corresponding to the target query request according to the permissions of each data source to be updated for the data interface set by the target request server. To enable the simultaneous invocation of data before and after, so that when the user queries the data before and after, there is no need to wait for a long time and can directly obtain it, which can improve the user experience.

[0097] Please refer to Figure 2 As shown in the figure, an embodiment of the present application provides a cache update device 100, and the device includes:

[0098] A label acquisition unit 110, configured to obtain a digital label corresponding to a target task in response to detecting that the target task has been executed; wherein, the target task has a corresponding executed server; the executed server is one of multiple executable servers corresponding to the target task; the target task has a corresponding digital label on each executable server; the target task also has a corresponding target planned execution time, target planned execution route, and target data source; the digital label corresponding to the target task on each executable server is provided by the target data source corresponding to the target task; each executable server has a corresponding multiple planned tasks; the target task is a planned task executed by the executed server among the corresponding multiple planned tasks.

[0099] A time period determination unit 120, configured to obtain a to-be-updated planned time period corresponding to the to-be-updated server if the digital label corresponding to the target task when the executed server executes the target task is less than the target digital label corresponding to the target task in the cache of the to-be-updated server; wherein, the to-be-updated server is any executable server different from the executed server; the target planned execution time is the middle time point within the to-be-updated planned time period.

[0100] A task list acquisition unit 130, configured to obtain a key planned task list W=(W1, W2,..., W i ,..., W n)); i = 1, 2, …, n; where n is the number of key planned tasks corresponding to the time period of the plan to be updated; W i is the task identifier corresponding to the i-th key planned task within the time period of the plan to be updated; the planned execution route of the key planned task is the same as that of the target task, the planned execution time of the key planned task is different from that of the target task, and the planned execution time of the key planned task is within the time period of the plan to be updated; the digital label corresponding to the key planned task in the cache of the server to be updated is greater than the digital label corresponding to the execution of the target task by the executed server; the key planned task has a corresponding key data source.

[0101] The updating unit 140 is configured to control the server to be updated to retrieve the digital label of each planned task from each data source to be updated, so as to update the digital label of each planned task on the display interface corresponding to each server to be updated; wherein, the data sources to be updated include the target data source and each key data source.

[0102] An embodiment of the present application further provides a computer program product, which includes program codes. When the program product runs on an electronic device, the program codes are used to cause the electronic device to execute the steps in the methods according to various exemplary embodiments described in this specification.

[0103] In addition, although the steps of the methods in the present application are described in a specific order in the drawings, this does not require or imply that these steps must be executed in this specific order, or that all the steps shown must be executed to achieve the desired result. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step for execution, and / or one step may be decomposed into multiple steps for execution, etc.

[0104] Through the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein can be implemented by software, or by a combination of software and necessary hardware. Therefore, the technical solutions according to the embodiments of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the methods according to the embodiments of the present application.

[0105] In an exemplary embodiment of the present application, an electronic device capable of implementing the above method is further provided.

[0106] Those skilled in the art can understand that various aspects of the present application can be implemented as a system, a method, or a program product. Therefore, various aspects of the present application can be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or an implementation combining hardware and software aspects, which can be collectively referred to as "circuitry", "module", or "system" here.

[0107] An electronic device according to this embodiment of the present application. The electronic device is merely an example and should not impose any limitation on the functions and usage scope of the embodiments of the present application.

[0108] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor described above, the at least one storage, and a bus connecting different system components (including the storage and the processor).

[0109] Wherein, the storage stores program code, and the program code can be executed by the processor, so that the processor executes the steps according to various exemplary embodiments of the present application described in the "Exemplary Method" section of this specification.

[0110] The storage may include a readable medium in the form of a volatile storage, such as a random access storage (RAM) and / or a cache storage, and may further include a read-only storage (ROM).

[0111] The storage may further include a program / utilities having a set (at least one) of program modules, and such program modules include, but are not limited to: an operating system, one or more application programs, other program modules, and program data. The implementation of a network environment may be included in each or some combination of these examples.

[0112] The bus may represent one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any bus structure in a variety of bus structures.

[0113] The electronic device can also communicate with one or more external devices (such as a keyboard, a pointing device, a Bluetooth device, etc.), and can also communicate with one or more devices that enable a user to interact with the electronic device, and / or communicate with any device that enables the electronic device to communicate with one or more other computing devices (such as a router, a modem, etc.). Such communication can be carried out through an input / output (I / O) interface. Moreover, the electronic device can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter. As shown in the figure, the network adapter communicates with other modules of the electronic device through a bus. It should be understood that although not shown in the figure, other hardware and / or software modules can be used in combination with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0114] Through the description of the above embodiments, those skilled in the art can easily understand that the exemplary embodiments described herein can be implemented by software, or can be implemented by the way of software combined with necessary hardware. Therefore, the technical solutions according to the embodiments of the present application can be embodied in the form of a software product, and the software product can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present application.

[0115] In an exemplary embodiment of the present application, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementation manners, various aspects of the present application can also be implemented in the form of a program product, which includes program code. When the program product runs on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present application described in the above "Exemplary Method" section of the present specification.

[0116] The program product can adopt any combination of one or more readable media. The readable media can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0117] A computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries readable program code. Such a propagated data signal may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. The readable signal medium may also be any readable medium other than a readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device.

[0118] The program code contained on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0119] The program code for performing the operations of this application may be written in any combination of one or more programming languages. The programming languages include object-oriented programming languages such as Java, C++, etc., and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's device, executed as a stand-alone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user's computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., by using an Internet service provider to connect through the Internet).

[0120] In addition, the above drawings are only schematic illustrations of the processes included in the method according to the exemplary embodiments of this application, and are not for limiting purposes. It is easy to understand that the processes shown in the above drawings do not indicate or limit the time sequence of these processes. Additionally, it is also easy to understand that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0121] It should be noted that although several modules or units of devices for performing actions are mentioned in the above detailed description, such a division is not mandatory. In fact, according to the embodiments of this application, the features and functions of two or more of the above-described modules or units may be embodied in one module or unit. Conversely, the features and functions of one module or unit described above may be further divided and embodied by multiple modules or units.

[0122] The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present application should be covered by the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A cache update method, characterized in that: The method comprises: S100, in response to detecting that the target task has been executed, a digital tag corresponding to the target task is obtained; wherein the target task has a corresponding executed server; the executed server is one of the multiple executable servers corresponding to the target task; the target task has a corresponding digital tag on each executable server; the target task also has a corresponding target planned execution time, a target planned execution route and a target data source; the digital tag corresponding to the target task on each executable server is provided by the target data source corresponding to the target task; each executable server has a corresponding multiple planned tasks; the target task is a planned task executed by the executed server among the corresponding multiple planned tasks; S200, if the digital tag corresponding to the target task executed by the executed server is smaller than the target digital tag corresponding to the target task in the cache of the server to be updated, then the planned time period to be updated corresponding to the server to be updated is obtained; wherein the server to be updated is any executable server different from the executed server; the target planned execution time is the middle time point within the planned time period to be updated; S300, obtaining a list of key planned tasks corresponding to the server to be updated within the planned time period to be updated W = (W1, W2, ..., W i , …, W n ); i = 1, 2, ..., n; where n is the number of key planned tasks corresponding to the planned time period to be updated; W i The task identifier corresponding to the i-th key planned task within the planned time period to be updated; the planned execution route of the key planned task is the same as the planned execution route of the target task, the planned execution time of the key planned task is different from the planned execution time of the target task, and the planned execution time of the key planned task is within the planned time period to be updated; the digital label corresponding to the key planned task in the cache of the execution server to be updated is greater than the digital label corresponding to the target task when the executed server executes the target task; the key planned task has a corresponding key data source; S400, controlling the server to be updated to retrieve the corresponding digital label of each planned task from each data source to be updated, so as to update the digital label of each planned task on the display interface corresponding to each server to be updated; wherein the data source to be updated includes the target data source and each key data source.

2. The cache update method according to claim 1, characterized in that: After step S100, the method further includes: S500, if the digital label corresponding to the target task executed by the executed server is smaller than the target digital label corresponding to the target task in the cache of the server to be updated, the server to be updated is controlled to retrieve the corresponding digital label of each planned task from each data source to be updated, so as to update the digital label of each planned task on the display interface corresponding to each server to be updated; wherein the data source to be updated includes the target data source.

3. The cache update method according to claim 2, characterized in that: After step S200, the method further includes: S600, obtaining the historical task execution times N of the executing user corresponding to the target task; S700: If N is equal to or less than the preset number threshold Nc, it is determined that the executing user corresponding to the target task is a first type of user, and the process jumps to step S300.

4. The cache update method according to claim 3, characterized in that: After step S600, the method further includes: S800, if N is greater than a preset number threshold Nc, then obtain the data source corresponding to each historical task executed by the executing user corresponding to the target task, so as to obtain a data source identification list Y=(Y1, Y2, ..., Y j , …, Y m ), j = 1, 2, ..., m, where m is the number of data sources corresponding to N historical tasks; Y j is the data source identifier of the corresponding j-th data source; S900, according to Y, obtain a data source ratio list B = (B1, B2, ..., B j , …, B m ), where B j is the proportion corresponding to the i-th data source; B j =BN j / N; BN j is the historical execution times corresponding to the j-th data source; S1000, if the jth data source is the target data source, and B j If the ratio is equal to or less than the preset ratio threshold, the digital label corresponding to each historical task executed by the executing user corresponding to the target task is obtained to obtain a historical digital label list S = (S1, S2, ..., S a , …, S N );a=1,2,…,N;where S a is the numerical label corresponding to the target task when the executing user executes the ath historical task; each historical task also has a corresponding departure date; S1100, according to S and the departure date corresponding to each historical task, obtain a first digital label list YP = (YP1, YP2, ..., YP a , …, YP N ), among which, YP a is the first average digital label corresponding to the a-th historical task; the first average digital label is the average of the digital labels corresponding to a number of first key historical tasks when they are executed; the execution route corresponding to the first key historical task is the same as the execution route of the corresponding historical task, and the execution date corresponding to the first key historical task is within the first time window before the departure date of the corresponding historical task; the end time of the first time window is the departure date of the corresponding historical task; S1200, according to S and the departure date corresponding to each historical task, obtain a second digital tag list EP = (EP1, EP2, ..., EP a , …, EP N );Among them, EP a is the second average digital label corresponding to the a-th historical task; the second average digital label is the average of the digital labels corresponding to a number of second key historical tasks when they are executed; the execution route corresponding to the second key historical task is the same as the execution route of the corresponding historical task, and the execution date corresponding to the second key historical task is within the second time window before the departure date of the corresponding historical task; the time length of the second time window is greater than the time length of the first time window, and the end time of the second time window is the departure date of the corresponding historical task; S1300, obtaining a third category preference score SP according to S, the first digital label list, and the second label list; S1400: If the third category preference score is greater than the preset preference score threshold, it is determined that the executing user corresponding to the target task is a second category user, and the process jumps to step S300.

5. The cache update method according to claim 4, characterized in that: SP meets the following conditions: SP=Σ N a＝1 THERE a / N Among them, AI a For S a Corresponding digital label advantage index, AI a Meet the following conditions: If S a ≤EP a , then AI a =1+(EP a -S a ) / EP a ; If EP a <S a ≤YP a , then AI a =(YP a -S a ) / YP a ; If S a >YP a , then YP a =0.

6. The cache update method according to claim 4 or 5, characterized in that: After step S900, the method further includes: S1500, if B j If the ratio is greater than a preset threshold value and the j-th data source is the target data source, it is determined that the executing user corresponding to the target task is a third type of user, and the process jumps to step S500.

7. A cache update device, characterized in that: The device comprises: The label acquisition unit is used to acquire the digital label corresponding to the target task in response to detecting that the target task has been executed; wherein the target task has a corresponding executed server; the executed server is one of the multiple executable servers corresponding to the target task; the target task has a corresponding digital label on each executable server; the target task also has a corresponding target planned execution time, a target planned execution route and a target data source; the digital label corresponding to the target task on each executable server is provided by the target data source corresponding to the target task; each executable server has a corresponding multiple planned tasks; the target task is a planned task executed by the executed server among the corresponding multiple planned tasks; A time period determination unit, used for obtaining a time period to be updated corresponding to the server to be updated if the digital tag corresponding to the target task executed by the executed server is smaller than the target digital tag corresponding to the target task in the cache of the server to be updated; wherein the server to be updated is any executable server different from the executed server; and the target planned execution time is an intermediate time point within the time period to be updated; The task list acquisition unit is used to acquire the key planned task list W=(W1, W2, ..., W i , …, W n ); i = 1, 2, ..., n; where n is the number of key planned tasks corresponding to the planned time period to be updated; W i The task identifier corresponding to the i-th key planned task within the planned time period to be updated; the planned execution route of the key planned task is the same as the planned execution route of the target task, the planned execution time of the key planned task is different from the planned execution time of the target task, and the planned execution time of the key planned task is within the planned time period to be updated; the digital label corresponding to the key planned task in the cache of the execution server to be updated is greater than the digital label corresponding to the target task when the executed server executes the target task; the key planned task has a corresponding key data source; The updating unit is used to control the server to be updated to retrieve the digital label of each corresponding planned task from each data source to be updated, so as to update the digital label of each planned task on the display interface corresponding to each server to be updated; wherein the data source to be updated includes the target data source and each key data source.

8. A non-transitory computer-readable storage medium, characterized in that: The storage medium stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the method as claimed in any one of claims 1 to 6.

9. An electronic device, characterized in that: The invention comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 8.

Images