CN103177026A - Data management method and data management system - Google Patents
Data management method and data management system Download PDFInfo
- Publication number
- CN103177026A CN103177026A CN2011104395529A CN201110439552A CN103177026A CN 103177026 A CN103177026 A CN 103177026A CN 2011104395529 A CN2011104395529 A CN 2011104395529A CN 201110439552 A CN201110439552 A CN 201110439552A CN 103177026 A CN103177026 A CN 103177026A
- Authority
- CN
- China
- Prior art keywords
- data
- local
- file
- index file
- access
- 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
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data management method and a data management system which are capable of reducing memory consumption of a server during data visiting to the largest extent, improving starting speed of the server, and realizing accurate and quick data visiting. The data management method comprises the steps of establishing a local data file which stores data; generating a local index file according to the local data file, wherein the local index file comprises position information, in the data file, of each piece of data; obtaining the position information of visited data from the local index file according to a visiting request when the visiting request is received; and visiting corresponding data in the local data file according to the position information.
Description
Technical field
The present invention relates to technical field of data processing, particularly data managing method and data management system.
Background technology
The development in accompanying information technology and market, the use of database is more and more known by people.Database, memory management etc. are used also more and more extensive, and the database scheme of main flow adopts tables of data to store and management data in conjunction with the mode of internal memory at present.When accessing database, now the data in database are read in internal memory, and then obtain the access result from internal memory.
Yet, explosive growth along with data volume, the drawback of existing database scheme manifests gradually, for example, be 4,000 ten thousand in data form table record amount, Concurrency Access quantity surpasses at 400 o'clock, and apparent in view decline will appear in database performance, reach the wall scroll processing time more than 10 seconds, data access efficiency is lower; And the data of 2,000 ten thousand required memory spaces will be greater than 2G, the memory space of internal memory is required too high, and owing to these data being written into the consuming time longer of internal memory, causes startup of server excessively slow, can not satisfy the actual production environment demand.
Summary of the invention
The invention provides a kind of data managing method and data management system, the available data access efficiency is lower and too high to request memory to solve, problem that startup of server is excessively slow.
For achieving the above object, the embodiment of the present invention has adopted following technical scheme:
The embodiment of the present invention provides a kind of data managing method, and described method comprises:
Create the local data file of storage data;
Generate the local index file according to described local data file, described local index file comprises every data positional information in local data file;
When receiving request of access, obtain the positional information of institute's visit data according to request of access from the local index file;
Access corresponding data in local data file according to described positional information.
The embodiment of the present invention also provides a kind of data management system, and described system comprises local file database and database access device,
Described local file database creates the local data file of storing data, generates the local index file according to described local data file, and described local index file comprises every data positional information in local data file;
Described database access device when receiving request of access, obtains the positional information of institute's visit data from the local index file according to request of access, and, access corresponding data in local data file according to described positional information.
The beneficial effect of the embodiment of the present invention is:
The embodiment of the present invention adopts the form storage data of local file and the index of data, because adopting the document form storage, general data realizes, when carrying out data access, directly access local file, the server memory of required consumption is very little, committed memory hardly, thus memory consumption reduced to greatest extent, improved the toggle speed of server; And data not can because of server restart or fault is lost, guaranteed the safety of data.And this programme can be supported the access of large concurrent, realizes data access quickly and accurately.
Description of drawings
A kind of data managing method schematic flow sheet that Fig. 1 provides for the embodiment of the present invention one;
The method for reading data schematic flow sheet that Fig. 2 provides for the embodiment of the present invention two;
The data insertion method schematic flow sheet that Fig. 3 provides for the embodiment of the present invention two;
The data modification method schematic flow sheet that Fig. 4 provides for the embodiment of the present invention two;
The data-erasure method schematic flow sheet that Fig. 5 provides for the embodiment of the present invention two;
A kind of data management system structural representation that Fig. 6 provides for the embodiment of the present invention three.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
Referring to Fig. 1, be a kind of data managing method that the embodiment of the present invention one provides, described method comprises:
11: the local data file that creates the storage data.
Key word and the data itself of storage data in local data file, data key words is the identification information of data uniqueness in system, its concrete numerical value and implementation can be chosen as required, for example, selected key word can be a character string, for example be expressed as TEST:13699229851, wherein TEST symbol indication character string thereafter is key word; Selected key word also can for example, be expressed as PID:6 for an integer, and wherein, PID symbol indication integer thereafter is key word.
12: generate the local index file according to described local data file, described local index file comprises every data positional information in data file.
Further, the present embodiment generates the local index file according to binary tree structure, with the speed of further quickening data access.A node of binary tree structure comprise the key word of data and these data in data file with respect to the side-play amount of data reference position, this side-play amount is above-mentioned positional information.
Binary tree structure is the ordered tree structure that each node has at most two subtrees.Each node of binary tree only has two stalks trees (presence is not greater than 2 node) at the most, and the subtree of binary tree has dividing of left and right, usually is respectively referred to as left subtree (left subtree) and right subtree (right subtree).The order of left and right subtree can not be put upside down.Due to this order of left and right subtree, when searching data in binary tree structure, each node only can be searched according to the path of a direction in left subtree and right subtree, can greatly improve the efficient of data search.
By above-mentioned steps 11 and 12, generated local data file and local index file, thereby created a local file database.Wherein, " this locality " is for server one side in network, the local file database can be realized on the hard disk of local terminal, when access local file database, directly access local disk, and do not need the data in database are read in the internal memory of server, thereby consume the size of internal memory in the minimizing process operation data, improve access speed, accelerate the opening speed of the webserver, satisfy actual requirement.
In the data access process, can confirm whether the local file database exists by calling and open local data file and index file, in the time can successfully opening local data file and index file, confirm that the local file database exists, carry out follow-up accessing operation, when file open failed, confirm that the local file database does not exist, and carries out above-mentioned steps 11 and 12.
13: when receiving request of access, obtain the positional information of institute's visit data according to request of access from the local index file.
Carry the key word of required visit data in request of access, according to the key word that carries in request of access, search obtains the side-play amount of institute's visit data in the binary tree structure of local index file.Key word in key word in request of access and each binary tree node is compared, when identical, confirm that this binary tree node stored required side-play amount (as being expressed as M), and this side-play amount is extracted.
Existing scheme is when carrying out information searching, usually utilizing hash algorithm to carry out data locates, yet, need to estimate and keep the required whole storage spaces that take when adopting hash algorithm, information redundance large (reaching more than 25%), significant wastage storage resources, for this shortcoming, this programme has adopted the local index file of binary tree structure, has reached the effect that improves resource utilization and access speed.
Experiment showed, this programme for the file with 8,000 ten thousand data, the wall scroll data retrieval time is no more than 30 microseconds, with directly suitable in the time of internal memory data query, and, much larger than the retrieval time of 100 milliseconds of existing database.
14: access corresponding data in local data file according to described positional information.
For example, when utilizing data pointer during locator data, data pointer to be moved to current location in local data file, this current location is the position with respect to the data reference position skew M of local data file.
Further, before carrying out above-mentioned steps 13, described method also comprises: check whether the local index file is up-to-date version, if, obtain described positional information from this local index file, if not, load the local index file of latest edition, obtain described positional information from the local index file of new loading.Before carrying out above-mentioned steps 14, described method also comprises: check whether local data file is up-to-date version, if, the corresponding data of access in this local data file, if not, load the local data file of latest edition, the corresponding data of access in the new local data file that loads.
From the above mentioned, the embodiment of the present invention adopts the form storage data of local file and the index of data, because adopting the document form storage, general data realizes, when carrying out data access, directly access local file, the server memory of required consumption is very little, hardly committed memory, thereby reduced to greatest extent memory consumption, improved the toggle speed of server; And data not can because of server restart or fault is lost, guaranteed the safety of data.And this programme can be supported the access of large concurrent, realizes data access quickly and accurately.
The embodiment of the present invention two respectively take data read, the scene of data insertion, data modification and data deletion is as example, illustrates the data managing method that this programme provides.
Data read
Referring to Fig. 2, data read operation comprises following processing:
21: check whether local index file (or being called for short index file) is up-to-date version.
For example, setup times stamp information in this programme, described timestamp information records the time of modification or the change of local index file and local data file;
Whether the modification time that checks the local index file is consistent with the local index file Last modification time in timestamp information, if confirm that the local index file is up-to-date version, execution in step 22, if not, confirm that the local index file is not up-to-date version, execution in step 23.
22: check whether local data file (or being called for short data file) is up-to-date version.
Whether the modification time that checks local data file is consistent with the local data file Last modification time in timestamp information, if confirm that local data file is up-to-date version, execution in step 24, if not, confirm that local data file is not up-to-date version, execution in step 23.
23: reload latest document.
According to timestamp information, reload up-to-date index file and/or data file.When the file of new loading can successfully be opened, in the time of namely can normally using, execution in step 24.
24: read side-play amount.
Read out the positional information of institute's visit data, i.e. side-play amount from the index file of latest edition.
25: the skew file pointer.
Utilize file pointer that data are positioned in data file, file pointer is moved to above-mentioned side-play amount indicated position.
26: obtain data.
Read the indicated data of pointer under current location, obtain required data.
Data are inserted
This programme adopts will increase data data inserting end-of-file newly, referring to Fig. 3, comprise following processing:
31: the offset data file pointer is to end-of-file (new data inserting is positioned at end-of-file all the time).
This document afterbody is next data position of the last item data with existing in local data file.
32: the offset word joint number that obtains data file pointer current location.
Above-mentioned offset word joint number be the tail of file position with respect to the side-play amount of file header, be the positional information of newly-increased data.
33: the offset word joint number is write in index file.
In the side-play amount of newly-increased data and binary tree structure that key word is added into index file.
34: whether judgement writes successful.
Whether judgement is successful to writing of index file, for example, and after executing write operation, index file returns to response message, according to the index file response message that receives, after confirming successfully to write described side-play amount in the local index file, continue the executing data update, otherwise, again write index file until write successfully, perhaps, return to the inserting error code, insert unsuccessfully, finish update.
After index file writes successfully, newly-increased data are write the tail of file of local data file.
Further, in this programme before data that will increase newly write the tail of file of local data file, described method also comprises: according to having stored the key word of data and the key word of newly-increased data in local data file, confirm not exist in local data file the data with existing identical with newly-increased data, if newly-increased data are identical with data with existing, return and insert unsuccessfully.Guaranteed no longer to repeat to increase identical data by this operation, saved file resource.
Further, can data be inserted in the index file and data file of latest edition by timestamp information.
Data modification
41: check whether index file is up-to-date version.
For example, setup times stamp information in this programme, described timestamp information records the time of modification or the change of local index file and local data file;
Whether the modification time that checks the local index file is consistent with the local index file Last modification time in timestamp information, if confirm that the local index file is up-to-date version, execution in step 42, if not, confirm that the local index file is not up-to-date version, execution in step 43.
42: check whether data file is up-to-date version.
Whether the modification time that checks local data file is consistent with the local data file Last modification time in timestamp information, if confirm that local data file is up-to-date version, execution in step 44, if not, confirm that local data file is not up-to-date version, execution in step 43.
43: reload latest document.
According to timestamp information, reload up-to-date index file and/or data file.When the file of new loading can successfully be opened, in the time of namely can normally using, execution in step 44.
44: read side-play amount.
Read out the positional information of required Update Table from the index file of latest edition, i.e. side-play amount.
45: the skew file pointer.
Utilize file pointer that data are positioned in the data file of latest edition, file pointer is moved to above-mentioned side-play amount indicated position.
46: Update Table.
Revise the indicated data of pointer under current location.
The data deletion
51: check whether index file is up-to-date version.
For example, setup times stamp information in this programme, described timestamp information records the time of modification or the change of local index file and local data file;
Whether the modification time that checks the local index file is consistent with the local index file Last modification time in timestamp information, if confirm that the local index file is up-to-date version, execution in step 52, if not, confirm that the local index file is not up-to-date version, execution in step 53.
52: check whether data file is up-to-date version.
Whether the modification time that checks local data file is consistent with the local data file Last modification time in timestamp information, if confirm that local data file is up-to-date version, execution in step 54, if not, confirm that local data file is not up-to-date version, execution in step 53.
53: reload latest document.
According to timestamp information, reload up-to-date index file and/or data file.When the file of new loading can successfully be opened, in the time of namely can normally using, execution in step 54.
54: read side-play amount.
Read out the positional information of required deletion data, i.e. side-play amount from the index file of latest edition.After reading side-play amount, delete the side-play amount that reads in indexed file, thereby the person that makes the data access can't get the positional information of data.The also key word of deletion data in indexed file further.
55: the skew file pointer.
Utilize file pointer that data are positioned in up-to-date data file, file pointer is moved to above-mentioned side-play amount indicated position, determine the position of data to be deleted in local data file.
56: Update Table.
In data file, the indicated data of file pointer under the deletion current location.Further, also can delete simultaneously the key word of the data to be deleted of storing in data file.
The sight demand in practice of considering the data deletion is less, after deleting data in this programme in data file, keep the storage space of corresponding position in local data file, thereby avoided again regenerating index file, reduce the complexity of safeguarding of database.
The embodiment of the present invention three provides a kind of data management system, and referring to Fig. 6, described system comprises local file database 61 and database access device 62,
Described local file database 61 creates the local data file of storing data, generates the local index file according to described local data file, and described local index file comprises every data positional information in data file;
Described database access device 62 when receiving request of access, obtains the positional information of institute's visit data from the local index file according to request of access, and, access corresponding data in local data file according to described positional information.
Further, described local file database 61 specifically generates the local index file according to binary tree structure, in described binary tree structure node comprise the key word of data and these data in data file with respect to the side-play amount of data reference position, this side-play amount is described positional information;
Described database access device 62 is specifically according to the key word that carries in request of access, and search obtains the side-play amount of institute's visit data in the binary tree structure of local index file.
Further, described database access device 62 is before obtaining the positional information of institute's visit data according to request of access from the local index file, check whether the local index file is up-to-date version, if, obtain described positional information from this local index file, if not, load the local index file of latest edition, obtain described positional information from the local index file of new loading;
Described database access device 62 is before accessing corresponding data according to described positional information in local data file, check whether local data file is up-to-date version, if, the corresponding data of access in this local data file, if not, load the local data file of latest edition, the corresponding data of access in the new local data file that loads.
Further, be provided with timestamp information in the system of the present embodiment, described timestamp information records the modification time of local index file and local data file;
Described database access device 62 checks whether the local index file is that up-to-date version comprises:
Whether the modification time that checks the local index file is consistent with the local index file Last modification time in timestamp information, if, confirm that the local index file is up-to-date version, if not, confirm that the local index file is not up-to-date version;
Described database access device 62 checks whether local data file is that up-to-date version comprises:
Whether the modification time that checks local data file is consistent with the local data file Last modification time in timestamp information, if, confirm that local data file is up-to-date version, if not, confirm that local data file is not up-to-date version.
Further, described database access device 62 also increases new data in the following way in local file database 61:
Obtain the side-play amount of next data of the last item data with existing in local data file; Described side-play amount is write in the local index file; Newly-increased data are write the tail of file of local data file.
Further, described database access device 62 is also modified in 61 pairs of data of local file database in the following way:
Obtain the side-play amount of data to be modified according to the key word of data to be modified from the local index file;
According to accessed side-play amount, determine the position of data to be modified in local data file;
To the data to be modified of definite position modify.
Further, described database access device 62 is also deleted data in the following way in local file database 61:
After obtaining the side-play amount of data to be deleted according to the key word of data to be deleted from the local index file, the side-play amount of data to be deleted in deletion local index file; According to accessed side-play amount, determine the position of data to be deleted in local data file, the data to be deleted of the definite position of deletion institute, and in the reservation local data file the storage space of definite position.
In system embodiment of the present invention, the specific works mode of each device can be referring to the embodiment of the method for the embodiment of the present invention.
The embodiment of the present invention adopts the form storage data of local file and the index of data, because adopting the document form storage, general data realizes, when carrying out data access, directly access local file, the server memory of required consumption is very little, committed memory hardly, thus memory consumption reduced to greatest extent, improved the toggle speed of server; And data not can because of server restart or fault is lost, guaranteed the safety of data.And this programme can be supported the access of large concurrent, realizes data access quickly and accurately.
From the above mentioned, the embodiment of the present invention can reach following technique effect at least:
1) general data adopts the local storage of document form, need not during data access first file load to server, thereby need take hardly the internal memory of server;
2) data access speed is fast, and for the file with 8,000 ten thousand data, the wall scroll data retrieval time is no more than 30 microseconds, with directly suitable in the time of internal memory data query, and, much larger than the retrieval time of 100 milliseconds of existing database;
3) because what adopt is local file, do not need so service starts the internal memory of reloading, service is accelerated start-up time greatly, and server is restarted or during fault, data file does not have any loss;
4) provide a fairly perfect Generating Data File instrument of cover, so do not need secondary development just can construct a local file database, tempo of development is fast;
5) when using and develop, retrieve data such as only need to open, inquire about, close at three actions, has greatly saved time and the personnel cost of exploitation.
This programme can be widely used in note up-downgoing management system, for example up sorting, filtering black list user, filtration VIP user, user area information retrieval etc.
The above is only preferred embodiment of the present invention, is not for limiting protection scope of the present invention.All any modifications of doing within the spirit and principles in the present invention, be equal to replacement, improvement etc., include in protection scope of the present invention.
Claims (10)
1. a data managing method, is characterized in that, described method comprises:
Create the local data file of storage data;
Generate the local index file according to described local data file, described local index file comprises every data positional information in local data file;
When receiving request of access, obtain the positional information of institute's visit data according to request of access from the local index file;
Access corresponding data in local data file according to described positional information.
2. method according to claim 1, is characterized in that, describedly generates the local index file according to described local data file and comprise:
Generate the local index file according to binary tree structure, in described binary tree structure node comprise the key word of data and these data in local data file with respect to the side-play amount of data reference position, this side-play amount is described positional information;
The described positional information of obtaining institute's visit data according to request of access from the local index file comprises:
According to the key word that carries in request of access, search obtains the side-play amount of institute's visit data in the binary tree structure of local index file.
3. method according to claim 1, is characterized in that,
Before obtaining the positional information of institute's visit data according to request of access from the local index file, described method also comprises:
Check whether the local index file is up-to-date version, if, obtain described positional information from this local index file, if not, load the local index file of latest edition, obtain described positional information from the local index file of new loading;
Before accessing corresponding data according to described positional information in local data file, described method also comprises:
Check whether local data file is up-to-date version, if the corresponding data of access in this local data file if not, load the local data file of latest edition, the corresponding data of access in the new local data file that loads.
4. method according to claim 3, is characterized in that, setup times stamp information, and described timestamp information records the modification time of local index file and local data file;
Whether described inspection local index file is that up-to-date version comprises:
Whether the modification time that checks the local index file is consistent with the local index file Last modification time in timestamp information, if, confirm that the local index file is up-to-date version, if not, confirm that the local index file is not up-to-date version;
Whether described inspection local data file is that up-to-date version comprises:
Whether the modification time that checks local data file is consistent with the local data file Last modification time in timestamp information, if, confirm that local data file is up-to-date version, if not, confirm that local data file is not up-to-date version.
5. method according to claim 3, is characterized in that, described method also comprises increases new data in the following way:
Obtain the side-play amount of next data of the last item data with existing in local data file;
The key word of described side-play amount and newly-increased data is write in the local index file;
Newly-increased data are write the tail of file of local data file.
6. method according to claim 5, is characterized in that,
Before newly-increased data were write the tail of file of local data file, described method also comprised:
According to the index file response message that receives, confirm described side-play amount and key word are successfully write in the local index file; And,
According to having stored the key word of data and the key word of newly-increased data in local data file, confirm not exist in local data file the data with existing identical with newly-increased data.
7. method according to claim 3, is characterized in that, described method also comprises in the following way modifies to data:
Obtain the side-play amount of data to be modified according to the key word of data to be modified from the local index file;
According to accessed side-play amount, determine the position of data to be modified in local data file;
To the data to be modified of definite position modify.
8. method according to claim 3, is characterized in that, described method also comprises deletes data in the following way:
After obtaining the side-play amount of data to be deleted according to the key word of data to be deleted from the local index file, the side-play amount of data to be deleted in deletion local index file;
According to accessed side-play amount, determine the position of data to be deleted in local data file, the data to be deleted of the definite position of deletion institute, and in the reservation local data file the storage space of definite position.
9. a data management system, is characterized in that, described system comprises local file database and database access device,
Described local file database creates the local data file of storing data, generates the local index file according to described local data file, and described local index file comprises every data positional information in local data file;
Described database access device when receiving request of access, obtains the positional information of institute's visit data from the local index file according to request of access, and, access corresponding data in local data file according to described positional information.
10. system according to claim 9, is characterized in that,
Described local file database specifically generates the local index file according to binary tree structure, in described binary tree structure node comprise the key word of data and these data in data file with respect to the side-play amount of data reference position, this side-play amount is described positional information;
Described database access device is specifically according to the key word that carries in request of access, and search obtains the side-play amount of institute's visit data in the binary tree structure of local index file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011104395529A CN103177026A (en) | 2011-12-23 | 2011-12-23 | Data management method and data management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011104395529A CN103177026A (en) | 2011-12-23 | 2011-12-23 | Data management method and data management system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103177026A true CN103177026A (en) | 2013-06-26 |
Family
ID=48636907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011104395529A Pending CN103177026A (en) | 2011-12-23 | 2011-12-23 | Data management method and data management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103177026A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111159209A (en) * | 2019-12-27 | 2020-05-15 | 云汉芯城（上海）互联网科技股份有限公司 | Data processing device and method, electronic equipment and storage medium |
| WO2021031640A1 (en) * | 2019-08-16 | 2021-02-25 | 深圳中兴网信科技有限公司 | Data read-write method, computer device and computer-readable storage medium |
| CN112783896A (en) * | 2021-01-12 | 2021-05-11 | 湖北宸威玺链信息技术有限公司 | Method for reducing memory usage rate for loading files |
| CN113672585A (en) * | 2020-05-13 | 2021-11-19 | 中国石油天然气集团有限公司 | Excitation point data processing method and device for seismic exploration |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020178178A1 (en) * | 2001-04-24 | 2002-11-28 | Luosheng Peng | Apparatus and methods for intelligently caching applications and data on a gateway |
| CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
| CN1798108A (en) * | 2004-12-23 | 2006-07-05 | 腾讯科技（深圳）有限公司 | Method and system for implementing background of instant communication |
| CN101069239A (en) * | 2004-12-03 | 2007-11-07 | Lg电子株式会社 | Method and apparatus for reproducing a data recorded in recording medium using a local storage |
| CN101122938A (en) * | 2007-09-25 | 2008-02-13 | 北大方正集团有限公司 | Data file safe treatment method and system |
| CN101197844A (en) * | 2007-12-12 | 2008-06-11 | 浙江大学 | File memory method based on subscription issuing system |
| CN101917328A (en) * | 2009-12-17 | 2010-12-15 | 新奥特（北京）视频技术有限公司 | Method for locally storing and searching streaming media and network player |
| CN102137163A (en) * | 2011-03-22 | 2011-07-27 | Tcl集团股份有限公司 | Multimedia file sharing system and method |
-
2011
- 2011-12-23 CN CN2011104395529A patent/CN103177026A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020178178A1 (en) * | 2001-04-24 | 2002-11-28 | Luosheng Peng | Apparatus and methods for intelligently caching applications and data on a gateway |
| CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
| CN101069239A (en) * | 2004-12-03 | 2007-11-07 | Lg电子株式会社 | Method and apparatus for reproducing a data recorded in recording medium using a local storage |
| CN1798108A (en) * | 2004-12-23 | 2006-07-05 | 腾讯科技（深圳）有限公司 | Method and system for implementing background of instant communication |
| CN101122938A (en) * | 2007-09-25 | 2008-02-13 | 北大方正集团有限公司 | Data file safe treatment method and system |
| CN101197844A (en) * | 2007-12-12 | 2008-06-11 | 浙江大学 | File memory method based on subscription issuing system |
| CN101917328A (en) * | 2009-12-17 | 2010-12-15 | 新奥特（北京）视频技术有限公司 | Method for locally storing and searching streaming media and network player |
| CN102137163A (en) * | 2011-03-22 | 2011-07-27 | Tcl集团股份有限公司 | Multimedia file sharing system and method |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021031640A1 (en) * | 2019-08-16 | 2021-02-25 | 深圳中兴网信科技有限公司 | Data read-write method, computer device and computer-readable storage medium |
| CN111159209A (en) * | 2019-12-27 | 2020-05-15 | 云汉芯城（上海）互联网科技股份有限公司 | Data processing device and method, electronic equipment and storage medium |
| CN113672585A (en) * | 2020-05-13 | 2021-11-19 | 中国石油天然气集团有限公司 | Excitation point data processing method and device for seismic exploration |
| CN112783896A (en) * | 2021-01-12 | 2021-05-11 | 湖北宸威玺链信息技术有限公司 | Method for reducing memory usage rate for loading files |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110321344B (en) | Information query method and device for associated data, computer equipment and storage medium | |
| CN110879813B (en) | Binary log analysis-based MySQL database increment synchronization implementation method | |
| CN108319654B (en) | Computing system, cold and hot data separation method and device, and computer readable storage medium | |
| US8924365B2 (en) | System and method for range search over distributive storage systems | |
| US7769792B1 (en) | Low overhead thread synchronization system and method for garbage collecting stale data in a document repository without interrupting concurrent querying | |
| US7634517B1 (en) | System and method for dynamically updating a document repository without interrupting concurrent querying | |
| CN104572920A (en) | Data arrangement method and data arrangement device | |
| CN109726177A (en) | A kind of mass file subregion indexing means based on HBase | |
| US10776345B2 (en) | Efficiently updating a secondary index associated with a log-structured merge-tree database | |
| CN111198856B (en) | File management method, device, computer equipment and storage medium | |
| CN102955792A (en) | Method for implementing transaction processing for real-time full-text search engine | |
| EP3788505B1 (en) | Storing data items and identifying stored data items | |
| CN110597630B (en) | Method and system for processing content resources in distributed system | |
| CN106161193B (en) | Mail processing method, device and system | |
| US7617226B1 (en) | Document treadmilling system and method for updating documents in a document repository and recovering storage space from invalidated documents | |
| CN106446044B (en) | Storage space recovery method and device | |
| CN110515958A (en) | Data consistency method, apparatus, equipment and storage medium based on big data | |
| CN105183391B (en) | The method and apparatus that data store under a kind of distributed data platform | |
| CN103177026A (en) | Data management method and data management system | |
| CN111259017B (en) | Order retrieval method, computer device, and storage medium | |
| CN110866068B (en) | Advertisement data storage method and device based on HDFS | |
| CN108647280A (en) | A kind of method and apparatus of memory communicating information | |
| CN111125129A (en) | Data processing method and device, storage medium and processor | |
| CN115469810A (en) | Data acquisition method, device, equipment and storage medium | |
| CN101556595A (en) | Method for fast positioning relevant documents in document 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130626 |
|
| RJ01 | Rejection of invention patent application after publication |