CN111625566A - Data caching method, device, medium and equipment - Google Patents

Data caching method, device, medium and equipment Download PDF

Info

Publication number
CN111625566A
CN111625566A CN202010476606.8A CN202010476606A CN111625566A CN 111625566 A CN111625566 A CN 111625566A CN 202010476606 A CN202010476606 A CN 202010476606A CN 111625566 A CN111625566 A CN 111625566A
Authority
CN
China
Prior art keywords
data
cache data
expiration time
requested
validity period
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.)
Pending
Application number
CN202010476606.8A
Other languages
Chinese (zh)
Inventor
侯文杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing ByteDance Network Technology Co Ltd
Original Assignee
Beijing ByteDance Network Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing ByteDance Network Technology Co Ltd filed Critical Beijing ByteDance Network Technology Co Ltd
Priority to CN202010476606.8A priority Critical patent/CN111625566A/en
Publication of CN111625566A publication Critical patent/CN111625566A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24552Database cache management

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The disclosure relates to a data caching method, a data caching device, a data caching medium and data caching equipment, which belong to the field of data storage and can effectively avoid database crash. A data caching method, comprising: discretizing the validity period of the cached data; and allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not identical.

Description

Data caching method, device, medium and equipment
Technical Field
The present disclosure relates to the field of data storage, and in particular, to a data caching method, apparatus, medium, and device.
Background
When caching is performed, sometimes a data request is associated with a large amount of data, and if the caching of the data is all expired at the same time, all the data needs to be read again into the database, which can cause high time consumption of a single request and even cause crash of the database.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
In a first aspect, the present disclosure provides a data caching method, including: discretizing the validity period of the cached data; and allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not identical.
In a second aspect, the present disclosure provides a data caching apparatus, including: the discretization processing module is used for discretizing the validity period of the cache data; and the allocation module is used for allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not completely the same.
In a third aspect, the present disclosure provides a computer readable medium having stored thereon a computer program which, when executed by a processing apparatus, performs the steps of the method of the first aspect of the present disclosure.
In a fourth aspect, an electronic device is provided, comprising: a storage device having a computer program stored thereon; processing means for executing the computer program in the storage means to implement the steps of the method of the first aspect of the present disclosure.
According to the technical scheme, the valid periods of the cache data are discretized, and the valid periods of the cache data are not completely the same, so that the cache data cannot be completely expired at the same time, and further, the requested cache data cannot be completely expired at the same time under the condition that one data request is associated with a large amount of data, so that the requested data do not need to be read again from the database, and the condition that the database is crashed due to high time consumption of a single request for the database is avoided.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
In the drawings:
fig. 1 is a flow chart of a data caching method according to an embodiment of the present disclosure.
Fig. 2 is a schematic block diagram of a data caching apparatus according to an embodiment of the present disclosure.
FIG. 3 is yet another schematic block diagram of a data caching apparatus according to an embodiment of the present disclosure.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.
The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
Fig. 1 is a flow chart of a data caching method according to an embodiment of the present disclosure. As shown in fig. 1, the data caching method includes the following steps S11 and S12.
In step S11, the validity period of the cache data is discretized.
The validity period of the cache data refers to a time period from the start of caching the cache data to the expiration of the cache data.
The discretization processing refers to processing that the validity periods of the respective data cached in the cache are not exactly the same. That is, the validity periods of all the cached data may be completely different, or the validity periods of some cached data may be the same, for example, different validity periods may be set according to different data types, different validity periods may be set according to different hot spot degrees of the data, different validity periods may be set according to different importance degrees of the data, and the like.
The discretization processing may be implemented in various ways, for example, the validity period of each cache data may be discretized by using a preset validity period value, or the validity period of the cache data may be discretized by using a random number generation method.
In step S12, the validity periods after the discretization process are assigned to the respective cache data, wherein the validity periods of the respective cache data are not completely the same.
According to the technical scheme, the valid periods of the cache data are discretized, and the valid periods of the cache data are not completely the same, so that the cache data cannot be completely expired at the same time, the cache hit probability is effectively improved, and the requested cache data cannot be completely expired at the same time under the condition that one data request is associated with a large amount of data, so that the requested data do not need to be read again from the database, and the condition that the database is crashed due to high time consumption of a single request for the database is avoided. For example, if the cache data a expires after 5.6 seconds, the cache data B expires after 5.2 seconds, and the cache data C expires after 6.8 seconds due to the discretization process, if the cache data associated with a data request includes the cache data a, the cache data B, and the cache data C, and the data request is received at 5.3 seconds, the cache data B expires and the cache data a and C continue to be valid, that is, only the cache data B needs to be read from the database again after the data request is received, so that the time consumption and load of a single request to the database are reduced, and the database crash is effectively avoided.
In an embodiment, the data caching method according to the embodiment of the present disclosure may further include: after the cache data acquisition request is received, checking an expiration time of the requested cache data, the expiration time indicating how long the requested cache data has expired; and under the condition that the expiration time meets the preset condition, prolonging the expiration time of the requested cache data.
Wherein the preset condition may be at least one of the following: the expiration time is less than a preset threshold (e.g., 1 second); the expiration time is less than a preset percentage (e.g., 10%) of the validity period of the cached data.
In addition, the expiration time of the requested cached data may be extended in a number of ways. For example, the discretization process described above can be utilized to extend the expiration time of the requested cached data; the expiration time of the requested cache data may also be extended by extending the expiration time of the requested cache data by the expiration time duration, for example, assuming that the expiration time of the requested cache data is 10 seconds and it is still 1 second to expire, the cache data may be extended by another 10 seconds, that is, it is made to expire after 11 seconds.
By means of the arrangement, after the cache data acquisition request is received, the validity period of the cache data associated with the request can be effectively prolonged, and the associated data can be prevented from being downloaded from the database again. For example, if the hot data is in a short time, the cache will not expire basically during the data request period, so that the cache hit probability is effectively improved, and the service performance is enhanced.
Fig. 2 is a schematic block diagram of a data caching apparatus according to an embodiment of the present disclosure. As shown in fig. 2, the data buffer device 2 includes: the discretization processing module 21 is used for discretizing the validity period of the cache data; and an allocating module 22, configured to allocate the validity periods after the discretization processing to each cache data, where the validity periods of the cache data are not completely the same.
According to the technical scheme, the valid periods of the cache data are discretized, and the valid periods of the cache data are not completely the same, so that the cache data cannot be completely expired at the same time, the cache hit probability is effectively improved, and the requested cache data cannot be completely expired at the same time under the condition that one data request is associated with a large amount of data, so that the requested data do not need to be read again from the database, and the condition that the database is crashed due to high time consumption of a single request for the database is avoided.
FIG. 3 is yet another schematic block diagram of a data caching apparatus according to an embodiment of the present disclosure. As shown in fig. 3, the data buffer device 2 further includes: a checking module 23, configured to check an expiration time of the requested cached data after the cached data acquisition request is received, where the expiration time indicates how long the requested cached data has expired; and the prolonging module 24 is used for prolonging the expiration time of the requested cache data under the condition that the expiration time meets the preset condition.
Optionally, the preset condition is at least one of the following: the expiration time is less than a preset threshold; the expiration time is less than a preset percentage of the validity period of the cached data.
Optionally, the extension module 24 is configured to: extending the expiration time of the requested cached data using a discretization process; or by extending the expiration time of the requested cached data by the expiration time of the validity period.
Optionally, the discretization processing module 21 is configured to: and carrying out discretization processing on the validity period of the cache data by using a random number generation method.
Referring now to FIG. 4, a block diagram of an electronic device 600 suitable for use in implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 4 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of the embodiments of the present disclosure.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having 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. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText transfer protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: discretizing the validity period of the cached data; and allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not identical.
Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present disclosure may be implemented by software or hardware. Wherein the name of a module in some cases does not constitute a limitation on the module itself.
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
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. A 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.
Example 1 provides, in accordance with one or more embodiments of the present disclosure, a data caching method, comprising: discretizing the validity period of the cached data; and allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not identical.
Example 2 provides the method of example 1, further comprising, in accordance with one or more embodiments of the present disclosure: after a cache data acquisition request is received, checking an expiration time of the requested cache data, the expiration time indicating how long the requested cache data has expired; and under the condition that the expiration time meets a preset condition, prolonging the expiration time of the requested cache data.
Example 3 provides the method of example 1, further comprising, in accordance with one or more embodiments of the present disclosure: the preset condition is at least one of the following: the expiration time is less than a preset threshold; the expiration time is less than a preset percentage of the validity period of the cached data.
Example 4 provides the method of example 1, further comprising, in accordance with one or more embodiments of the present disclosure: the extending the expiration time of the requested cached data includes: extending an expiration time of the requested cached data using the discretization process; or extending the expiration time of the requested cached data by the expiration time duration.
Example 5 provides the method of example 1, further comprising, in accordance with one or more embodiments of the present disclosure: the discretization of the validity period of the cache data comprises the following steps: and carrying out discretization processing on the validity period of the cache data by using a random number generation method.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims. With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Claims (10)

