CN102117338A - Data base caching method - Google Patents
Data base caching method Download PDFInfo
- Publication number
- CN102117338A CN102117338A CN 201110083447 CN201110083447A CN102117338A CN 102117338 A CN102117338 A CN 102117338A CN 201110083447 CN201110083447 CN 201110083447 CN 201110083447 A CN201110083447 A CN 201110083447A CN 102117338 A CN102117338 A CN 102117338A
- Authority
- CN
- China
- Prior art keywords
- data
- buffer memory
- key
- database
- zone
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000015654 memory Effects 0.000 claims description 74
- 238000013507 mapping Methods 0.000 claims description 22
- 238000012217 deletion Methods 0.000 claims description 9
- 230000037430 deletion Effects 0.000 claims description 9
- 238000013506 data mapping Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 230000006378 damage Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000033772 system development Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data base caching method. Besides an original caching data, two new caching areas are constructed, and the data mapping relationship based on caching is constructed through three caching areas; and in a large-scale data system, on condition that a caching system is ensured to be used, the content needing to be updated timely can be located fast in the huge caching system for the aggregate caching data, and all the caching data related to the content can be updated.
Description
Technical field
The present invention relates to database technical field, relate in particular to a kind of method of database caches.
Background technology
In the network application that faces extensive visit, database often becomes the bottleneck of total system.Be to reduce database access pressure, the caching mechanism of the widely used employing of current internet such as MemCache is used for data cachedly, to reduce the access times of application server to database, improves system responses efficient.Current Miscellaneous Documents buffer memory, memory cache system development are rapid, for application developer provides a lot of selections, these buffer memorys often adopt the mapping mechanism of Key-Value, each Key(key assignments or buffer memory title) corresponding concrete Value(memory contents), application program writes or reads required data by specific Key, and being set to the buffer memory expired time of certain-length, caching system safeguards that according to this time these are data cached.
The prior art scheme is when carrying out caching process, can set different key according to current content earlier, and corresponding content is written in the relevant buffer memory of this Key goes, the Key naming rule of buffer memory usually and content-data exist certain to contact directly, as shown in Figure 1, other form unique identifier of the major key of content or content in the ID(database for example) be that its buffer memory of this content Key of 10 can called after single_10, this mechanism makes the ID by content can access associated buffer memory Key.
Owing to the reason that adopts buffer memory, in the needs data, application program is reading of data from buffer memory directly, no doubt makes that the visit of data is faster, system pressure reduces, but also just because the relation of buffer memory makes data often can not be upgraded in time, when some key data need real time modifying to upgrade, existing way or when writing buffer memory, just its expired time setting is shorter, perhaps delete certain Key to the caching system request, perhaps clear-cut integral body empties buffer memory.
The buffer memory ratio that existing scheme solves the wall scroll content is easier to realize, but for the assembly type buffer memory of preserving contents list intractable then.
Existing to the use of buffer memory or simply rely on the automatic expired time of buffer memory, shorter with its setting, make it be unlikely to delay time long, but must be modified in some very crucial susceptibility contents, when deleting, even if be provided with relatively short cache-time, but in this time, should content deleted or that upgrade still can be accessed to, can cause bigger content safety problem.
Adopt the whole way that empties buffer memory no doubt can solve the untimely problem of Data Update, but can cause system load to be risen, when especially this operation was relatively more frequent, buffer memory lost it substantially and should produce effect.
And when adopting the request caching system to delete single Key, be applicable to the buffer memory of single content, and be not suitable for the assembly type buffer memory of many contents.When data are very huge, because the complicacy of content revealing, having very big probability in same one represents in different list area, as shown in Figure 2, this content of Content1 for example, may in a plurality of contents lisies, repeatedly occur, and the buffer memory system can be with the whole buffer memory of whole list area, for example having set up key is the set buffer memory of list_n, its Value has comprised all the elements that all these tabulations have, so that application program can once read all data, play the purpose of buffer memory.
Existing using method to buffer memory in large-scale data, is difficult to the assembly type buffer memory that finds all to comprise this content fast of low performance consumption, and guarantees that all buffer memorys all upgrade in time, and Key of obviously simple deletion can not address this problem.
Summary of the invention
The objective of the invention is to propose a kind of method of database caches, when taking into account access performance, but realize the buffer memory of index, solved the technical matters when relating to content security etc. and need upgrade content in time.
For reaching this purpose, the present invention by the following technical solutions:
A kind of method of database caches may further comprise the steps:
When A, buffer memory of database generation, with the data cached conventional zone of leaving in the buffer memory, data cached all the elements that comprise a list request;
B, generation comprise the array data of the unique identifier of described all the elements, leave the mapping area in the buffer memory in, and the key assignments of described array data and described data cached key-value pair should;
C, need to upgrade or when deleting a content, set up a value for empty data, leave the renewal zone in the buffer memory in, the key assignments of described assigning null data comprises the unique identifier of a described content;
D, fashionable when access data sets closes corresponding key assignments according to the naming rule generation data set;
E, search mapping area, judge whether to have the key assignments identical key assignments corresponding, if there is no, then go to step F,, then go to step G if exist with data acquisition;
F, not need in the buffer memory to confirm the data acquisition of visiting, accessing database obtains the data acquisition that needs visit, exports;
G, take out the array that key-value pair is answered, obtain the unique identifier of described all the elements that array comprises from mapping area;
H, according to the unique identifier of described all the elements, judge in upgrading the zone whether have the key assignments identical one by one with unique identifier, if exist, then go to step I, if there is no, then go to step J;
Described data cached in the conventional zone of I, deletion, accessing database obtains the data acquisition that needs visit, exports;
J, data cached from the acquisition of conventional zone exports.
Conventional zone and mapping area in the buffer memory are provided with expired time, when expired time arrives, and all data of conventional zone of deletion and mapping area.
In the step F, obtain the data acquisition that needs visit after, will return steps A.
Among the step I, obtain the data acquisition that needs visit after, will return steps A.
Adopted technical scheme of the present invention, buffer memory has been carried out map index by simple mode, make that buffer memory can be by real-time update, when doing to upgrade judgement, rely on small mapping buffer memory earlier, then rely on simple variable to exist and judge, solve the real-time verification under the buffer memory system, only bring inappreciable performance consumption.Between buffer memory, real-time, this three of performance, find an equilibrium point, when taking into account access performance, rely on the buffer memory system, but realize the buffer memory of index, solved the thorny technical matters when relating to content security etc. and need upgrade content in time.
Description of drawings
Fig. 1 is the data cached structural drawing that comprises the wall scroll content in the prior art;
Fig. 2 is the data cached structural drawing of assembly type that comprises many contents in the prior art;
Fig. 3 is the process flow diagram of database caches in the specific embodiment of the invention.
Fig. 4 is the data structure diagram of mapping area in the database caches in the specific embodiment of the invention.
Fig. 5 is the data structure diagram that upgrades the zone in the specific embodiment of the invention in the database caches.
Embodiment
Further specify technical scheme of the present invention below in conjunction with accompanying drawing and by embodiment.
The main thought of technical solution of the present invention is in the large-scale data system, guaranteeing to use under the prerequisite of caching system, it is data cached to face assembly type, the content that need upgrade in time can be navigated to rapidly from huge buffer memory system, and can finish all associated data cached renewals.Under this prerequisite, to guarantee that also the buffer efficiency of buffer memory system self is not subjected to obviously to influence, accomplish buffer memory and timely two well balanced property that seem the word of contradiction.
Technical solution of the present invention will original data cached outside, set up two new buffer zones again, altogether by three buffer zones, set up based on the data in buffer mapping relations, come addressing this problem rapidly and efficiently.
Fig. 3 is the process flow diagram of database caches in the specific embodiment of the invention.As shown in Figure 3, this database caches flow process may further comprise the steps:
When step 101, buffer memory of database generation, with the data cached conventional zone of leaving in the buffer memory, data cached all the elements that comprise a list request.As shown in Figure 2, be referred to as conventional zone.
Step 102, generation comprise the array data of the unique identifier of all the elements, leave the mapping area in the buffer memory in, and the key assignments of this array data and data cached key-value pair should.As shown in Figure 4, be referred to as mapping area.Fig. 4 adopts with the similar naming rule of Fig. 2 and generates Key, the corresponding mapper_1 of list_1 for example, and its Value is the array that the ID of institute's content in the list_1 buffer memory forms then.
When generating a new buffer memory, application program can be with the routine data of buffer memory according to common usage, leave the data field in, preserved the data acquisition of all the elements of this list request, simultaneously, can be when setting up buffer memory, the while is according to the ID of these contents, generate mapping area, it has comprised the array that all these ID form.For example " up-to-date 10 contents under the sports channel " comprise the content that 10 ID are followed successively by 1-10, according to ad hoc rules, the buffer memory key of its mapping area is mapper_st10, and value is array Array (1,2,3,4,5,6,7,8,9,10), and the key in its conventional zone is list_st10, key with map section compares, and there is similarity in name between the two, and this buffer memory value in conventional zone is the partial data of these 10 contents.
Conventional regional and mapping area in the buffer memory is provided with expired time, and when expired time arrived, all data of conventional zone of deletion and mapping area guaranteed that under normal circumstances the renewal and the destruction of data are reclaimed.
Step 103, need to upgrade or when deleting a content, set up a value for empty data, leave the renewal zone in the buffer memory in, the key assignments of assigning null data comprises the unique identifier of this content.
As shown in Figure 5, in the time of need upgrading or delete certain bar data in time, set up a value in the renewal zone and be empty buffer memory, for example ID is 1 promptly deletion of content, is then upgrading buffer memory of zone meeting increase, and key is id_1, is worth to be Null.
Step 104, fashionable when access data sets is closed corresponding key assignments according to the naming rule generation data set.
When application program will be visited certain data acquisition, generate a key value according to specific naming rule, for example remain visit " up-to-date 10 contents under the sports channel ", then application program is at first visited mapper_st10.
Step 105, search mapping area, judge whether to have the key assignments identical key assignments corresponding, if there is no, then go to step 106,, then go to step 107 if exist with data acquisition.
Step 106, not need in the buffer memory to confirm the data acquisition of visiting, accessing database obtains the data acquisition that needs visit, exports.After obtaining the data acquisition that needs visit, will return step 101.
If there is no mapper_st10 then regards as this buffer memory and does not exist, and directly skips buffer memory and removes normal accessing database, obtains desired data according to database request, and creates buffer memory, simultaneously output data.
Step 107, take out the array that key-value pair is answered, obtain the unique identifier of described all the elements that array comprises from mapping area.
If there is mapper_st10, then take out its value (Value), because its value is a very little array, and takes out from buffer memory, so performance consumption is extremely low.Then the array formed of the ID that obtains from value of program utilization is judged more new situation respectively, and for example the value of mapper_st10 is Array (1,2,3,4,5,6,7,8,9,10), and we need then to judge successively whether these 10 contents of 1-10 exist in the renewal zone.
Step 108, according to the unique identifier of described all the elements, judge in upgrading the zone whether have the key assignments identical one by one with unique identifier, if exist, then go to step 109, if there is no, then go to step 110.
The visit update area, judge whether key exists, because update area has only been preserved the data of some null values, and we do not read these data, only do and whether have judgement--for example use isset ($id_1) judge ID is whether 1 content needs to do expired processing, and this judgement same performance consumption is extremely low.
Described data cached in the conventional zone of step 109, deletion, accessing database obtains the data acquisition that needs visit, exports.After obtaining the data acquisition that needs visit, will return step 101.
If there is this value in update area, then buffer memory is expired, removes accessing database behind the deletion buffer memory, and creates new buffer memory, output data.
Step 110, data cached from the acquisition of conventional zone is exported.
If update area do not exist, show that not have data expired, then normally go to visit conventional buffer zone, take out data, and exported.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with the people of this technology in the disclosed technical scope of the present invention; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.
Claims (4)
1. the method for a database caches is characterized in that, may further comprise the steps:
When A, buffer memory of database generation, with the data cached conventional zone of leaving in the buffer memory, data cached all the elements that comprise a list request;
B, generation comprise the array data of the unique identifier of described all the elements, leave the mapping area in the buffer memory in, and the key assignments of described array data and described data cached key-value pair should;
C, need to upgrade or when deleting a content, set up a value for empty data, leave the renewal zone in the buffer memory in, the key assignments of described assigning null data comprises the unique identifier of a described content;
D, fashionable when access data sets closes corresponding key assignments according to the naming rule generation data set;
E, search mapping area, judge whether to have the key assignments identical key assignments corresponding, if there is no, then go to step F,, then go to step G if exist with data acquisition;
F, not need in the buffer memory to confirm the data acquisition of visiting, accessing database obtains the data acquisition that needs visit, exports;
G, take out the array that key-value pair is answered, obtain the unique identifier of described all the elements that array comprises from mapping area;
H, according to the unique identifier of described all the elements, judge in upgrading the zone whether have the key assignments identical one by one with unique identifier, if exist, then go to step I, if there is no, then go to step J;
Described data cached in the conventional zone of I, deletion, accessing database obtains the data acquisition that needs visit, exports;
J, data cached from the acquisition of conventional zone exports.
2. the method for a kind of database caches according to claim 1 is characterized in that, conventional zone and mapping area in the buffer memory are provided with expired time, when expired time arrives, and all data of conventional zone of deletion and mapping area.
3. the method for a kind of database caches according to claim 1 is characterized in that, in the step F, obtain the data acquisition that needs visit after, will return steps A.
4. the method for a kind of database caches according to claim 1 is characterized in that, among the step I, obtain the data acquisition that needs visit after, will return steps A.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110083447 CN102117338B (en) | 2011-04-02 | 2011-04-02 | Data base caching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110083447 CN102117338B (en) | 2011-04-02 | 2011-04-02 | Data base caching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102117338A true CN102117338A (en) | 2011-07-06 |
| CN102117338B CN102117338B (en) | 2013-03-13 |
Family
ID=44216108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110083447 Expired - Fee Related CN102117338B (en) | 2011-04-02 | 2011-04-02 | Data base caching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102117338B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102867070A (en) * | 2012-09-29 | 2013-01-09 | 瑞庭网络技术（上海）有限公司 | Method for updating cache of key-value distributed memory system |
| CN103890709A (en) * | 2011-11-07 | 2014-06-25 | 英派尔科技开发有限公司 | Cache based key-value store mapping and replication |
| CN105447167A (en) * | 2015-12-04 | 2016-03-30 | 北京奇虎科技有限公司 | Processing method and apparatus for node cache data in distributed system |
| CN105653566A (en) * | 2014-12-03 | 2016-06-08 | 阿里巴巴集团控股有限公司 | Method and apparatus realizing database writing and visiting |
| CN105653709A (en) * | 2015-12-30 | 2016-06-08 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Intelligent home voice text control method |
| CN106126356A (en) * | 2016-06-24 | 2016-11-16 | 努比亚技术有限公司 | The realization of a kind of server buffer, generation method and system |
| CN106649451A (en) * | 2016-09-22 | 2017-05-10 | 北京奇虎科技有限公司 | Data update method and device |
| CN106844529A (en) * | 2016-12-29 | 2017-06-13 | 金蝶软件（中国）有限公司 | Data cached update method, device and system |
| CN107451263A (en) * | 2017-07-31 | 2017-12-08 | 武汉斗鱼网络科技有限公司 | A kind of method, storage medium, equipment and system for caching present panel message |
| CN107562905A (en) * | 2017-09-08 | 2018-01-09 | 深圳市金立通信设备有限公司 | Management method, server and the computer-readable recording medium of data |
| CN107958018A (en) * | 2017-10-17 | 2018-04-24 | 北京百度网讯科技有限公司 | Data-updating method, device and computer-readable medium in caching |
| CN109240948A (en) * | 2018-08-21 | 2019-01-18 | 北京京东尚科信息技术有限公司 | The data cached storage of one kind and method for cleaning and device |
| CN109491987A (en) * | 2018-11-01 | 2019-03-19 | 恒生电子股份有限公司 | Data managing method and device |
| CN111104432A (en) * | 2019-12-31 | 2020-05-05 | 佛山市禾才科技服务有限公司 | Method and system for clearing cache data |
| CN112256700A (en) * | 2020-10-19 | 2021-01-22 | 北京字节跳动网络技术有限公司 | Data storage method and device, electronic equipment and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6457021B1 (en) * | 1998-08-18 | 2002-09-24 | Microsoft Corporation | In-memory database system |
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| US7734581B2 (en) * | 2004-05-18 | 2010-06-08 | Oracle International Corporation | Vector reads for array updates |
| CN101876983A (en) * | 2009-04-30 | 2010-11-03 | 国际商业机器公司 | Method for partitioning database and system thereof |
-
2011
- 2011-04-02 CN CN 201110083447 patent/CN102117338B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6457021B1 (en) * | 1998-08-18 | 2002-09-24 | Microsoft Corporation | In-memory database system |
| US7734581B2 (en) * | 2004-05-18 | 2010-06-08 | Oracle International Corporation | Vector reads for array updates |
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| CN101876983A (en) * | 2009-04-30 | 2010-11-03 | 国际商业机器公司 | Method for partitioning database and system thereof |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103890709B (en) * | 2011-11-07 | 2016-08-17 | 英派尔科技开发有限公司 | Key value database based on caching maps and replicates |
| CN103890709A (en) * | 2011-11-07 | 2014-06-25 | 英派尔科技开发有限公司 | Cache based key-value store mapping and replication |
| CN102867070A (en) * | 2012-09-29 | 2013-01-09 | 瑞庭网络技术（上海）有限公司 | Method for updating cache of key-value distributed memory system |
| CN105653566B (en) * | 2014-12-03 | 2019-08-02 | 阿里巴巴集团控股有限公司 | A kind of method and device for realizing database write access |
| CN105653566A (en) * | 2014-12-03 | 2016-06-08 | 阿里巴巴集团控股有限公司 | Method and apparatus realizing database writing and visiting |
| CN105447167B (en) * | 2015-12-04 | 2019-03-01 | 北京奇虎科技有限公司 | The data cached processing method and processing device of distributed system interior joint |
| CN105447167A (en) * | 2015-12-04 | 2016-03-30 | 北京奇虎科技有限公司 | Processing method and apparatus for node cache data in distributed system |
| CN105653709A (en) * | 2015-12-30 | 2016-06-08 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Intelligent home voice text control method |
| CN106126356A (en) * | 2016-06-24 | 2016-11-16 | 努比亚技术有限公司 | The realization of a kind of server buffer, generation method and system |
| CN106649451A (en) * | 2016-09-22 | 2017-05-10 | 北京奇虎科技有限公司 | Data update method and device |
| CN106844529B (en) * | 2016-12-29 | 2019-08-20 | 金蝶软件（中国）有限公司 | Data cached update method, device and system |
| CN106844529A (en) * | 2016-12-29 | 2017-06-13 | 金蝶软件（中国）有限公司 | Data cached update method, device and system |
| CN107451263A (en) * | 2017-07-31 | 2017-12-08 | 武汉斗鱼网络科技有限公司 | A kind of method, storage medium, equipment and system for caching present panel message |
| CN107451263B (en) * | 2017-07-31 | 2020-10-16 | 武汉斗鱼网络科技有限公司 | Method, storage medium, device and system for caching gift panel message |
| CN107562905A (en) * | 2017-09-08 | 2018-01-09 | 深圳市金立通信设备有限公司 | Management method, server and the computer-readable recording medium of data |
| CN107958018A (en) * | 2017-10-17 | 2018-04-24 | 北京百度网讯科技有限公司 | Data-updating method, device and computer-readable medium in caching |
| CN107958018B (en) * | 2017-10-17 | 2021-06-11 | 北京百度网讯科技有限公司 | Method and device for updating data in cache and computer readable medium |
| CN109240948A (en) * | 2018-08-21 | 2019-01-18 | 北京京东尚科信息技术有限公司 | The data cached storage of one kind and method for cleaning and device |
| CN109491987A (en) * | 2018-11-01 | 2019-03-19 | 恒生电子股份有限公司 | Data managing method and device |
| CN111104432A (en) * | 2019-12-31 | 2020-05-05 | 佛山市禾才科技服务有限公司 | Method and system for clearing cache data |
| CN112256700A (en) * | 2020-10-19 | 2021-01-22 | 北京字节跳动网络技术有限公司 | Data storage method and device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102117338B (en) | 2013-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102117338B (en) | Data base caching method | |
| CN107463447B (en) | A B+ tree management method based on remote direct non-volatile memory access | |
| US9769278B2 (en) | Providing local access to managed content | |
| US11468069B1 (en) | Graph-based data storage for real-time content suggestions | |
| CN102955786B (en) | A kind of dynamic web page data buffer storage and dissemination method and system | |
| US9135572B2 (en) | Method and arrangement for processing data | |
| CN103246696A (en) | High-concurrency database access method and method applied to multi-server system | |
| CN102667772A (en) | File level hierarchical storage management system, method, and apparatus | |
| CN107888687B (en) | Proxy client storage acceleration method and system based on distributed storage system | |
| CN104679898A (en) | Big data access method | |
| CN113448490A (en) | Method, apparatus and computer program product for storage | |
| JP2015537283A (en) | Mail indexing and retrieval using a hierarchical cache | |
| CN117591040B (en) | Data processing method, device, equipment and readable storage medium | |
| CN106354805A (en) | Optimization method and system for searching and caching distribution storage system NoSQL | |
| CN104111898A (en) | Hybrid storage system based on multidimensional data similarity and data management method | |
| CN107526828B (en) | Page information recommendation method and device | |
| CN113918857A (en) | Three-level cache acceleration method for improving performance of distributed WEB application system | |
| CN112732725B (en) | NVM (non volatile memory) hybrid memory-based adaptive prefix tree construction method, system and medium | |
| CN111752941B (en) | Data storage and access method and device, server and storage medium | |
| CN116383195A (en) | Data storage method and device and electronic equipment | |
| CN114490443A (en) | Shared memory-based golang process internal caching method | |
| US10209909B1 (en) | Storage element cloning in presence of data storage pre-mapper | |
| US8533398B2 (en) | Combination based LRU caching | |
| That et al. | TRIFL: A generic trajectory index for flash storage | |
| CN109492020A (en) | A kind of data cache method, device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data base caching method Effective date of registration: 20130705 Granted publication date: 20130313 Pledgee: Beijing Guohua financing Company limited by guarantee Pledgor: TVMining (Beijing) Media Technology Co., Ltd. Registration number: 2013990000434 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20140722 Granted publication date: 20130313 Pledgee: Beijing Guohua financing Company limited by guarantee Pledgor: TVMining (Beijing) Media Technology Co., Ltd. Registration number: 2013990000434 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Data base caching method Effective date of registration: 20140724 Granted publication date: 20130313 Pledgee: Beijing Guohua financing Company limited by guarantee Pledgor: TVMining (Beijing) Media Technology Co., Ltd. Registration number: 2014990000602 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20150917 Granted publication date: 20130313 Pledgee: Beijing Guohua financing Company limited by guarantee Pledgor: TVMining (Beijing) Media Technology Co., Ltd. Registration number: 2014990000602 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130313 Termination date: 20210402 |