CN102402622A - Memory page managing and scheduling method for embedded memory database - Google Patents
Memory page managing and scheduling method for embedded memory database Download PDFInfo
- Publication number
- CN102402622A CN102402622A CN2011104479914A CN201110447991A CN102402622A CN 102402622 A CN102402622 A CN 102402622A CN 2011104479914 A CN2011104479914 A CN 2011104479914A CN 201110447991 A CN201110447991 A CN 201110447991A CN 102402622 A CN102402622 A CN 102402622A
- Authority
- CN
- China
- Prior art keywords
- page
- leaf
- memory
- database
- hash
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a memory page managing and scheduling method for an embedded memory database. The memory space of a memory database is divided into a plurality of blocks which take page as a unit, and the size of each page is identical with the size of the disk file page of the database, each disk file page establishes mapping with the memory page. The method comprises the following steps of: 1, acquiring the offset of database files to be read and written, and establishing the mapping between the offset and page numbers by a system; 2, detecting whether hash collision exists, if the hash collision exists, accordingly resolving the hash collision; if hash collision does not exist, then entering the next step; 3, judging whether a page which can carry data exists in a memory, if the page does not exist in the memory, selecting memory pages on which data can exchange from the memory; if the page exists in the memory, then entering the next step; and 5, writing new data contents into the memory pages. By the method, the embedded memory database gets rid of the limit of the memory resources of embedded equipment.
Description
Technical field
The present invention relates to a kind of managing memory pages dispatching method, relate in particular to a kind of method that the limited primary memory in embedded device space carries out memory pages logical extension and cache management that is directed against, belong to database storing administrative skill field.
Background technology
Prevailing embedded memory database product is the foreign database product of import on the present embedded memory database market at home, such as the TimesTen of Oracle company, the extremedb of McObject company and the UltraLite of Sybase company etc.Because external embedded memory database manufacturer only provides final products and service to the home market, and carries out tight protection for the core technology data and the source code of product in order to limit the core technology outflow.
Domestic some embedded memory database products that also exist, but mainly all be the pure memory database system to the memorymodel exploitation, and all be the backup file of disk file as the memory database memory mirror.System backups in the disk file with reformed data in memory database in when operation only, and can not load data into the memory database dynamically from disk file.The disk space that can cause capacity to surpass the internal memory several magnitude like this can not be used at the database run duration flexibly.The maximum constraints of pure memory database is that the database size maximum of creating can not be above the size of memory size.This is very disadvantageous restriction in the smaller embedded device of internal memory is used, and especially the database size is easy to exceed the capacity of embedded device internal memory when needs storage multi-medium data.
The base unit of data storage is the page in memory database, and the quality of free page management is directly connected to the height of system performance.Data volume big with the data organization form more than situation under, show especially outstanding.Zhong Baorong, Yuan Wenliang have introduced two kinds of management methods to free page in the memory database in " the method research of idle page management in the memory database " (" computer engineering and design " the 7th phase in 2007): available space list and position diagrammatic sketch method; And carried out detailed argumentation; Two kinds of different data structures have been described; Emphasis is discussed the operating strategy of free page, selects data base administration that effective reference frame is provided to different system.
Summary of the invention
Technical matters to be solved by this invention is to provide a kind of managing memory pages dispatching method of embedded memory database.
For realizing above-mentioned goal of the invention, the present invention adopts following technical scheme:
A kind of managing memory pages dispatching method of embedded memory database; It is a plurality of of unit that the memory headroom of said memory database is divided into the page or leaf; And size of each page and database disk file page or leaf is big or small identical; Each disk file page or leaf and page are set up mapping, it is characterized in that may further comprise the steps:
Step 1: system obtains the side-play amount of the database file that will read and write, line displacement amount and the page number mapping of going forward side by side.
Step 2: detect whether hash-collision is arranged, solve processing if having then carry out corresponding hash-collision; If not then get into next step;
Step 3: inspection whether have in the internal memory can loading data the page
If do not have according to the paging algorithm from internal memory, select can exchanges data page; If have then get into next step;
Step 5: new data content is write in the page.
Can make the embedded memory database can realize approaching the performance of all-memory database through the present invention, can make the memory capacity of database reach the data capacity of disk again, make the embedded memory database break away from the restriction of embedded device memory source.And opaque to the user, need not user management.
Description of drawings
Below in conjunction with accompanying drawing and embodiment the present invention is done further detailed description.
Fig. 1 is a system chart of the present invention;
Fig. 2 is the block diagram of page management;
Fig. 3 is the mapping relations synoptic diagram of document misregistration amount to page number;
Fig. 4 detects synoptic diagram for hash-collision;
Fig. 5 does not have the synoptic diagram of free page situation when loading for the page;
Fig. 6 is for deleting the synoptic diagram of the page or leaf that is not used at most from idle chained list;
Fig. 7 is the synoptic diagram that upgrades Hash table and remove invalid cryptographic hash.
Embodiment
In the present invention, utilized the temporal locality principle of the data access that has been proved to be and spatial locality principle to solve the not enough problem of memory headroom.This principle of locality in the virtual memory realization technology of operating system by good employing, and through experimental verification its to solving the not enough validity of memory headroom.
Principle of locality is meant CPU when reference-to storage, no matter is access instruction or access data, and the storage unit of being visited all is tending towards accumulating in the less continuum.Temporal locality is meant if an item of information is visited, so in that it probably also can be by visit once more in the recent period.Program loop, storehouse etc. are the reasons of generation time locality.Spatial locality is meant that the information that will use in the immediate future closes on space address with the information of now using probably.Memory database puts forward with regard to being based on such consideration.
The present invention provides a kind of managing memory pages and dispatching method of embedded memory database.The method makes memory headroom enliven the buffer zone of the page as the part of database file, thereby makes the restriction considerably beyond memory headroom of database size that the embedded memory database can create.The method makes the embedded memory database can realize approaching the performance of all-memory database, can make the memory capacity of database reach the data capacity of disk again.For the limited embedded device of internal memory, the method can be improved database size and the handling property that the user can open and operate greatly.
The present invention is divided into page management part, page loading station and paging part with system by function, and is as shown in Figure 1.Page loading station can be divided into document misregistration again and page number mapping block, page load-on module and hash-collision detect and these three modules of solution module.Wherein page management part is called when database starts, and is used for space, allocation buffer in internal memory, and is that unit is to managing between buffer empty with the page or leaf.Page loading station is when the page or leaf that carries out data manipulation and this data place is not in buffer zone, to be called, and it is used to the data page in the disk file is loaded in the free page in the buffer zone.If the cryptographic hash of the current data page that will visit has been occupied by other data pages and this page or leaf does not also have and other pages or leaves are shared this cryptographic hash, processing then conflicts.The conflict processing module distributes new page can for this data page, and adds the structure of this page the head of corresponding conflict chained list to.Paging partly is to carry out that data page loads and all pages or leaves are called when all being used, and it writes back database file with certain page or leaf, reads in the current data page that will operate with vacating space.During paging, system finds and is not used page or leaf recently as being replaced page or leaf, will be replaced page or leaf and write back database file.Then the data page of asking is written to and is replaced page or leaf, the completion page swaps out and changes to.
● the page management part
Page management part is that unit is divided into a plurality of pages with the page or leaf with internal memory, and is that unit manages equally with the page or leaf with database data in the disk; Be that unit sets up mapping relations and uses the mapping relations of Hash table hyperdisk page or leaf and page with the page between internal memory and disk.
Page management is partly managed all pages through creating a number of pages group Page [], and is as shown in Figure 2.Each number of pages group all has forerunner's pointer prev and heir pointer next, a page or leaf in the corresponding core buffer of each number of pages group.Wherein each number of pages group element is preserved the status information of each page.Page or leaf can be divided into three types by user mode: blank page, free page and use page or leaf.The page management part is linked into these three kinds of pages or leaves corresponding blank page chained list, free page chained list or uses the page or leaf chained list according to the user mode of page or leaf.Wherein blank page representes not to be written into the data of disk file; Free page representes to be written into the data of disk file and the access count of page or leaf is 0, promptly currently is not used; Use page table to show the data in magnetic disk page or leaf loaded and access count also greater than 0, promptly current being used.The page or leaf of all buffer zones is free page during original state, by idle chained list management.
● page loading station
Page loading station is divided into three sub-module, and this three sub-module is respectively that the database skew detects and the solution module with page number mapping block, page load-on module and hash-collision.
A. document misregistration and page number mapping block
Page loading station is realized the mapping of document misregistration amount to page number through the mapping table of Hash table store files skew with page number, and is as shown in Figure 3.Hash table is as the array of an integer, and the value of array is represented the page number of page in the buffer zone, and initial value is 0.The cryptographic hash that calculates according to the document misregistration amount is as the subscript of Hash array, obtains document misregistration amount corresponding buffer region page or leaf through this value.As shown in Figure 3, the cryptographic hash that document misregistration amount (address) obtains is 3, the 3rd page or leaf in the then corresponding buffer zone.So just realized from the document misregistration amount to the mapping the buffer zone memory address.
B. hash-collision detects and solves module
When document misregistration and page number mapping block carry out the mapping of side-play amount and page number, if when having had one or more side-play amounts (page or leaf) to be mapped as same cryptographic hash, then produce hash-collision, need detect the processing that conflicts with the solution module by hash-collision.After detecting and handling conflict, just carry out the page and load and handle.
The detection method of hash-collision: go out corresponding cryptographic hash through the document misregistration address computation, obtain a conflict chained list of corresponding page or leaf through this cryptographic hash.If for there not being one offset address identical with the offset address that will load page or leaf in sky and the chained list, then explanation does not detect conflict to this chained list, and is as shown in Figure 4.
The method that conflict solves: whether the document misregistration address field of inspection current page is identical with the document misregistration amount, is the page or leaf at loaded place, document misregistration address like identical explanation current page.Otherwise by the next page or leaf in the collision domain lookup conflict chain of page or leaf.Instantly the value in the collision territory of one page is 0, and explanation is last of conflict page or leaf chain.If the document misregistration address field of page or leaf is still different with the offset address that will visit, the page or leaf at the offset address place that explanation will be visited is not written into.Distribute new page or leaf,, and let the current Hash array item of searching point to the page number of new page or leaf new page or leaf first node as the conflict chained list.
C. page loading module
When document misregistration and page number mapping block carry out the mapping of side-play amount and page number; The page that obtains; Its footers is under the situation about not being loaded; Data on the page loading module reading disk file also are loaded in this page, and this loading sign in the Hash table is made as loads.
● the paging part
The paging module is having new page or leaf will be loaded into internal memory and under the current situation that has not had a blank page, being called, and is as shown in Figure 5.The principle of paging is the page or leaf that the scheduling maximum duration is not used.Concrete page replacement process is divided into following a few step:
1, the free page that will not be used is at most deleted from chained list; As shown in Figure 6.
If the content of 2 these pages or leaves changes, the content of this page is write back disk;
3, loads new data is upgraded cryptographic hash;
4, remove the value of the Hash table that lost efficacy.As shown in Figure 7.
The managing memory pages and the dispatching method of embedded memory database of the present invention may further comprise the steps:
Step 1: system obtains the side-play amount of the database file that will read and write, line displacement amount and the page number mapping of going forward side by side.
Step 2: carry out corresponding hash-collision and handle.
Step 3: inspection whether have in the internal memory can loading data the page
If do not have according to the paging algorithm from internal memory, select can exchanges data page,
Step 4: whether needs write back disk according to the database of the operating position of page or leaf decision page.
Step 5: new data content is write in the page.Supply the embedded memory database access.
It is a plurality of of unit that the present invention is divided into the memory headroom of database application with the page or leaf, and guarantees size and database disk file page or leaf big or small identical of each page.It is the memory headroom of the database application buffer zone as the database disk file, and the mapping of setting up each disk page or leaf and page through the management and dispatching method of the page, and accomplishes changing to and swapping out of disc page through ltsh chain table.The management and dispatching method of memory pages also provides the collision detection and the solution of the shared core buffer page or leaf of a plurality of disk pages or leaves in the embedded memory database; This makes that database disk file of manying bigger than memory headroom also can be created and increase, deletion, modification and search operation, and make the embedded memory database can store than the big data that many of memory headroom and performance very near pure memory database.
Specify the detailed implementing procedure of invoked each inside modules below.
In the management and dispatching method of the embedded memory databases page of the present invention, when database started, page management part of the present invention can be called, and carries out data base initialize.Page management part space, allocation buffer in internal memory, and be that unit is to managing between buffer empty with the page or leaf.And all buffer zone pages or leaves all are made as free page (by the management of idle chained list).
The management of the embedded memory databases page of the present invention and the reading and writing data flow process in the dispatching method are:
1) the application program database data request that reads and writes data;
2) system obtains the side-play amount of the database file that will read and write;
3) mapping calculates side-play amount corresponding hash term and internal memory page number.That is, document misregistration-page number mapping block obtains side-play amount corresponding hash term and internal memory page number through the index (realizing the mapping of document misregistration amount to page number through Hash table) that the side-play amount of database file calculates Hash table;
Whether 4) detect Hash mapping conflicts.Get into the hash-collision treatment step under the situation about clashing; Otherwise get into next step;
5) inspection whether have in the internal memory can loading data the page.Step is following:
51), then start the paging algorithm and obtain a blank page if there is not blank page;
Side-play amount is belonged to the disk page data write this blank page, upgrade this blank page structure;
Upgrade Hash table then, the value of the item that the Hash table current page is corresponding is upgraded the page number of blank page for this reason;
52) if blank page is arranged, then from the blank page chained list, take out one page, suppose that page number is X, the free page linked list head points to next blank page;
Side-play amount is belonged to disk page data write memory page or leaf X, upgrade page [X] array;
Upgrade Hash table then, the value of the item that the Hash table current page is corresponding is updated to X;
6) if current hash term is used by this disk file page or leaf, then need not reload;
7) hash-collision is handled.If current hash term is used (then explanation detects conflict) by other disk file pages or leaves, then distribute new page; With new page first node as the conflict chained list;
8) structure that will new page or leaf joins in the conflict chained list that the currentElement of Hash table points to, and the page number that is about to new page or leaf is saved in the currentElement of Hash table;
9) whether needs write back disk according to the database of the operating position of page or leaf decision page, and new data content is write in the page.
Through in KingbaseReal embedded memory database, implementing the management and the dispatching method of the embedded memory databases page, can obtain following beneficial effect:
The present invention has realized the management and dispatching method of the memory pages of embedded memory database, accomplishes the scheduling of the core buffer page through the collaborative work of three parts.This architecture has not only solved domestic embedded memory database product to the unsupported problem of virtual memory technology, and has solved the problem of foreign database manufacturer to memory database virtual memory technical monopoly.
For the embedded database application developers, because the memory size on the embedded device is very limited.A lot of embedded devices all have only that tens megabyte or a few megabyte have even have only hundreds of K byte.For the limited embedded device of this memory size, implemented the memory database of embedded memory databases page management dispatching method through employing, large scale, low cost and high performance database service can be provided.Avoided pure memory database to cause to create large-sized database, and large-sized database file can't load the into problem of internal memory because of low memory.
For the user that the use embedded database is stored multi-medium data; Because multi-medium data has the big characteristics of data size; Therefore the memory database of having implemented embedded memory databases page management dispatching method through employing is loaded into the current multi-medium data that needs to handle in the core buffer; And the current multi-medium data of handling is put back in the disk file, can improve the multi-medium data processing power of Database Systems so greatly.
The present invention makes the embedded memory database break away from the restriction of embedded device memory source.And opaque to the user, need not user management.For the application programmer who uses database interface, the access mode of the memory database of having implemented embedded memory databases page management dispatching method and the memory database of not implementing embedded memory databases page management dispatching method is not almost changed.Other operations for database are identical with original operation, and this has simplified the complexity that the user operates this kind database greatly.
More than the managing memory pages dispatching method of embedded memory database provided by the present invention has been carried out detailed explanation.To those skilled in the art, any conspicuous change of under the prerequisite that does not deviate from connotation of the present invention, it being done all will constitute to infringement of patent right of the present invention, with corresponding legal responsibilities.
Claims (10)
1. the managing memory pages dispatching method of an embedded memory database; It is a plurality of of unit that the memory headroom of said memory database is divided into the page or leaf; And size of each page and database disk file page or leaf is big or small identical; Each disk file page or leaf and page are set up mapping, it is characterized in that may further comprise the steps:
Step 1: system obtains the side-play amount of the database file that will read and write, line displacement amount and the page number mapping of going forward side by side;
Step 2: detect whether hash-collision is arranged, solve processing if having then carry out corresponding hash-collision; If not then get into next step;
Step 3: inspection whether have in the internal memory can loading data the page
If do not have according to the paging algorithm from internal memory, select can exchanges data page; If have then get into next step;
Step 5: new data content is write in the page.
2. the managing memory pages dispatching method of embedded memory database as claimed in claim 1 is characterized in that:
The cryptographic hash that in step 1, calculates according to the document misregistration amount is as the subscript of Hash array, obtains document misregistration amount corresponding buffer region page or leaf through this value.
3. the managing memory pages dispatching method of embedded memory database as claimed in claim 1 is characterized in that:
Go out corresponding cryptographic hash through the document misregistration address computation in the step 2; Obtain a conflict chained list of corresponding page or leaf through this cryptographic hash; If this chained list for there not being one offset address identical with the offset address that will load page or leaf in sky and the chained list, is not judged to be and detects hash-collision.
4. the managing memory pages dispatching method of embedded memory database as claimed in claim 1 is characterized in that:
May further comprise the steps in the step 2: whether the document misregistration address field of inspection current page is identical with the document misregistration amount, is the page or leaf at loaded place, document misregistration address like the identical current page of then explaining; Otherwise search the next page or leaf in the conflict chain by the collision domain of page or leaf; Instantly the value of the collision domain of one page is 0, and explanation is last of conflict page or leaf chain; If the document misregistration address field of page or leaf is still different with the offset address that will visit, the page or leaf at the offset address place that explanation will be visited is not written into.
5. the managing memory pages dispatching method of embedded memory database as claimed in claim 3 is characterized in that:
Hash-collision solves to handle and is meant the new page of distribution, with new page first node as the conflict chained list, and lets the current Hash array item of searching point to the page number of new page or leaf.
6. the managing memory pages dispatching method of embedded memory database as claimed in claim 4 is characterized in that:
If current cryptographic hash is used by this disk file page or leaf, then need not reload.
7. the managing memory pages dispatching method of embedded memory database as claimed in claim 6 is characterized in that:
In the step 3, do not have blank page, then start the paging algorithm and obtain a blank page if be checked through; Side-play amount is belonged to the disk page data write this blank page, upgrade this blank page structure; Upgrade Hash table then, the value of the item that the Hash table current page is corresponding is upgraded the page number of blank page for this reason.
8. the managing memory pages dispatching method of embedded memory database as claimed in claim 7 is characterized in that:
In the step 3, if be checked through blank page, then from the blank page chained list, take out one page, suppose that page number is X, the free page linked list head points to next blank page; Side-play amount is belonged to disk page data write memory page or leaf X, upgrade page [X] array; Upgrade Hash table then, the value of the item that the Hash table current page is corresponding is updated to X.
9. the managing memory pages dispatching method of embedded memory database as claimed in claim 3 is characterized in that also comprising page replacement step:
The free page that is not used is at most deleted from chained list; If the content of this page or leaf changes, the content of this page is write back disk; Loads new data is upgraded cryptographic hash; Remove the value of the Hash table that lost efficacy.
10. the managing memory pages dispatching method of embedded memory database as claimed in claim 1 is characterized in that
Also comprise step 4 between step 3 and the step 5: whether needs write back disk according to the database of the operating position of page or leaf decision page, and get into next step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110447991.4A CN102402622B (en) | 2011-12-27 | 2011-12-27 | The managing memory pages dispatching method of Embedded Main Memory Database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110447991.4A CN102402622B (en) | 2011-12-27 | 2011-12-27 | The managing memory pages dispatching method of Embedded Main Memory Database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102402622A true CN102402622A (en) | 2012-04-04 |
| CN102402622B CN102402622B (en) | 2015-09-09 |
Family
ID=45884822
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110447991.4A Active CN102402622B (en) | 2011-12-27 | 2011-12-27 | The managing memory pages dispatching method of Embedded Main Memory Database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102402622B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104636417A (en) * | 2013-11-06 | 2015-05-20 | 国际商业机器公司 | System and method for managing data |
| CN104731799A (en) * | 2013-12-20 | 2015-06-24 | 中国银联股份有限公司 | Memory database management device |
| CN106776961A (en) * | 2016-12-05 | 2017-05-31 | 广州阿里巴巴文学信息技术有限公司 | Webpage local storage space expansion method, browser client and electronic equipment |
| CN106960053A (en) * | 2017-03-31 | 2017-07-18 | 中联恒天控股有限公司 | A kind of credit investigation system with dynamic data management and access function |
| CN108121813A (en) * | 2017-12-27 | 2018-06-05 | 东软集团股份有限公司 | Data managing method, device, system, storage medium and electronic equipment |
| CN108255890A (en) * | 2016-12-29 | 2018-07-06 | 腾讯科技（深圳）有限公司 | The treating method and apparatus of the page |
| CN109325022A (en) * | 2018-07-20 | 2019-02-12 | 新华三技术有限公司 | A kind of data processing method and device |
| CN112269665A (en) * | 2020-12-22 | 2021-01-26 | 北京金山云网络技术有限公司 | Memory processing method and device, electronic equipment and storage medium |
| CN112487095A (en) * | 2020-12-09 | 2021-03-12 | 浪潮云信息技术股份公司 | Method for optimizing transaction data storage of distributed database |
| CN113051184A (en) * | 2019-12-27 | 2021-06-29 | 北京兆易创新科技股份有限公司 | Data reading method and device, electronic equipment and storage medium |
| CN114356560A (en) * | 2021-12-23 | 2022-04-15 | 北京中科网威信息技术有限公司 | Resource object acquisition method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5918231A (en) * | 1995-02-24 | 1999-06-29 | Nec Corporation | Object-oriented database management system with improved usage efficiency of main memory |
| CN101510176A (en) * | 2009-03-26 | 2009-08-19 | 浙江大学 | Control method of general-purpose operating system for accessing CPU two stage caching |
| CN102193873A (en) * | 2010-03-04 | 2011-09-21 | 中国科学院微电子研究所 | Method of quickly reading and writing mass data file |
-
2011
- 2011-12-27 CN CN201110447991.4A patent/CN102402622B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5918231A (en) * | 1995-02-24 | 1999-06-29 | Nec Corporation | Object-oriented database management system with improved usage efficiency of main memory |
| CN101510176A (en) * | 2009-03-26 | 2009-08-19 | 浙江大学 | Control method of general-purpose operating system for accessing CPU two stage caching |
| CN102193873A (en) * | 2010-03-04 | 2011-09-21 | 中国科学院微电子研究所 | Method of quickly reading and writing mass data file |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104636417B (en) * | 2013-11-06 | 2017-10-13 | 国际商业机器公司 | The system and method for managing data |
| CN104636417A (en) * | 2013-11-06 | 2015-05-20 | 国际商业机器公司 | System and method for managing data |
| US10740308B2 (en) | 2013-11-06 | 2020-08-11 | International Business Machines Corporation | Key_Value data storage system |
| CN104731799A (en) * | 2013-12-20 | 2015-06-24 | 中国银联股份有限公司 | Memory database management device |
| CN104731799B (en) * | 2013-12-20 | 2018-09-04 | 中国银联股份有限公司 | Main memory DBM device |
| CN106776961A (en) * | 2016-12-05 | 2017-05-31 | 广州阿里巴巴文学信息技术有限公司 | Webpage local storage space expansion method, browser client and electronic equipment |
| CN106776961B (en) * | 2016-12-05 | 2020-03-20 | 广州阿里巴巴文学信息技术有限公司 | Webpage local storage space expansion method, browser client and electronic equipment |
| CN108255890B (en) * | 2016-12-29 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Page processing method and device |
| CN108255890A (en) * | 2016-12-29 | 2018-07-06 | 腾讯科技（深圳）有限公司 | The treating method and apparatus of the page |
| CN106960053A (en) * | 2017-03-31 | 2017-07-18 | 中联恒天控股有限公司 | A kind of credit investigation system with dynamic data management and access function |
| CN108121813A (en) * | 2017-12-27 | 2018-06-05 | 东软集团股份有限公司 | Data managing method, device, system, storage medium and electronic equipment |
| CN108121813B (en) * | 2017-12-27 | 2020-09-18 | 东软集团股份有限公司 | Data management method, device, system, storage medium and electronic equipment |
| CN109325022A (en) * | 2018-07-20 | 2019-02-12 | 新华三技术有限公司 | A kind of data processing method and device |
| CN109325022B (en) * | 2018-07-20 | 2021-04-27 | 新华三技术有限公司 | Data processing method and device |
| CN113051184A (en) * | 2019-12-27 | 2021-06-29 | 北京兆易创新科技股份有限公司 | Data reading method and device, electronic equipment and storage medium |
| CN113051184B (en) * | 2019-12-27 | 2024-02-20 | 兆易创新科技集团股份有限公司 | Data reading method and device, electronic equipment and storage medium |
| CN112487095A (en) * | 2020-12-09 | 2021-03-12 | 浪潮云信息技术股份公司 | Method for optimizing transaction data storage of distributed database |
| CN112269665A (en) * | 2020-12-22 | 2021-01-26 | 北京金山云网络技术有限公司 | Memory processing method and device, electronic equipment and storage medium |
| CN112269665B (en) * | 2020-12-22 | 2021-05-11 | 北京金山云网络技术有限公司 | Memory processing method and device, electronic equipment and storage medium |
| CN114356560A (en) * | 2021-12-23 | 2022-04-15 | 北京中科网威信息技术有限公司 | Resource object acquisition method and system |
| CN114356560B (en) * | 2021-12-23 | 2022-09-16 | 北京中科网威信息技术有限公司 | Resource object acquisition method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102402622B (en) | 2015-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102402622A (en) | Memory page managing and scheduling method for embedded memory database | |
| TWI590049B (en) | Memory device and operating method of same | |
| CN103026346B (en) | For reading and write method and the storage system of data from solid-state memory device | |
| CN102855193B (en) | Go during the carry of untapped logical address in Nonvolatile memory system to map | |
| CN102779096B (en) | Page, block and face-based three-dimensional flash memory address mapping method | |
| CN100426259C (en) | Virtual access method of storage document data | |
| CN101582076A (en) | Data de-duplication method based on data base | |
| CN103136116A (en) | Memory storage system and central control device, management method and blackout recovery method thereof | |
| CN101187901A (en) | High speed cache system and method for implementing file access | |
| CN103577339A (en) | Method and system for storing data | |
| CN105224478A (en) | A kind of formation of mapping table, renewal and restoration methods and electronic equipment | |
| CN103942161B (en) | Redundancy elimination system and method for read-only cache and redundancy elimination method for cache | |
| CN105718530A (en) | File storage system and file storage control method thereof | |
| CN100383792C (en) | Buffer data base data organization method | |
| CN101916290B (en) | Managing method of internal memory database and device | |
| CN103180852A (en) | Distributed data processing method and apparatus | |
| CN103049224B (en) | By the methods, devices and systems of data importing physical tape | |
| CN102982182A (en) | Data storage planning method and device | |
| CN105045850A (en) | Method for recovering junk data in cloud storage log file system | |
| CN103473258A (en) | Cloud storage file system | |
| CN102915282A (en) | Block device data cache management method and system for memory system | |
| CN101599080B (en) | Backup data organization system and method thereof | |
| CN102520885B (en) | Data management system for hybrid hard disk | |
| CN105786721A (en) | Memory address mapping management method and processor | |
| CN102096676B (en) | Data updating and query control method and system |
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 |