1. A method for caching data, comprising:
discretizing the validity period of the cached data;
and allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not identical.
2. The method of claim 1, further comprising:
after a cache data acquisition request is received, checking an expiration time of the requested cache data, the expiration time indicating how long the requested cache data has expired;
and under the condition that the expiration time meets a preset condition, prolonging the expiration time of the requested cache data.
3. The method according to claim 2, wherein the preset condition is at least one of: the expiration time is less than a preset threshold; the expiration time is less than a preset percentage of the validity period of the cached data.
4. The method of claim 2, wherein extending the expiration time of the requested cached data comprises:
extending an expiration time of the requested cached data using the discretization process; or
And prolonging the expiration time of the requested cache data by the validity period length.
5. The method of claim 1, wherein discretizing the validity period of the buffered data comprises:
and carrying out discretization processing on the validity period of the cache data by using a random number generation method.
6. A data caching apparatus, comprising:
the discretization processing module is used for discretizing the validity period of the cache data;
and the allocation module is used for allocating the validity period after the discretization processing to each cache data, wherein the validity periods of the cache data are not completely the same.
7. The apparatus of claim 6, further comprising:
a checking module, configured to check an expiration time of the requested cache data after the cache data acquisition request is received, where the expiration time indicates how long the requested cache data has expired;
and the extension module is used for extending the expiration time of the requested cache data under the condition that the expiration time meets the preset condition.
8. The apparatus of claim 7, wherein the extension module is to:
extending an expiration time of the requested cached data using the discretization process; or
And prolonging the expiration time of the requested cache data by the validity period length.
9. A computer-readable medium, on which a computer program is stored, characterized in that the program, when being executed by processing means, carries out the steps of the method of any one of claims 1 to 5.
10. An electronic device, comprising:
a storage device having a computer program stored thereon;
processing means for executing the computer program in the storage means to carry out the steps of the method according to any one of claims 1 to 5.
CN202010476606.8A 2020-05-29 2020-05-29 Data caching method, device, medium and equipment Pending CN111625566A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010476606.8A CN111625566A (en) 2020-05-29 2020-05-29 Data caching method, device, medium and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010476606.8A CN111625566A (en) 2020-05-29 2020-05-29 Data caching method, device, medium and equipment

Publications (1)

Publication Number Publication Date
CN111625566A true CN111625566A (en) 2020-09-04

Family

ID=72258230

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010476606.8A Pending CN111625566A (en) 2020-05-29 2020-05-29 Data caching method, device, medium and equipment

Country Status (1)

Country Link
CN (1) CN111625566A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104917829A (en) * 2015-05-27 2015-09-16 努比亚技术有限公司 Background data management method and device
CN110069419A (en) * 2018-09-04 2019-07-30 中国平安人寿保险股份有限公司 Multilevel cache system and its access control method, equipment and storage medium
CN110543492A (en) * 2019-08-13 2019-12-06 中国银行股份有限公司 Method and device for preventing cache from failing
CN111131856A (en) * 2019-12-31 2020-05-08 北京奇艺世纪科技有限公司 Cache expiration time adjusting method and device, electronic equipment and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104917829A (en) * 2015-05-27 2015-09-16 努比亚技术有限公司 Background data management method and device
CN110069419A (en) * 2018-09-04 2019-07-30 中国平安人寿保险股份有限公司 Multilevel cache system and its access control method, equipment and storage medium
CN110543492A (en) * 2019-08-13 2019-12-06 中国银行股份有限公司 Method and device for preventing cache from failing
CN111131856A (en) * 2019-12-31 2020-05-08 北京奇艺世纪科技有限公司 Cache expiration time adjusting method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
CN111488185B (en) Page data processing method, device, electronic equipment and readable medium
CN111209306A (en) Business logic judgment method and device, electronic equipment and storage medium
CN112035529A (en) Caching method and device, electronic equipment and computer readable storage medium
CN112256733A (en) Data caching method and device, electronic equipment and computer readable storage medium
CN113760536A (en) Data caching method and device, electronic equipment and computer readable medium
CN110781437A (en) Method and device for acquiring webpage image loading duration and electronic equipment
CN112379982A (en) Task processing method and device, electronic equipment and computer readable storage medium
CN110768861B (en) Method, device, medium and electronic equipment for obtaining overtime threshold
CN111596992B (en) Navigation bar display method and device and electronic equipment
CN112181733A (en) Service request processing method, device, equipment and storage medium
CN112422551A (en) SSL certificate updating method and device, electronic equipment and storage medium
CN111459893B (en) File processing method and device and electronic equipment
CN111625566A (en) Data caching method, device, medium and equipment
CN111444457B (en) Data release method and device, storage medium and electronic equipment
CN112163176A (en) Data storage method and device, electronic equipment and computer readable medium
CN113127282A (en) Frame capability determining method and device, electronic equipment and storage medium
CN113518183A (en) Camera calling method and device and electronic equipment
CN112100211A (en) Data storage method and device, electronic equipment and computer readable medium
CN111538721A (en) Account processing method and device, electronic equipment and computer readable storage medium
CN111580890A (en) Method, apparatus, electronic device, and computer-readable medium for processing features
CN111756833A (en) Node processing method and device, electronic equipment and computer readable medium
CN111241443A (en) Method and device for pushing information and electronic equipment
CN112948108B (en) Request processing method and device and electronic equipment
CN111626787B (en) Resource issuing method, device, medium and equipment
CN110716885B (en) Data management method and device, electronic equipment 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