CN103870462B - A kind of data processing method and device - Google Patents
A kind of data processing method and device Download PDFInfo
- Publication number
- CN103870462B CN103870462B CN201210528212.8A CN201210528212A CN103870462B CN 103870462 B CN103870462 B CN 103870462B CN 201210528212 A CN201210528212 A CN 201210528212A CN 103870462 B CN103870462 B CN 103870462B
- Authority
- CN
- China
- Prior art keywords
- record data
- data
- storage node
- mark
- record
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
Abstract
The present invention provides a kind of data processing method and device, method and comprised the following steps：One memory table is set, and the memory table includes the storage node of at least two-stage, and the storage node is used for the address of data storage or next stage storage node；Reception is inserted into record data, it is described be inserted into record data and include be inserted into Data Identification；Judge whether and be inserted into record data mark identical record data mark；If being identified in the presence of with the record data mark identical record data that is inserted into, the record data that is inserted into is parsed at least one cell data, and cell data are stored in next stage storage node.
Description
【Technical field】
The present invention relates to technical field of data processing, more particularly to a kind of data processing method and device.
【Background technology】
With being on the increase for data to be processed is needed, very high requirement is proposed to data-handling efficiency.
In a distributed manner exemplified by the memory table of database, prior art is mainly carried out by the memory table of two kinds of structures to data
Storage, first, the memory table based on skip list (skiplist) structure, another is the memory table based on balancing tree structure.
But the memory table whether based on skip list structure, or the memory table based on balancing tree structure, remember in insertion
When recording data or inquiry record data, due under extreme scenes, O (N) is reduced to by O (logN) time complexity, and
And waste of the insertion storage for internal memory based on full key is very big, needs to parse when record data is inserted to memory table
Into the key keys of Lothrus apterus, cause the efficiency for inserting record data low, and then reduce the efficiency of record data storage.
Therefore, need to solve technical problem present in prior art.
【The content of the invention】
It is an object of the present invention to provide a kind of data processing method, it is intended to solves of the prior art based on complete
Waste of the key insertion storage for internal memory is very big, needs to be parsed into Lothrus apterus when record data is inserted to memory table
Key keys, cause the low technical problem of the efficiency of storage to record data and inquiry.
In order to solve the above technical problems, the present invention constructs a kind of data processing method, the described method comprises the following steps：
Reception is inserted into record data, it is described be inserted into record data and include be inserted into Data Identification；
Judge whether and be inserted into record data mark identical record data mark；
If being identified in the presence of with the record data mark identical record data that is inserted into, record number is inserted into by described
According to being parsed at least one cell data, and cell data are stored in memory table, the memory table includes at least two-stage
Storage node, the storage node is used for the address of data storage or next stage storage node, the cell data storage
In the next stage storage node of the memory table.
It is another object of the present invention to provide a kind of data processing method, it is intended to solves of the prior art based on complete
Waste of the key insertion storage for internal memory is very big, needs to be parsed into Lothrus apterus when record data is inserted to memory table
Key keys, cause the low technical problem of the efficiency of storage to record data and inquiry.
In order to solve the above technical problems, the present invention constructs a kind of data processing equipment, described device includes：
Memory module, the memory module include a memory table, and the memory table includes the storage node of at least two-stage, institute
State the address that storage node is used for data storage or next stage storage node；
Receiving module, record data is inserted into for receiving, it is described be inserted into record data and include be inserted into data mark
Know；
Judge module, for judging whether and being inserted into record data mark identical record data mark；
Processing module, for exist with it is described be inserted into record data mark identical record data and identify when, by institute
State and be inserted into record data and be parsed at least one cell data, and cell data are deposited in next stage storage node
Storage.
Relative to prior art, the present invention pre-sets a memory table, and the memory table includes the storage node of at least two-stage,
The storage node is used for the address of data storage or next stage storage node；Record data is inserted into receiving, first
Judge whether and be inserted into record data mark identical record data mark；If it is inserted into record data in the presence of with described
Identical record data mark is identified, then the record data that is inserted into is parsed at least one cell data, and will be thin
Born of the same parents' data are stored in next stage storage node.The present invention improves the efficiency to record data storage, and then improves number
According to treatment effeciency.
For the above of the present invention can be become apparent, preferred embodiment cited below particularly, and coordinate institute's accompanying drawings, make
Describe in detail as follows：
【Brief description of the drawings】
Fig. 1 is the preferred embodiment schematic flow sheet provided by the invention according to processing method；
Fig. 2 is the preferred embodiment structural representation of memory table in the present invention；
Fig. 3 is the structural representation of record data in the present invention；
Fig. 4 is the structural representation of cell data in the present invention；
Fig. 5 is schematic diagram when being stored in the present invention to different record datas；
Fig. 6 is that the schematic diagram for being inserted into record data correct position is searched in the present invention；
Fig. 7 is structural representation when data are inquired about in the present invention；
Fig. 8 is to identify the schematic diagram for carrying out prefix compression in the present invention to record data；
Fig. 9 is the preferred embodiment structural representation of data processing equipment provided by the invention.
【Embodiment】
The explanation of following embodiment is with reference to additional schema, to illustrate the particular implementation that the present invention can be used to implementation
Example.The direction term that the present invention is previously mentioned, such as " on ", " under ", "front", "rear", "left", "right", " interior ", " outer ", " side "
Deng being only the direction with reference to annexed drawings.Therefore, the direction term used is to illustrate and understand the present invention, and is not used to
The limitation present invention.In figure, the similar unit of structure is represented with identical label.
Referring to Fig. 1, Fig. 1 is the preferred embodiment schematic flow sheet of data processing method provided by the invention.
In step S101, a memory table (Memtable) is pre-set.The wherein memory table depositing including at least two-stage
Node is stored up, the storage node of non-afterbody is additionally operable to store its corresponding next stage storage node in addition to data storage
Address.
For example referring to Fig. 2, Fig. 2 is a preferred embodiment structural representation of memory table provided by the invention.The internal memory
Table includes the storage node of two-stage, i.e. one-level storage node A and secondary storage node B, and secondary storage node B is one-level storage knot
Point A next stage storage node.Wherein one-level storage node A also stores secondary storage node B ground in addition to data storage
Location, for example storage node A11 internal memories contain secondary storage node B address.
For example referring to Fig. 3, Fig. 3 is the structural representation of record data in the present invention, wherein record data is a certain deposits
The set of one group of data composition under storage mark (Rowkey), wherein record data include record data mark (Record_
) and multiple cell data (Rell) key.
Referring to Fig. 4, Fig. 4 is the structural representation of cell data in the present invention.Wherein cell data are data storage
Minimum data unit, it includes cell Data Identification (Rell_key) and cell value (Rell_value), wherein the cell
Data Identification carries timestamp, i.e., each corresponding cell Data Identification of timestamp, therefore identical cell data are not present
Mark.In the present invention, record data is stored in one-level storage node A, and cell data are stored in secondary storage node B.
In step s 102, receive and be inserted into record data, judge whether identical with being inserted into record data mark
Record data mark, if in the presence of carrying out step S103, otherwise carry out step S104.
If stored without the record data of identical recordings Data Identification before, the storage location for being inserted into record data is
One-level storage node A, it is described to be inserted into record if the record data for having had identical recordings Data Identification before this stores
The storage location of data is secondary storage node B.
In step s 103, the record data that is inserted into is parsed at least one cell data, and by cell number
Stored according in secondary storage node B.
For example referring to Fig. 5, exemplified by storing the first record data record1 and the second record data record2.Wherein
The conflict that first record data record1 is identified due to no identical record data, one-level storage node A is stored to, and
Second record data record2 comes in due to having the record data insertion of identical recordings Data Identification before, therefore by second
Record data record2 is parsed into the cell data of 3 Lothrus apterus, and each cell data are found in secondary storage node B
Correct position, and cell Data Identification is stored by the way of prefix compression.
In specific implementation process, exemplified by storing the first record data record1, the first record data is being searched
During correct position to be stored record1, the embodiment of the present invention preferably uses the correct position of successively binary search
Stored.Assuming that the first record data record1 record data is identified as X, and assume A2<C1<C2<C3<F1<F2<X<
F3<C4<A3, wherein A1, A2, A3 ... B1, B2, B3 etc. are the record data mark of storage node in storage nodes at different levels, for example
A1, A2, A3 ... are the record data mark of each storage node in one-level storage node A.
Referring specifically to Fig. 6, searched first on the one-level storage node A of memory table：Because X is more than A2 and is less than
A3, then by binary search to A2 storage nodes, and then judge that X is stored in corresponding to A2 storage nodes in branch, for example A2
Storage node corresponds to next stage storage node C.Searched afterwards in next stage storage node C：Because X is more than C3, then pass through two points
Method finds C3 storage nodes, and then judges that X is stored in corresponding to C3 storage nodes in branch, under for example C3 storage nodes are corresponding
One-level storage node F.Continue to be searched on next stage storage node F afterwards, the like, the storage node per one-level is all
By the corresponding next stage storage node of binary search, until reaching the afterbody storage node in memory table, you can
Find correct position.For example when it is F3 storage nodes that afterbody storage node F, which finds storage location, then F3 is stored
Moved after node, and X is inserted into the original position of F3 storage nodes.
In step S104, stored to being inserted into after record data mark carries out prefix compression.
In specific implementation process, in addition to the step of inquiry, referring to Fig. 7, the available record data mark that is inserted into is made
For search index, inquired about in memory table and whether be stored with corresponding record data；If being stored with corresponding record data,
And the record data stored is located at one-level storage node A, then corresponding cell data are obtained in corresponding record data；If
Corresponding record data is stored with, and the record data stored is located at secondary storage node B, then searches cell data mark
Know, the cell Data Identification corresponding record Data Identification, and inquired about by the use of the cell Data Identification as index, if inquiring
Corresponding cell data, then prove successful inquiring, otherwise proves inquiry failure.
In specific implementation process, when carrying out prefix compression to being inserted into record data mark, suitable benchmark is selected
Key (base key) carries out prefix compression to being inserted into record data mark, then stores to correct position.Wherein benchmark key is
The key of the benchmark of prefix compression is used as, for example the first record data record1 the first record data mark M1；This hair
In all already present record data marks are met, selected benchmark key may be such that to be inserted into the benchmark key of bright selection
The compressible byte number of Data Identification of record data is most.
For example, the first record data record1 has the first record data mark M1, the second record data record2 tool
There are the second record data mark M2, the first record data record1 and the second record data record2 to store to memory table,
It is the 3rd record data record3 to be inserted into record data, and it has the 3rd record data mark M3, the 3rd record data mark
It is BufferLen to know M3 committed memories, first looks for identifying the immediate second record data marks of M3 with the 3rd record data
Know M2, it is assumed that the second record data mark M2 is supplied to the 3rd record data mark M3 length of common prefix string to be
PrefixLen, then PrefixLen is less than or equal to the second record data mark M2 and the 3rd record data identifies the public of M3
The length SameLen of prefix string, i.e.,：PrefixLen<SameLen.
Taken up space assuming that preserving compression information as Threshold, then when the 3rd record data mark M3 compresses：Institute's duty
Between be following formula (1)：
BufferLen–PrefixLen+Threshold (1)；
3rd record data mark M3 takes up space as wei BufferLen when not compressing；
Assuming that the 4th record data record4 has the 4th record data mark M4, record data mark M4 and M2, M3 are extremely
The common prefix string of rare SameLen length, the 4th record data mark M4 size is BufferSize；When the 4th record number
During according to mark M4 insertions, the service condition in space is respectively：
If the 3rd record data mark M3 is compressed, the size that the 4th record data mark M4 can compress is base
Caused by benchmark key (B) in the 3rd record data mark M3, then finally required for the 4th record data of preservation mark M4
Space is similarly formula (1), i.e.,：
BufferSize–PrefixLen+Threshold
If the 3rd record data mark M3 is uncompressed, the 3rd record data mark M3 can serve as M4 benchmark
Key, then the 3rd record data mark M3 can at least provide SameLen compression stroke give the 4th record data mark M4, then
4th record data identifies M4, and its space consuming is following formula (2) during key on the basis of the 3rd record data mark M3：
BufferSize–SameLen+Threshold (2)
In the case of the 3rd record data mark M3 compresses and be uncompressed, when the 4th record data mark M4 is inserted
Total space consumption is respectively T1 and T2：
T1=BufferLen-PrefixLen+Threshold+BufferSize-PrefixLen+Threshold (3)
T2=BufferLen+BufferSize-SameLen+Threshold (4)
T2<T1, it can be deduced that：SameLen>2*PrefixLen-Threshold, it is clear that when SameLen with
When PrefixLen, Threshold meet above-mentioned relation, being inserted into the record data mark key of record data can not compress,
Record data mark key can be as the benchmark key of next record data mark for each and every one being inserted into record data, so as to carry
For bigger compression stroke.
The process for carrying out prefix compression is identified to record data referring to Fig. 8, the notes of the first record data record1 and second
The record data mark for recording data record2 is respectively 200 bytes and 230 bytes, wherein it is identical to have 180 bytes
, under conditions of being compressed without prefix, only stored record Data Identification needs 230+200=430 byte altogether.According to preceding
Sew the mode of compression, key carries out prefix compression, storage the second record data mark on the basis of the first record data mark M1
M2 need byte number be：With the address of 8 byte keeping records Data Identifications, total length is preserved with 4 bytes, with 4 words
Section preserves the length of compression, along with unpressed 230-180=50 byte below, needs byte number altogether：8+4+4+50=66
Individual byte.Then need in the prior art with 230 bytes come the data preserved, 66 bytes of need after progress prefix compression
Complete to preserve.
Referring to Fig. 9, Fig. 9 is the preferred embodiment structural representation of data processing equipment provided by the invention.The dress
Put including memory module 81, receiving module 82, judge module 83, processing module 84 and enquiry module 85.
The memory module 81 includes a memory table, and the memory table includes the storage node of at least two-stage, the storage
Node is used for the address of data storage or next stage storage node, the detailed description referring specifically to Fig. 2 and for Fig. 2.
The receiving module 82, which receives, is inserted into record data, it is described be inserted into record data and include be inserted into data mark
Know；The judge module 83 judges whether and is inserted into record data mark identical record data mark.
Identified if the judge module 83 judges to exist with the record data mark identical record data that is inserted into,
The record data that is inserted into is parsed at least one cell data by the processing module 84, and by cell data next
Level storage node is stored.If the judge module 83 judges to be not present is inserted into record data mark identical note with described
Data Identification is recorded, then the processing module 84 stores described be inserted into after record data mark carries out prefix compression.Preferably,
The processing module 84 stores after carrying out prefix compression to the cell Data Identification of cell data.
By it is described be inserted into record data mark and carry out prefix compression when, the processing module 84 searches a record data
Mark as be inserted into record data mark benchmark key, it is described be inserted into record data identify by the benchmark key be defined into
Row compression, wherein the record data mark searched meets following formula：
SameLen>2*PrefixLen–Threshold；
Wherein SameLen is the length that the record data identifies the common prefix string with being inserted into record data mark；
PrefixLen is the length that record data mark is supplied to the common prefix string for being inserted into Data Identification；Threshold
Taken up space by preserving compression information in the memory table.
More specifically, the memory table includes one-level storage node and secondary storage node, and the enquiry module is being carried out
When record data is inquired about, identified by the use of record data as search index, inquired about in memory table and whether be stored with corresponding note
Record data；If corresponding record data has been stored with, and the record data stored is located at one-level storage node, then corresponding
Corresponding cell data are obtained in record data；If the record data stored is located at secondary storage node, with cell data
Mark is inquired about as index, if cell data corresponding to inquiring, successful inquiring, and otherwise inquiry failure.
In summary, although the present invention is disclosed above with preferred embodiment, above preferred embodiment simultaneously is not used to limit
The system present invention, one of ordinary skill in the art, without departing from the spirit and scope of the present invention, it can make various changes and profit
Decorations, therefore protection scope of the present invention is defined by the scope that claim defines.
Claims (10)
- A kind of 1. data processing method, it is characterised in that：It the described method comprises the following steps：Reception is inserted into record data, it is described be inserted into record data and include be inserted into Data Identification；Judge whether and be inserted into record data mark identical record data mark；If being identified in the presence of with the record data mark identical record data that is inserted into, record data solution is inserted into by described At least one cell data are analysed into, and cell data are stored in memory table, the memory table is deposited including at least two-stage Node is stored up, the storage node is used for the address of data storage or next stage storage node, and the cell data are stored in institute In the next stage storage node for stating memory table.
- 2. data processing method according to claim 1, it is characterised in that：Methods described is further comprising the steps of：If being identified in the absence of with the record data mark identical record data that is inserted into, record data is inserted into by described Mark stores after carrying out prefix compression.
- 3. data processing method according to claim 1, it is characterised in that：Cell data are entered in next stage storage node During row storage, specifically include：To being stored after the cell Data Identification progress prefix compression of cell data.
- 4. data processing method according to claim 2, it is characterised in that：Progress is identified to the record data of record data The step of prefix is compressed specifically includes：Record data mark is searched, the record data searched is identified as the benchmark key for being inserted into record data mark, The record data mark that is inserted into is defined by the benchmark key and is compressed, wherein under the record data mark searched meets Formula：SameLen>2*PrefixLen–Threshold；Wherein SameLen is the length that the record data identifies the common prefix string with being inserted into record data mark； PrefixLen is the length that record data mark is supplied to the common prefix string for being inserted into Data Identification；Threshold Taken up space by preserving compression information in the memory table.
- 5. data processing method according to claim 1, it is characterised in that：The memory table include one-level storage node and Secondary storage node, the secondary storage node is being sequentially the next stage storage node of the one-level storage node, described Method is additionally included in the process of the memory table inquiry data, and the process of the inquiry data includes：By the use of record data mark as search index, whether it has been stored with pair according to the sequential query of storage node in memory table The record data answered；If being stored with corresponding record data, the storage node belonging to record data corresponding to being stored with is judged：If The record data stored is located at one-level storage node, then corresponding cell data are obtained in corresponding record data；If The record data of storage is located at secondary storage node, then searches a cell Data Identification, and the cell Data Identification corresponds to the note Data Identification is recorded, and is inquired about as index by the use of the cell Data Identification found, if inquiring corresponding cell data, Successful inquiring, otherwise inquiry failure.
- A kind of 6. data processing equipment, it is characterised in that：Described device includes：Memory module, the memory module include a memory table, and the memory table includes the storage node of at least two-stage, described to deposit Store up the address that node is used for data storage or next stage storage node；Receiving module, record data is inserted into for receiving, it is described be inserted into record data and include be inserted into Data Identification；Judge module, for judging whether and being inserted into record data mark identical record data mark；Processing module, for exist with it is described be inserted into record data mark identical record data and identify when, treated described Insertion record data is parsed at least one cell data, and cell data are stored in next stage storage node.
- 7. data processing equipment according to claim 6, it is characterised in that：The processing module, be additionally operable in the absence of With it is described be inserted into record data mark identical record data and identify when, the record data mark that is inserted into is subjected to prefix Stored after compression.
- 8. data processing equipment according to claim 6, it is characterised in that：The processing module, is additionally operable to cell number According to cell Data Identification carry out prefix compression after store.
- 9. data processing equipment according to claim 7, it is characterised in that：The processing module, it is additionally operable to search a note Data Identification is recorded, it is described to be inserted into using the record data searched mark as the benchmark key for being inserted into record data mark Record data mark is defined by the benchmark key to be compressed, wherein the record data mark searched meets following formula：SameLen>2*PrefixLen–Threshold；Wherein SameLen is the length that the record data identifies the common prefix string with being inserted into record data mark； PrefixLen is the length that record data mark is supplied to the common prefix string for being inserted into Data Identification；Threshold Taken up space by preserving compression information in the memory table.
- 10. data processing equipment according to claim 6, it is characterised in that：The memory table includes one-level storage node With secondary storage node, the secondary storage node is being sequentially the next stage storage node of the one-level storage node, institute Stating device also includes enquiry module, the enquiry module, for being identified by the use of record data as search index, is pressed in memory table Corresponding record data whether has been stored with according to the sequential query of storage node；If being stored with corresponding record data, the storage node belonging to record data corresponding to being stored with is judged：If The record data stored is located at one-level storage node, then corresponding cell data are obtained in corresponding record data；If The record data of storage is located at secondary storage node, then searches a cell Data Identification, and the cell Data Identification corresponds to the note Data Identification is recorded, and is inquired about as index by the use of the cell Data Identification found, if inquiring corresponding cell data, Successful inquiring, otherwise inquiry failure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210528212.8A CN103870462B (en) | 2012-12-10 | 2012-12-10 | A kind of data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210528212.8A CN103870462B (en) | 2012-12-10 | 2012-12-10 | A kind of data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103870462A CN103870462A (en) | 2014-06-18 |
| CN103870462B true CN103870462B (en) | 2018-02-09 |
Family
ID=50909006
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210528212.8A Active CN103870462B (en) | 2012-12-10 | 2012-12-10 | A kind of data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103870462B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017161589A1 (en) * | 2016-03-25 | 2017-09-28 | 华为技术有限公司 | Method and apparatus for compression indexing of character string sequences |
| CN108280229B (en) * | 2018-02-26 | 2022-01-25 | 腾讯科技（深圳）有限公司 | Memory data read-write method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6922830B1 (en) * | 2000-03-10 | 2005-07-26 | International Business Machines Corporation | Skip list data storage during compilation |
| CN101604309A (en) * | 2008-06-13 | 2009-12-16 | 上海宝信软件股份有限公司 | Dram mapped data storehouse and management method thereof |
| CN101741708A (en) * | 2008-11-13 | 2010-06-16 | 华为技术有限公司 | Method, device and system for storing data |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8375062B2 (en) * | 2007-11-19 | 2013-02-12 | Oracle America, Inc. | Simple optimistic skiplist |
-
2012
- 2012-12-10 CN CN201210528212.8A patent/CN103870462B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6922830B1 (en) * | 2000-03-10 | 2005-07-26 | International Business Machines Corporation | Skip list data storage during compilation |
| CN101604309A (en) * | 2008-06-13 | 2009-12-16 | 上海宝信软件股份有限公司 | Dram mapped data storehouse and management method thereof |
| CN101741708A (en) * | 2008-11-13 | 2010-06-16 | 华为技术有限公司 | Method, device and system for storing data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103870462A (en) | 2014-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102122285B (en) | Data cache system and data inquiry method | |
| CN109982128B (en) | Video bullet screen generation method and device, storage medium and electronic device | |
| CN101540723B (en) | Flow stream searching method and device | |
| CN103150397B (en) | A kind of data directory creation method, data retrieval method and system | |
| CN102622434B (en) | Data storage method, data searching method and device | |
| EP0884688A3 (en) | Sparse index search method | |
| CN101751473A (en) | The searching of a kind of amendment record item, renewal and method for synchronous and data sync equipment | |
| CN101621502A (en) | Method and device for storing and searching routing table | |
| CN104636349B (en) | A kind of index data compression and the method and apparatus of index data search | |
| CN105976302A (en) | Configurable data comparing method and system | |
| CN105224532A (en) | Data processing method and device | |
| CN101751475B (en) | Method for compressing section records and device therefor | |
| CN106294769A (en) | The mthods, systems and devices of Simultaneous Engineering data | |
| CN106649722A (en) | Storing and inquiring method for high-frequency data of monitoring system | |
| CN103870462B (en) | A kind of data processing method and device | |
| CN107169003B (en) | Data association method and device | |
| CN106250476A (en) | A kind of methods, devices and systems updated and synchronize white list | |
| CN106933919A (en) | The connection method of tables of data and device | |
| CN103780263B (en) | Device and method of data compression and recording medium | |
| CN105760485A (en) | Financial data extraction method and system | |
| CN104298570B (en) | Data processing method and device | |
| CN107590233B (en) | File management method and device | |
| CN105320609A (en) | Mobile terminal based data storage method and system | |
| CN110032586B (en) | Storage method, query method and acquisition and storage system for energy storage cell data | |
| CN104463627B (en) | Data processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |