CN112948461B - Method, apparatus, storage medium and program product for calendar data processing - Google Patents
Method, apparatus, storage medium and program product for calendar data processing Download PDFInfo
- Publication number
- CN112948461B CN112948461B CN202110216666.0A CN202110216666A CN112948461B CN 112948461 B CN112948461 B CN 112948461B CN 202110216666 A CN202110216666 A CN 202110216666A CN 112948461 B CN112948461 B CN 112948461B
- Authority
- CN
- China
- Prior art keywords
- schedule data
- storage space
- local storage
- time period
- sub
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000012545 processing Methods 0.000 title claims abstract description 43
- 230000004044 response Effects 0.000 claims abstract description 45
- 238000004590 computer program Methods 0.000 claims description 15
- 238000013523 data management Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000009877 rendering Methods 0.000 description 52
- 238000004891 communication Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000003993 interaction Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000003672 processing method Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2474—Sequence data queries, e.g. querying versioned data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2358—Change logging, detection, and notification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
- G06Q10/1093—Calendar-based scheduling for persons or groups
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method, equipment, a storage medium and a program product for processing schedule data, and relates to the fields of intelligent searching, information flow, cloud service and the like in computer technology. According to the method, the client stores the schedule data which is requested from the server in the local storage space, the request for inquiring the schedule data in the specified time range is responded, if the schedule data in the first sub-time range in the specified time range is stored in the local storage space, the schedule data in the first sub-time range is acquired from the local storage space, if the schedule data in the second sub-time range in the specified time range is not stored in the local storage space, the schedule data in the second sub-time range is acquired from the server, the requested schedule data is acquired from the local storage space, the unsolicited schedule data is acquired from the server, repeated acquisition of the schedule data can be reduced, resources are saved, delay time for acquiring the schedule data is shortened, and response time is shortened.
Description
Technical Field
The present application relates to the fields of intelligent searching, information flow, cloud service, etc. in computer technology, and in particular, to a method, apparatus, storage medium, and program product for processing schedule data.
Background
Currently, calendars and similar applications mostly include calendar functions, and can provide calendar recording and management functions to users. The user can view the schedule list of the user through the application, and can perform operations such as adding, deleting, modifying, inquiring and the like on the existing schedule on the application.
When a user requests to inquire schedule data, the user needs to send a request to a server where an application is located, and receives the data from the server, and the process of each request needs to take a long time. For the data requested by the user, the data still need to be re-requested and obtained when being checked again, so that resource waste is caused, and the response time delay is long and the response is not timely.
Disclosure of Invention
The application provides a method, a device, a storage medium and a program product for processing schedule data.
According to a first aspect of the present application, there is provided a method of calendar data processing, comprising:
in response to receiving a query request for schedule data in a specified time period, and the first schedule data in a first sub-time period is stored in a local storage space, acquiring the first schedule data from the local storage space;
In response to determining that the second schedule data in the second sub-time period is not stored in the local storage space, acquiring the second schedule data from a server, wherein the specified time period comprises the first sub-time period and the second sub-time period;
Displaying the first schedule data and the second schedule data.
According to a second aspect of the present application, there is provided an apparatus for calendar data processing, comprising:
the local schedule data acquisition module is used for responding to a query request of schedule data in a designated time period, and acquiring the first schedule data from a local storage space when the first schedule data in a first sub-time period is stored in the local storage space;
a remote schedule data acquisition module, configured to acquire second schedule data from a server in response to determining that the second schedule data in a second sub-period is not stored in the local storage space, where the specified period includes the first sub-period and the second sub-period;
The schedule data display module is used for displaying the first schedule data and the second schedule data.
According to a third aspect of the present application, there is provided an electronic device comprising:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect.
According to a fourth aspect of the present application there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of the first aspect.
According to a fifth aspect of the present application, there is provided a computer program product comprising: a computer program stored in a readable storage medium, from which it can be read by at least one processor of an electronic device, the at least one processor executing the computer program causing the electronic device to perform the method of the first aspect.
According to the technology provided by the application, repeated acquisition of schedule data is reduced, resources are saved, and delay time for acquiring the schedule data is shortened.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the application or to delineate the scope of the application. Other features of the present application will become apparent from the description that follows.
Drawings
The drawings are included to provide a better understanding of the present application and are not to be construed as limiting the application. Wherein:
FIG. 1 is a schematic diagram of an application architecture of a method for volumetric fixed calendar data processing according to the present application;
FIG. 2 is a flowchart of a method of calendar data processing provided by a first embodiment of the present application;
FIG. 3 is a flow chart of a method of calendar data processing provided by a second embodiment of the present application;
FIG. 4 is a schematic view of an apparatus for calendar data processing provided by a third embodiment of the present application;
FIG. 5 is a schematic view of an apparatus for calendar data processing provided by a fourth embodiment of the present application;
Fig. 6 is a block diagram of an electronic device for implementing a method of calendar data processing according to an embodiment of the present application.
Detailed Description
Exemplary embodiments of the present application will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present application are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The application provides a method, equipment, storage medium and program product for processing schedule data, which are applied to the fields of intelligent search, information flow, cloud service and the like in the computer technology, so as to reduce repeated acquisition of the schedule data, save resources and reduce delay time for acquiring the schedule data.
The method for processing the schedule data is particularly applied to calendars or similar applications capable of providing functions of schedule recording, management and the like, and a user can view own schedule list through the application and can perform operations of adding, deleting, changing, searching and the like on the existing schedule data. When a user requests to inquire schedule data, the basic process of displaying a schedule list by an application comprises the following steps: the client sends a specified time period to the server and requests schedule data of a user in the specified time period; rendering and displaying the schedule data acquired from the server. And a great deal of time is spent in the process of requesting data from the server, and the data which is requested by the user still needs to be re-requested and obtained when being checked again, so that the resource waste is caused, the response time delay is long, and the response is not timely.
For example, in a calendar application, a user may query calendar data in one or more months in month units by viewing the calendar in combination with characteristics of the calendar displayed in month units. The user can input a target month, and the client of the calendar application defaults to query the calendar data of the month before the target month, the month after the target month and the month before the target month from the server, and displays the calendar data after rendering. If the target month is 3 months, the client inquires schedule data of 2, 3 and 4 months from the server, renders the schedule data and displays the rendered schedule data; when the target month switched by the user is 4 months, the client inquires the schedule data of 3, 4 and 5 months from the server and renders the schedule data to display, and the schedule data of 3 and 4 months are acquired from the server again although the schedule data of 3 and 4 months are inquired at the last time.
The application provides a method for processing schedule data, which aims to solve the technical problems.
The method for processing schedule data provided by the application can be particularly applied to an application architecture shown in fig. 1, wherein the application architecture comprises a client 11, a server 12 and a local storage space 13 of the client 11. The client 11 is configured to perform a method for processing calendar data, and provide a visual interface for user interaction, so as to receive a request from a user to query, add, modify, and delete calendar data. The local storage space 13 is used to store requested schedule data. The client 11 stores the schedule data in the local storage space 13 after each time the client 11 queries the schedule data from the server 12 (e.g., the client 11 sends a query request to the server 12, and the server 12 returns the data). When schedule data is stored in the local storage space 13, duplicate data is removed, and it is ensured that duplicate data does not exist in the local storage space 13. For the newly added and modified schedule data pushed to the client 11 by the server 12 when newly adding/modifying the schedule data, the client 11 updates the newly added and modified schedule data to the local storage space 13, and can update and store the newly added and modified schedule data in a replacement mode, so that the latest schedule data is stored in the local storage space 13, and no duplicate data exists. The client 11 deletes the corresponding schedule data in the local storage space 13 in response to a request for deleting the schedule data from the user, and transmits the request for deleting the corresponding schedule data to the server 12. In this way, the schedule data requested by the user is stored in the local storage space 13, and when the user switches the designated period to request the schedule data again, the schedule data that has been requested may be acquired from the local storage space 13, and the schedule data that has not been requested may be acquired from the server 12 and then stored in the local storage space 13. Therefore, repeated acquisition of schedule data can be reduced, resources are saved, delay time for acquiring the schedule data is shortened, and response time is shortened. In addition, the client 11 may perform full-scale rendering on the schedule data stored in the local storage space 13, and when the schedule data needs to be acquired from the local storage space 13, the client may directly acquire the rendering data corresponding to the schedule data, so as to reduce delay caused by rendering and shorten response time.
In the application, the schedule data obtained from the local storage space and/or the server side is the schedule data for the user in response to the query request of the user.
Fig. 2 is a flowchart of a method of schedule data processing provided in the first embodiment of the present application. The execution body of the embodiment may be a device for processing calendar data, and in particular may be an application client deployed on an electronic device, where the embodiment is exemplarily illustrated by taking a client of a calendar as an example. As shown in fig. 2, the method specifically comprises the following steps:
Step S201, responding to the received inquiry request of schedule data in a designated time period, and acquiring the first schedule data from a local storage space when the first schedule data in the first sub-time period is stored in the local storage space.
Wherein the first sub-period is one of the specified periods, and the schedule data in the first sub-period is stored in the local storage space.
In this embodiment, the local storage space of the client is used to store the schedule data requested from the server. The local storage space may be a browser cache, a database, or the like, which is not specifically limited in this regard. Alternatively, the local storage space may be a simple small capacity storage space implementation.
In response to a query request for querying schedule data in a specified time period by a user, the client can determine the schedule data in the first sub-time period stored in the local storage space in the schedule data in the specified time period requested at this time, that is, the requested schedule data, according to the time period covered by the schedule data stored in the local storage space and the specified time period.
The specified time period may be a query time period input by the user, or a time period determined by the application according to the query time period input by the user, or the like, and the specified time period may be a month unit, or a week, a day, or even an hour unit, which is not specifically limited herein.
For the part of the requested schedule data, the client side directly reads the requested schedule data from the local storage space, and the client side does not need to acquire the requested schedule data from the server side again.
Step S202, in response to determining that the second schedule data in the second sub-time period is not stored in the local storage space, the second schedule data is acquired from the server side, wherein the designated time period comprises a first sub-time period and a second sub-time period.
Wherein the second sub-period is one of the specified periods, and the schedule data in the second sub-period is not stored in the local storage space.
The specified time period comprises a first sub-time period and a second sub-time period, the first sub-time period and the second sub-time period are not overlapped, and the specified time period is covered after the first sub-time period and the second sub-time period are combined.
In response to a query request for querying schedule data in a specified time period by a user, the client can determine the schedule data in a second sub-time period which is not stored in the local storage space in the user data in the specified time period requested at this time, namely, the unsolicited schedule data, according to the time period covered by the schedule data stored in the local storage space and the specified time period.
For the portion of unsolicited calendar data, the client obtains calendar data for a second sub-period from the server.
In this embodiment, step S201 obtains schedule data in the first sub-period from the local storage space, and step S202 obtains schedule data in the second sub-period from the server, which may be executed in parallel, or may exchange execution order, which is not specifically limited herein.
Step S203, displaying the first schedule data and the second schedule data.
The first schedule data in the first sub-period and the second schedule data in the second sub-period acquired through the above steps S201 to S202 constitute all schedule data in the specified period requested by the user.
And responding to the query request of the user by displaying the first schedule data and the second schedule data after the first schedule data in the first sub-time period and the second schedule data in the second sub-time period are acquired.
According to the embodiment of the application, the schedule data which has been requested from the server side is stored through the local storage space of the client side, the inquiry request for the schedule data in the appointed time period is responded, the first schedule data in the first sub-time period in the appointed time period is stored in the local storage space, and then the first schedule data is acquired from the local storage space; in response to determining that the second schedule data in the second sub-period in the specified period is not stored in the local storage space, the second schedule data is acquired from the server, so that the requested schedule data is directly acquired from the local storage space, and the unsolicited schedule data is acquired from the server, repeated acquisition of the schedule data can be reduced, resources are saved, delay time for acquiring the schedule data is reduced, and response time is shortened.
Fig. 3 is a flowchart of a method of schedule data processing provided in a second embodiment of the present application. On the basis of the first embodiment, in this embodiment, in response to receiving a query request for schedule data in a specified time period, if first schedule data in a first sub-time period is already stored in the local storage space, before acquiring the first schedule data from the local storage space, the method further includes: acquiring a third time period corresponding to the schedule data stored in the local storage space; determining a part of the appointed time period, which coincides with the third time period, to obtain a first sub-time period; and determining a part which is not included in the third time period in the designated time period, and obtaining a second sub-time period.
As shown in fig. 3, the method specifically comprises the following steps:
step S301, in response to receiving a query request for schedule data in a specified time period, acquiring a third time period corresponding to the schedule data stored in the local storage space.
The local storage space of the client is used for storing schedule data requested from the server. The local storage space may be a browser cache, a database, or the like, which is not specifically limited in this regard. Alternatively, the local storage space may be a simple small capacity storage space implementation.
In this embodiment, the client may further store a third period of time corresponding to the schedule data stored in the local storage space, that is, a period of time covered by the schedule data stored in the local storage space.
Further, after updating the schedule data in the local storage space, if the period covered by the schedule data in the local storage space changes, updating the third period corresponding to the schedule data stored in the local storage space, so as to ensure that the third period can accurately record the period covered by the schedule data stored in the local storage space.
Step S302, determining a part of the designated time period, which coincides with the third time period, to obtain a first sub-time period, and determining a part of the designated time period, which is not included in the third time period, to obtain a second sub-time period.
Responding to a query request of a user for querying schedule data in a specified time period, and determining the schedule data in the first sub-time period in the stored specified time period in the local storage space by the client according to a third time period corresponding to the schedule data stored in the local storage space and the specified time period of the query request, if a part overlapping between the specified time period and the third time period exists, taking the part overlapping between the specified time period and the third time period as the first sub-time period. At this time, among the schedule data of the specified period requested this time, the schedule data in the first sub-period is requested by the client from the server side and has been stored in the local storage space.
If the portion not included in the third time period exists in the designated time period, the portion not included in the third time period in the designated time period is taken as a second sub-time period, and the schedule data in the second sub-time period are not requested by the client from the server, are not stored in the local storage space and need to be acquired from the server.
Step S303, acquiring first schedule data in a first sub-period from a local storage space.
In step S302, if there is a first sub-period overlapping between the specified period and the third period, the schedule data in the first sub-period is requested by the client from the server and already stored in the local storage space, among the schedule data of the specified period requested this time.
In the step, the schedule data in the first sub-time period is acquired from the local storage space, and the requested data does not need to be repeatedly acquired from the server side, so that resources can be saved.
Step S304, obtaining schedule data in the second sub-time period from the server side.
In step S302, if the specified time period includes the second sub-time period not included in the third time period, the schedule data in the second sub-time period is not requested from the server side by the client side and is not stored in the local storage space. In the step, the schedule data in the second sub-time period is acquired from the server side.
Step S305, displaying the schedule data in the first sub-period and the schedule data in the second sub-period.
After the schedule data in the first sub-time period and the schedule data in the second sub-time period are obtained, all the schedule data in the appointed time period requested by the user are obtained.
And responding to the query request of the user by displaying the schedule data in the first sub-time period and the schedule data in the second sub-time period after the schedule data in the first sub-time period and the schedule data in the second sub-time period are acquired.
Typically, the calendar data needs to be rendered before it is displayed. In this embodiment, before displaying the schedule data in the first sub-period and the schedule data in the second sub-period, the schedule data in the first sub-period is rendered to obtain the rendering data of the schedule data in the first sub-period, the schedule data in the second sub-period is rendered to obtain the rendering data of the schedule data in the second sub-period, and a basis is provided for displaying the schedule data in the first sub-period and the schedule data in the second sub-period.
Step S306, storing the schedule data in the second sub-time period into a local storage space.
After the calendar data in the second sub-period is obtained from the server in step S304, the calendar data in the second sub-period is stored in the local storage space, so that all the requested calendar data are stored in the local storage space.
Alternatively, in order to ensure that there is no duplicate schedule data in the local storage space, when a certain piece of schedule data is stored in the local storage space, it may be first determined whether there is already data of the schedule in the local storage space, and if there is already data of the schedule in the local storage space, after deleting the data of the schedule in the local storage space, the piece of schedule data is stored in the local storage space. Wherein, a schedule corresponds to a piece of schedule data, and the schedule data can contain identification information of the schedule. The identification information of different schedules is different, and the schedule data of different schedules can be distinguished through the identification information of the schedules.
Further, in response to an update operation of the target schedule data, the target schedule data is updated into the local storage space.
In practical applications, the user may also add, modify or delete calendar data via the client.
In an alternative embodiment, the target schedule data is acquired in response to a new or modified request of a user for the schedule data; the target schedule data is stored in the local storage space, and is synchronized to the server, so that all the schedule data acquired from the server are stored in the local storage space, and can be acquired from the local storage space when a subsequent user requests the schedule data again.
If the schedule data is a modification request for the schedule data, the target schedule data is modified schedule data, when the target schedule data is stored in the local storage space, the schedule data which are stored in the local storage space and have the same schedule identification information are determined according to the schedule identification information in the target schedule data, the original schedule data in the local storage space are replaced by the modified target schedule data, the update of the schedule data in the local storage space is realized, and the latest schedule data of the schedules are stored in the local storage space.
In an optional implementation manner, in response to a user deleting request of the target schedule data, deleting the target schedule data in the local storage space, and sending the deleting request to the server, synchronization of the schedule data in the local storage space and the server is achieved, the schedule data in the local storage space are all real schedule data, and accuracy of the schedule data in the local storage space of the user client is guaranteed.
In an alternative embodiment, a schedule may have multiple users engaged, and the schedule may belong to multiple users at the same time. For example, a meeting calendar may include a plurality of attendees, each of whom is a user of the meeting calendar.
For schedules containing a plurality of users, when one user adds or modifies data containing schedules of other users, the server needs to synchronously modify the schedule data of other users of the schedules stored in the local storage space of the corresponding client. After the service side newly adds or modifies the schedule data of the schedule, the updated schedule data is provided for other users of the schedule, and clients of the other users of the schedule update the schedule data in the local storage space.
Illustratively, in response to a schedule data update notification for the target schedule data sent by the server, the target schedule data in the local storage space is synchronously updated to ensure accuracy of the schedule data in the local storage space of the user client.
Optionally, after the service end newly adds or modifies the schedule data of the schedule, the service end sends a schedule data update notification to other users of the schedule. And the clients of other users of the schedule acquire target schedule data to be updated from the server according to the schedule data update notification, and update the target schedule data in the local storage space.
Alternatively, the server may directly push the target calendar data carried in the calendar data update notification to clients of other users of the calendar. The clients of other users of the schedule receive the target schedule data pushed by the server and update the target schedule data in the local storage space.
The server maintains a long connection with the client, and when the schedule data of the server changes, the difference data of the change transmission can be pushed to the client through the long connection, so that the difference data can be updated minimally, and the maintenance cost of the client is reduced.
Further, when the schedule data in the local storage space is changed, the period covered by the schedule data stored in the local storage space may be changed. Therefore, when the schedule data in the local storage space is changed, it can be judged whether or not the period covered by the schedule data in the local storage space is changed.
When the time period covered by the schedule data in the local storage space changes, updating the third time period of the schedule data stored in the local storage space to ensure that the third time period accurately records the time period covered by the schedule data stored in the local storage space, namely, the third time period accurately records the schedule data requested by the client.
The scheme of the embodiment of the application can furthest reduce the request times and the request data quantity of the client, improve the performance of schedule data request, shorten the response time and improve the use experience of users.
In another implementation manner of the embodiment, the schedule data stored in the local storage space may be fully rendered, and the rendering data of the schedule data stored in the local storage space may be stored. When the stored target schedule data needs to be acquired from the local storage space, rendering data corresponding to the stored target schedule data can be directly acquired.
Alternatively, the schedule data stored in the local storage space may be the rendered schedule data, and at this time, the local storage space may be a storage space for storing the rendering data of the schedule data.
Illustratively, in response to a start request of an application where the schedule data is located, rendering the schedule data stored in the local storage space to obtain rendering data of the schedule data stored in the local storage space; rendering data is stored. Therefore, when the stored schedule data is acquired, the rendering data of the stored schedule data can be directly acquired and displayed, the efficiency of the schedule data rendering is improved, the response time of the schedule data query request is shortened, and the response timeliness is improved.
The storage space of the rendering data may be different from the local storage space of the schedule data, and the storage mode of the rendering data obtained by obtaining the schedule data and rendering in the prior art may be the same for the storage of the rendering data, which is not described herein.
When the schedule data in the local storage space changes, the rendering data of the stored schedule data are synchronously updated to store the full rendering data of the schedule data in the local storage space, and when the schedule data are required to be acquired from the local storage space, the rendering data of the stored schedule data can be directly acquired, the response time of the schedule data query request can be shortened, and the response timeliness is improved.
Illustratively, in the above step S303, rendering data corresponding to the schedule data in the first sub-period may be acquired.
Optionally, when schedule data in the local storage space is newly added or updated, rendering the newly added or updated difference data to obtain rendering data of the difference data; according to the rendering data of the difference data, the stored rendering data of the schedule data are updated, and the efficiency of rendering the schedule data can be improved.
Illustratively, after the schedule data in the second sub-period is stored in the local storage space in the above step S306, the rendering data of the schedule data in the second sub-period may also be stored.
When deleting at least one piece of schedule data in the local storage space, deleting rendering data of the at least one piece of schedule data to ensure that the rendering data of the schedule data corresponds to the stored schedule data and ensure the accuracy of the rendering data.
For example, for calendar applications, the calendar component may perform rendering of schedule data, when the calendar component performs full-volume rendering of the schedule data stored in the local storage space, the full-volume rendering of the schedule data stored in the local storage space is performed on the calendar component, when the user requests the stored schedule data again, the requested schedule data is already rendered on the calendar component, no data difference is needed, and repeated request and rendering of the data are not needed, and repeated acquisition and rendering of the schedule data from the server side are not needed; even if the difference data exists, only the difference data is updated and rendered, other schedule data cannot be requested and rendered again, and the problem of screen flickering caused by rendering the schedule data can be reduced.
According to the embodiment of the application, the schedule data stored in the local storage space is subjected to full-scale rendering, and the rendering data of the schedule data are stored, so that when the locally stored schedule data are acquired, the rendering data of the stored schedule data can be directly acquired and displayed, the efficiency of rendering the schedule data is improved, the response time of a schedule data inquiry request is shortened, and the timeliness of response is improved. Further, when the schedule data in the local storage space is newly added or updated, the newly added or updated difference data is rendered, and the rendering data of the difference data is updated, so that the efficiency of the schedule data rendering can be improved, the repeated request and repeated rendering problems caused by the difference data can be reduced, the server resources are saved, and the overall loading speed and performance of the schedule data are improved.
Fig. 4 is a schematic view of an apparatus for processing schedule data provided in a third embodiment of the present application. The schedule data processing device provided by the embodiment of the application can execute the processing flow provided by the schedule data processing method embodiment. As shown in fig. 4, the schedule data processing apparatus 40 includes: a local schedule data acquisition unit 401, a remote schedule data acquisition unit 402, and a schedule data display unit 403.
Specifically, the local schedule data obtaining unit 401 is configured to obtain, in response to receiving a query request for schedule data in a specified period of time, and in the local storage space, first schedule data in a first sub-period of time has been stored, the first schedule data from the local storage space.
The remote schedule data acquisition unit 402 is configured to acquire the second schedule data from the server in response to determining that the second schedule data in the second sub-period is not stored in the local storage space, where the specified period includes the first sub-period and the second sub-period.
A schedule data display unit 403 for displaying the first schedule data and the second schedule data.
The device provided in the embodiment of the present application may be specifically used to execute the method embodiment provided in the first embodiment, and specific functions are not described herein.
According to the embodiment of the application, the schedule data which has been requested from the server side is stored through the local storage space of the client side, the inquiry request for the schedule data in the appointed time period is responded, the first schedule data in the first sub-time period in the appointed time period is stored in the local storage space, and then the first schedule data is acquired from the local storage space; in response to determining that the second schedule data in the second sub-period in the specified period is not stored in the local storage space, the second schedule data is acquired from the server, so that the requested schedule data is directly acquired from the local storage space, and the unsolicited schedule data is acquired from the server, repeated acquisition of the schedule data can be reduced, resources are saved, delay time for acquiring the schedule data is reduced, and response time is shortened.
Fig. 5 is a schematic view of an apparatus for processing schedule data provided in a fourth embodiment of the present application. The schedule data processing device provided by the embodiment of the application can execute the processing flow provided by the schedule data processing method embodiment. As shown in fig. 5, the schedule data processing apparatus 50 includes: a local schedule data acquisition unit 501, a remote schedule data acquisition unit 502, and a schedule data display unit 503.
Specifically, the local schedule data obtaining unit 501 is configured to obtain, in response to receiving a query request for schedule data in a specified period of time, and in the local storage space, first schedule data in a first sub-period of time is already stored, the first schedule data from the local storage space.
The remote schedule data obtaining unit 502 is configured to obtain, in response to determining that the second schedule data in the second sub-period is not stored in the local storage space, the second schedule data from the server, where the specified period includes a first sub-period and a second sub-period.
A schedule data display unit 503 for displaying the first schedule data and the second schedule data.
Optionally, as shown in fig. 5, the apparatus 50 for calendar data processing further includes: the time range matching unit 504.
The time range matching unit 504 is configured to:
Acquiring a third time period corresponding to the schedule data stored in the local storage space; determining a part of the appointed time period, which coincides with the third time period, to obtain a first sub-time period; and determining a part which is not included in the third time period in the designated time period, and obtaining a second sub-time period.
Optionally, as shown in fig. 5, the apparatus 50 for calendar data processing further includes: a schedule data management unit 505.
The schedule data management unit 505 is configured to:
And in response to determining that the second schedule data in the second sub-time period is not stored in the local storage space, after the second schedule data is acquired from the server, storing the second schedule data in the local storage space.
Optionally, the schedule data stored in the local storage space is rendered schedule data.
The apparatus provided in the embodiment of the present application may be specifically used to execute the method embodiment provided in the second embodiment, and specific functions are not described herein.
According to the embodiment of the application, the schedule data stored in the local storage space is subjected to full-scale rendering, and the rendering data of the schedule data are stored, so that when the schedule data are acquired locally, the rendering data of the stored schedule data can be directly acquired and displayed, the efficiency of rendering the schedule data is improved, the response time of a schedule data inquiry request is shortened, and the timeliness of the response is improved. Further, when the schedule data in the local storage space is newly added or updated, the newly added or updated difference data is rendered, and the rendering data of the difference data is updated, so that the efficiency of the schedule data rendering can be improved, the repeated request and repeated rendering problems caused by the difference data can be reduced, the server resources are saved, and the overall loading speed and performance of the schedule data are improved.
According to an embodiment of the present application, the present application also provides an electronic device and a readable storage medium.
According to an embodiment of the present application, there is also provided a computer program product comprising: a computer program stored in a readable storage medium, from which at least one processor of an electronic device can read, the at least one processor executing the computer program causing the electronic device to perform the solution provided by any one of the embodiments described above.
Fig. 6 shows a schematic block diagram of an example electronic device 600 that may be used to implement an embodiment of the application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 6, the electronic device 600 includes a computing unit 601 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 602 or a computer program loaded from a storage unit 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the device 600 may also be stored. The computing unit 601, ROM 602, and RAM 603 are connected to each other by a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Various components in the device 600 are connected to the I/O interface 605, including: an input unit 606 such as a keyboard, mouse, etc.; an output unit 607 such as various types of displays, speakers, and the like; a storage unit 608, such as a magnetic disk, optical disk, or the like; and a communication unit 609 such as a network card, modem, wireless communication transceiver, etc. The communication unit 609 allows the device 600 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The computing unit 601 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 601 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 601 performs the respective methods and processes described above, for example, a method of schedule data processing. For example, in some embodiments, the method of calendar data processing may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 608. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 600 via the ROM 602 and/or the communication unit 609. When a computer program is loaded into the RAM 603 and executed by the computing unit 601, one or more steps of the method of calendar data processing described above may be performed. Alternatively, in other embodiments, the computing unit 601 may be configured to perform the method of calendar data processing in any other suitable way (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service ("Virtual PRIVATE SERVER" or simply "VPS") are overcome. The server may also be a server of a distributed system or a server that incorporates a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present application may be performed in parallel, sequentially, or in a different order, provided that the desired results of the disclosed embodiments are achieved, and are not limited herein.
The above embodiments do not limit the scope of the present application. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present application should be included in the scope of the present application.
Claims (10)
1. A method of calendar data processing, comprising:
Responding to a query request of schedule data in a designated time period, if first schedule data in a first sub-time period is stored in a local storage space, acquiring the first schedule data from the local storage space, wherein the local storage space is used for storing the schedule data which has been requested from a server;
in response to determining that the second schedule data in the second sub-time period is not stored in the local storage space, acquiring the second schedule data from the server, wherein the specified time period comprises the first sub-time period and the second sub-time period;
Displaying the first schedule data and the second schedule data;
If the local storage space stores the first schedule data in the first sub-period, before the first schedule data is obtained from the local storage space, the method further includes:
acquiring a third time period corresponding to the schedule data stored in the local storage space;
Determining a part of the appointed time period, which coincides with the third time period, and obtaining the first sub-time period;
And determining a part which is not included in the third time period in the appointed time period, and obtaining the second sub-time period.
2. The method of claim 1, wherein, in response to determining that the second calendar data within the second sub-period is not stored in the local storage space, after obtaining the second calendar data from the server side, further comprising:
and storing the second schedule data into the local storage space.
3. The method of claim 1, wherein the method further comprises:
and in response to an update operation of the target schedule data, updating the target schedule data into the local storage space.
4. The method of any of claims 1-3, wherein the calendar data stored in the local storage space is rendered calendar data.
5. An apparatus for calendar data processing, comprising:
A local schedule data acquisition unit, configured to respond to a received query request for schedule data in a specified time period, and if first schedule data in a first sub-time period is already stored in a local storage space, acquire the first schedule data from the local storage space, where the local storage space is used for storing schedule data that has been requested from a server;
A remote schedule data acquisition unit configured to acquire second schedule data from the server in response to determining that the second schedule data in a second sub-period is not stored in the local storage space, wherein the specified period includes the first sub-period and the second sub-period;
A schedule data display unit for displaying the first schedule data and the second schedule data;
Further comprises: a time period matching unit for:
acquiring a third time period corresponding to the schedule data stored in the local storage space;
Determining a part of the appointed time period, which coincides with the third time period, and obtaining the first sub-time period;
And determining a part which is not included in the third time period in the appointed time period, and obtaining the second sub-time period.
6. The apparatus of claim 5, further comprising a schedule data management unit for:
And in response to determining that the second schedule data in the second sub-time period is not stored in the local storage space, after the second schedule data is acquired from the server, storing the second schedule data into the local storage space.
7. The apparatus of claim 5 or 6, wherein the calendar data stored in the local storage space is rendered calendar data.
8. An electronic device, comprising:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-4.
9. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-4.
10. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110216666.0A CN112948461B (en) | 2021-02-26 | 2021-02-26 | Method, apparatus, storage medium and program product for calendar data processing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110216666.0A CN112948461B (en) | 2021-02-26 | 2021-02-26 | Method, apparatus, storage medium and program product for calendar data processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112948461A CN112948461A (en) | 2021-06-11 |
| CN112948461B true CN112948461B (en) | 2024-05-10 |
Family
ID=76246427
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110216666.0A Active CN112948461B (en) | 2021-02-26 | 2021-02-26 | Method, apparatus, storage medium and program product for calendar data processing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112948461B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003091511A (en) * | 2001-09-18 | 2003-03-28 | Cybozu Inc | Schedule management device and program |
| JP2011145820A (en) * | 2010-01-13 | 2011-07-28 | Fujifilm Corp | Client terminal of medical facility, schedule data backup method for reservation for medical examination and reservation reception system for the medical examination |
| CN102768742A (en) * | 2011-04-30 | 2012-11-07 | 镇江金钛软件有限公司 | Execution time localizing method for additional plan based on original schedule information |
| CN110069267A (en) * | 2019-03-15 | 2019-07-30 | 平安普惠企业管理有限公司 | Data-updating method, device, computer equipment and storage medium |
| CN110312039A (en) * | 2019-06-28 | 2019-10-08 | Oppo（重庆）智能科技有限公司 | Calendar prompting method and relevant apparatus |
| CN111222034A (en) * | 2019-12-31 | 2020-06-02 | 湖南华菱涟源钢铁有限公司 | Data mobile display method and device and cloud server |
| CN112115114A (en) * | 2020-09-25 | 2020-12-22 | 北京百度网讯科技有限公司 | Log processing method, device, equipment and storage medium |
-
2021
- 2021-02-26 CN CN202110216666.0A patent/CN112948461B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003091511A (en) * | 2001-09-18 | 2003-03-28 | Cybozu Inc | Schedule management device and program |
| JP2011145820A (en) * | 2010-01-13 | 2011-07-28 | Fujifilm Corp | Client terminal of medical facility, schedule data backup method for reservation for medical examination and reservation reception system for the medical examination |
| CN102768742A (en) * | 2011-04-30 | 2012-11-07 | 镇江金钛软件有限公司 | Execution time localizing method for additional plan based on original schedule information |
| CN110069267A (en) * | 2019-03-15 | 2019-07-30 | 平安普惠企业管理有限公司 | Data-updating method, device, computer equipment and storage medium |
| CN110312039A (en) * | 2019-06-28 | 2019-10-08 | Oppo（重庆）智能科技有限公司 | Calendar prompting method and relevant apparatus |
| CN111222034A (en) * | 2019-12-31 | 2020-06-02 | 湖南华菱涟源钢铁有限公司 | Data mobile display method and device and cloud server |
| CN112115114A (en) * | 2020-09-25 | 2020-12-22 | 北京百度网讯科技有限公司 | Log processing method, device, equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| A scheduling algorithm for autonomous driving tasks on mobile edge computing servers;Hongjun Dai .etal;Journal of Systems Architecture;第94卷;14-23 * |
| 基于操作日志的云存储服务多终端同步算法;张晓杰 等;计算机工程与设计;第34卷(第11期);3894-3899 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112948461A (en) | 2021-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113641457B (en) | Container creation method, device, apparatus, medium, and program product | |
| CN110389812B (en) | Method, apparatus, and computer-readable storage medium for managing virtual machines | |
| CN108011949B (en) | Method and apparatus for acquiring data | |
| CN113364877B (en) | Data processing method, device, electronic equipment and medium | |
| CN113961510B (en) | File processing method, device, equipment and storage medium | |
| CN109213604A (en) | A kind of management method and device of data source | |
| CN116089090A (en) | Virtual resource configuration method, device, equipment and medium of graphic display | |
| CN111414356A (en) | Data storage method and device, non-relational database system and storage medium | |
| CN112948461B (en) | Method, apparatus, storage medium and program product for calendar data processing | |
| CN115982148A (en) | Database table processing method and device, electronic equipment and storage medium | |
| CN116185578A (en) | Scheduling method of computing task and executing method of computing task | |
| CN115543423A (en) | Method, device and equipment for generating benchmarks and storage medium | |
| CN113051244B (en) | Data access method and device, and data acquisition method and device | |
| CN113656144B (en) | Data release system, method and device, electronic equipment and storage medium | |
| CN113360689B (en) | Image retrieval system, method, related device and computer program product | |
| CN115993942B (en) | Data caching method, device, electronic equipment and computer readable medium | |
| CN111782592B (en) | Method, device and system for dividing data | |
| CN116541438A (en) | Data query method, device, equipment and storage medium | |
| CN112600918A (en) | BS architecture-based industrial control edge big data efficient processing method and system | |
| CN115357641A (en) | Data query method and device, electronic equipment and storage medium | |
| CN112882820A (en) | Method and device for configuring resources | |
| CN115687529A (en) | Data synchronization method and device, electronic equipment and storage medium | |
| CN115309568A (en) | Method, device, equipment and medium for realizing multi-process file sharing | |
| CN115952154A (en) | Data processing method, device and system for industrial Internet of things | |
| CN115858104A (en) | Method, device and equipment for acquiring snapshot of transaction commit sequence number and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |