CN103389992A - Structured data storage method and device - Google Patents
Structured data storage method and device Download PDFInfo
- Publication number
- CN103389992A CN103389992A CN2012101436818A CN201210143681A CN103389992A CN 103389992 A CN103389992 A CN 103389992A CN 2012101436818 A CN2012101436818 A CN 2012101436818A CN 201210143681 A CN201210143681 A CN 201210143681A CN 103389992 A CN103389992 A CN 103389992A
- Authority
- CN
- China
- Prior art keywords
- write
- length
- field
- data
- identification information
- 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 structured data storage method and a structured data storage device. The structured data storage method comprises the following steps: generating identification information of a structural body to be stored; determining the type of a field to be stored in the structural body to be stored; writing the identification information of the structural body, a fixed-length data part of the structural body and a variable-length data part of the structural body in sequence to generate serialized structural body data in a storage space; and establishing unique correspondence of the identification information and a storage format of the serialized structural body. By applying the scheme provided by the invention, high efficiency close to compact binary storage can be provided by using a compact storage scheme without losing the flexibility similar to that of protobuf, so that flexible adaptation of structural body data of different versions can be realized.
Description
Technical field
The present invention relates to technical field of data processing, particularly relate to a kind of structuralized data storage method and device.
Background technology
In spider framework fusion application, LinkCache need to store the association attributes data of Link.The characteristics of Link data are that field quantity is a lot, but most of field is all very short, or even bit (bit) bit field, so data storage efficiency is larger for the impact of data performance.On the other hand, in actual applications, the schema of Link data (structure) often can relate to the modification of field, therefore for the data dirigibility, also has higher requirement.
In the prior art, closely the efficiency of binary storage method is very high, but dirigibility is too poor, can not accomplish that schema on-the-fly modifies, and can't be applicable to the actual storage application of Link data.XML, JSON etc. have higher dirigibility based on the text sequence mode of tag, but the required additional storage space that takies is more, cause the low of storage and transmission performance; Protobuf is a kind of structural data packaging method of increasing income that Google company provides, and with XML, JSON, compares, and protobuf uses scale-of-two tag to replace text tag, has reduced to a certain extent the packing amount of capacity, has promoted storage efficiency.But it has still stored the metamessages such as field name or field sequence number, when the content of field own is less, can cause the serious waste of storage space.
Summary of the invention
For solving the problems of the technologies described above, the embodiment of the present invention provides a kind of structuralized data storage method and device, and the high-level efficiency near tight binary storage can be provided, and has again the dirigibility of data upgrading preferably simultaneously, and technical scheme is as follows:
The embodiment of the present invention provides a kind of structuralized data storage method, comprising:
Generate the identification information of structure to be stored;
Determine the type of field to be stored in structure to be stored;
In storage space, the elongated data division of the fixed-length data of the identification information of write structure body, structure part and structure successively, formation sequence structure data;
Set up the unique corresponding relation of described identification information and described serializing structure storage format.
According to a kind of embodiment of the present invention, the identification information of described this structure of generation comprises:
, according to the title of structure to be stored, utilize hash algorithm to generate the identification information of this structure.
According to a kind of embodiment of the present invention, the fixed-length data part of said write structure comprises:
The byte boundary fixed-length field of write structure body;
The bit boundaries fixed-length field of write structure body.
According to a kind of embodiment of the present invention, the fixed-length data part of said write structure also comprises:
The property value of write structure body Optional Field.
According to a kind of embodiment of the present invention, the elongated data division of said write structure comprises:
The byte boundary variable-length field of write structure body;
The bit boundaries variable-length field of write structure body.
According to a kind of embodiment of the present invention, in the situation that variable-length field to be written is non-array type:
Write successively length mark and the field contents of this field.
According to a kind of embodiment of the present invention, in the situation that variable-length field to be written is array type:
At first write the length mark of this array, then write successively respectively the content of length mark and the element of each element in this array.
The embodiment of the present invention also provides a kind of structural data memory storage, comprising:
The identification information generation unit, for the identification information that generates structure to be stored;
The type determining unit, for the type of determining structure to be stored field to be stored;
Writing unit, be used at storage space, the elongated data division of the fixed-length data of the identification information of write structure body, structure part and structure successively, formation sequence structure data;
Associative cell, for the unique corresponding relation of setting up described identification information and described serializing structure storage format.
According to a kind of embodiment of the present invention, described identification information generation unit specifically is used for:
, according to the title of structure to be stored, utilize hash algorithm to generate the identification information of this structure.
According to a kind of embodiment of the present invention, the said write unit comprises that fixed length partly writes subelement, specifically is used for:
The byte boundary fixed-length field of write structure body;
The bit boundaries fixed-length field of write structure body.
According to a kind of embodiment of the present invention, described fixed length partly writes subelement, also is used for:
The property value of write structure body Optional Field.
According to a kind of embodiment of the present invention, the said write unit comprises that elongated part writes subelement, specifically is used for:
The byte boundary variable-length field of write structure body;
The bit boundaries variable-length field of write structure body.
According to a kind of embodiment of the present invention, described elongated part writes subelement,, in the situation that variable-length field to be written is non-array type, writes successively length mark and the field contents of this field.
According to a kind of embodiment of the present invention, described elongated part writes subelement, in the situation that variable-length field to be written is array type, at first write the length mark of this array, then write successively respectively the content of length mark and the element of each element in this array.
Apply structural data storage scheme provided by the present invention, adopt the closely scheme of storage, in storing process, the structure sign is set up unique corresponding relation with storage format, that is to say, according to the sign of structure just can unique specified data storage format, thereby avoid storing the metamessages such as field name, field sequence number, the high-level efficiency near tight binary storage is provided.On the other hand, can not lose again the dirigibility of similar protobuf, can realize the adaptive flexibly of different editions structure data.
Description of drawings
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, below will the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described, apparently, the accompanying drawing that the following describes is only some embodiment that put down in writing in the present invention,, for those of ordinary skills, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is a kind of process flow diagram of structuralized data storage method of the present invention;
Fig. 2 is data memory format schematic diagram of the present invention;
Fig. 3 is the structuralized data storage method process flow diagram of a specific embodiment of the present invention;
Fig. 4 is the data memory format schematic diagram of a specific embodiment of the present invention;
Fig. 5 a-5g is respectively the each several part data memory format schematic diagram of a specific embodiment of the present invention;
Fig. 6 is the data unserializing method flow diagram of a specific embodiment of the present invention;
Fig. 7 is the data adaptation method process flow diagram of a specific embodiment of the present invention;
Fig. 8 a-8b is the adaptive test result schematic diagram of the data of a specific embodiment of the present invention;
Fig. 9 is the structural representation of structural data memory storage of the present invention.
Embodiment
In order to make those skilled in the art understand better technical scheme in the present invention, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is described in detail, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skills obtain, should belong to the scope of protection of the invention.
At first a kind of structuralized data storage method that the embodiment of the present invention is provided describes, and is shown in Figure 1, and the method can comprise the following steps:
S101, the identification information of generation structure to be stored;
S102, determine the type of field to be stored in structure to be stored;
S103, in storage space, the elongated data division of the fixed-length data of the identification information of write structure body, structure part and structure successively, formation sequence structure data;
S104, set up the unique corresponding relation of described identification information and described serializing structure storage format.
Apply data storage scheme provided by the present invention, the storage format of structure data after serializing as shown in Figure 2.
1) IID part.
IID is the sign of this structure data-interface.In one embodiment of the invention, IID can utilize hash algorithm to generate according to structure schema name.Certainly, the present invention does not need to limit to the concrete grammar that generates IID.
2) data division.
The data that are used for each field of storage.Can determine schema and below fully by IID " data division " storage format.
Data division can further be divided into two parts again generally:
2.1) the fixed length part.
2.2) elongated part.
This differentiation is for performance optimization.Because the fixed length part can unify to adopt more high efficiency mode to read and write.
According to the storage mode of current computer data, 8 data bits (bit) form a byte (byte),, in order further to optimize memory property,, in fixed length part and elongated part, data can be divided into respectively two classes again:
A) byte boundary data:
Be that size of data is the data of the integral multiple of 8bit.
B) bit boundaries data:
Corresponding with the byte boundary data, namely size of data is not the data of the integral multiple of 8bit.
Above-mentioned difference mode is also to take into account the one-step optimization performance.In general, the bit boundaries data are slower than the read-write of byte boundary data, and reason is to carry out the bit shifting function.If bit boundaries data and byte boundary data mixing are stored, can make so a large amount of byte boundary data also need displacement, therefore they are separated.
In addition, the fixed length bit boundaries data that also have a kind of specific type: the bitmap of Optional Field.This part is used for one or more property values of expression structure, and each Optional Field represents with a bit (0/1) whether this Optional Field exists actual data.
Apply structural data storage scheme provided by the present invention, adopt the closely scheme of storage, in storing process, the structure sign is set up unique corresponding relation with storage format, that is to say, according to the sign of structure just can unique specified data storage format, thereby avoid storing the metamessages such as field name, field sequence number, the high-level efficiency near tight binary storage is provided.On the other hand, can not lose again the dirigibility of similar protobuf, can realize the adaptive flexibly of different editions structure data.
Below in conjunction with the example of a reality, date storage method of the present invention is described:
Supposing the system is current need to be stored the relevant information of webpage, defines a web data structure as follows:
In the said structure body, " document_1_0_0 " is the title of structure, and wherein " _ 1_0_0 " is version number, is used for distinguishing different editions document object.
Each explanation of field that relates in the said structure body is as shown in table 1:
Table 1
In the said structure volume data, the data type specification that relates to is as shown in table 2:
Table 2
Wherein, links[] be an array, comprise the data of a plurality of string types.
Publish_time and title are Optional Fields.Optional Field is used for the field that is of little use, and is used for saving storage space.When this field was not used, it only can take a bit space, the i.e. bitmap of Optional Field noted earlier.
After creating document object as above, each field of document object is carried out assignment process, as follows:
In said method, common field is revised by the set_xxx function.The array field is added new data by the add_xxx function at afterbody.Certainly, the present invention does not need to limit to concrete data modification mode.
As seen, in above-mentioned code, publish_time does not have assignment for Optional Field, and for Optional Field title assignment, is " using Baidu.com, you just know ".In addition, link[] array size be 2, corresponding array element is 2 character strings " www.sina.com.cn " and " www.qq.com ".
According to structuralized data storage method provided by the present invention, for the structural data of above-mentioned assignment, as shown in Figure 3, as shown in Figure 4, concrete storing step is described below the serializing data layout of final storage its storage means:
1) write the IID sign:
As shown in Figure 5 a, what at first write is the IID sign of 4 bytes, and this is the head of serializing structure data.According to the title " document_1_0_0 " of structure, the value that can utilize hash algorithm to obtain IID is 0x98660B3C, and this IID can unique definite field of storing later and form, makes system know how this goes to resolve the data of back.
2) write the byte boundary fixed-length field:
As shown in Figure 5 b, be next to write fixed length byte boundary member field.Here only has the content_sign field.The content_sign value is 0x123456, accounts for 64 (8 bytes).In ablation process, can store according to modes such as little endian, big endian, the present invention does not need this to limit.
3) write the bit boundaries fixed-length field:
Next be to write fixed length bit boundaries part field.Comprising two parts content: the bitmap of optional field, and is_html field.
Two optional field: publish_time and title are arranged in document schema.Wherein publish_time does not have assignment, so correspondence writes 0; And title has carried out assignment, so correspondence writes 1.
The value of is_html field is 1.
As shown in Figure 5 c, three fields of publish_time, title and is_html are closely stored, and account for altogether 3 bit.To byte boundary, back has supplemented 5 bit 0 for polishing, and the data that this byte finally writes are 0110000.
4) write the byte boundary variable-length field:
Next need to write elongated boundary member data, this part data further comprises byte boundary fixed-length field and bit boundaries variable-length field.According to the structure that the embodiment of the present invention creates, elongated byte boundary member field comprises: url, page, links, publish_time and title be totally 5 parts, and do not comprise the bit boundaries variable-length field.Below writing respectively of variable-length word joint boundary member field described:.
Url is character string type.Value is " www.baidu.com ", and length is 13.Character string type is first memory length sign when serializing, then stores successively each character.The result that finally writes is as shown in Fig. 5 d.In the invention process, the length part is stored according to the uint64 mode, and uint64 is a kind of variable length integer compression algorithm, can also adopt here such as compression algorithms such as varint and realize, the present invention does not need to limit to concrete storage means.13 bytes need 1 bytes store under the uint64 compression algorithm, the value length mark value of storage is 26.In length mark value back, followed by the value that writes the url field " www.baidu.com ".
The page field is the same with url is character string type, comprises 46 characters, and the length mark value that writes is 92, and the result that finally writes is as shown in Fig. 5 e.Therefore wherein,, because Chinese character of storage need to take two bytes, when the line feed storage, use respectively in figure (L) and (H) as differentiation.
Links[] field is the character string array type.For array type, first write the array length sign, then write successively respectively the content of length mark and the element of each element in this array.In the present embodiment, array length is 2, compressing the length mark value that writes after storage is 4, and corresponding array element is that 2 character strings " www.sina.com.cn " and " www.qq.com " length are respectively 15 and 10, the ident value difference 30 and 20 that writes after the compression storage.The result that finally writes is as shown in Fig. 5 f:
Next should store publish_time in order, but pushlish_time is the optional field, and, not by assignment, therefore directly omits.
Store finally title.Title is also the optional field, but has been composed value, therefore store the same with common character string.In this example, the title field comprises 18 characters, and the length mark value that writes is 36, and the result that finally writes is as shown in Fig. 5 g.
For the serializing structure data of above-mentioned storage, when carrying out unserializing, at first read 4 byte IID, then according to the storage format of IID specified data, then carry out corresponding parse operation, restore raw data.Shown in Figure 6, the process of unserializing document object is basic corresponding one by one with the process that writes serializing document object, no longer is repeated in this description in the embodiment of the present invention.
The scheme that the application embodiment of the present invention provides, after can also further solving the upgrading of structure data, the read/write compatibility problem of the old and new's edition data.In embodiment in front, define individual web data structure document_1_0_0, supposed to have added now new schema version: document_1_0_1, as follows:
As seen document_1_0_1 derives from from document_1_0_0, document_1_0_1 has inherited all Field Definitions of document_1_0_0, document_1_0_1 has also added newer field a: page_rank in addition, and type is double-precision floating points: double.
According to the title " document_1_0_1 " of redaction structure, the value that can utilize hash algorithm to obtain IID is 0xDFB56A93, and is different from the IID value 0x98660B3C of document_1_0_0.
Apply scheme provided by the present invention,, in order to realize the compatibility between different editions schema, can carry out adaptive from mobile interface between the schema that inheritance is specifically arranged.For example, according to the inheritance between document_1_0_1 and document_1_0_0, system can generate two adapter class automatically:
adapter_document_1_0_0_to_document_1_0_1
(being abbreviated as adapter_old_to_new)
adapter_document_1_0_1_to_document_1_0_0
(being abbreviated as adapter_new_to_old)
Above-mentioned two adapter class, be used for respectively old schema object dispatching is become new interface, and new schema object dispatching become old interface.
Shown in Figure 7, when carrying out unserializing, at first read 4 byte IID of save data, determine the data of redaction schema preservation or the data that legacy version schema preserves according to the value of IID, and create corresponding object obj, carry out corresponding unserializing process.
Then,, according to presently used schema version (by target IID judgement), determine directly to return obj, or obj is carried out after adaptive returning again.
In test process, first with redaction schema storage data, then with legacy version schema, data reading is come, as shown in Figure 8 a.
Can see, in the unserializing process, first according to new schema, do unserializing, carry out adaptively after unserializing with adapter_new_to_old, new object dispatching be become the interface of legacy version schema.Therefore,, although be the data of with redaction schema, preserving, with legacy version schema, still can correctly read out.This adaptation procedure is transparent to external world, gives user's sensation and uses real old schema object indifference.
Similarly, first with legacy version schema storage data, then with redaction schema, data reading is come, as shown in Figure 8 b.
Can see, in the unserializing process, first according to old schema, do unserializing, carry out adaptively after unserializing with adapter_old_to_new, old object dispatching be become the interface of redaction schema.Therefore,, although be the data of with legacy version schema, preserving, with redaction schema, still can correctly read out.
Corresponding to top embodiment of the method, the present invention also provides a kind of structural data memory storage, and is shown in Figure 9, and this device can comprise:
Identification information generation unit 810, for the identification information that generates structure to be stored;
According to a kind of embodiment of the present invention, described identification information generation unit 810 specifically can be used for:
, according to the title of structure to be stored, utilize hash algorithm to generate the identification information of this structure.
According to a kind of embodiment of the present invention, said write unit 830 comprises that fixed length partly writes subelement, specifically is used for:
The byte boundary fixed-length field of write structure body;
The bit boundaries fixed-length field of write structure body.
According to a kind of embodiment of the present invention, described fixed length partly writes subelement, also is used for:
The property value of write structure body Optional Field.
According to a kind of embodiment of the present invention, said write unit 830 comprises that elongated part writes subelement, specifically is used for:
The byte boundary variable-length field of write structure body;
The bit boundaries variable-length field of write structure body.
According to a kind of embodiment of the present invention, described elongated part writes subelement,, in the situation that variable-length field to be written is non-array type, writes successively length mark and the field contents of this field.
According to a kind of embodiment of the present invention, described elongated part writes subelement, in the situation that variable-length field to be written is array type, at first write the length mark of this array, then write successively respectively the content of length mark and the element of each element in this array.
, for the convenience of describing, be divided into various unit with function while describing above device and describe respectively.Certainly, can realize the function of each unit in same or a plurality of softwares and/or hardware when enforcement is of the present invention.
As seen through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential general hardware platform.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product can be stored in storage medium, as ROM/RAM, magnetic disc, CD etc., comprise that some instructions are with so that a computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of some part of each embodiment of the present invention or embodiment.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and between each embodiment, identical similar part is mutually referring to getting final product, and each embodiment stresses is difference with other embodiment.Especially, for device or system embodiment, substantially similar in appearance to embodiment of the method, so describe fairly simplely, relevant part gets final product referring to the part explanation of embodiment of the method due to it.Apparatus and system embodiment described above is only schematic, wherein said unit as the separating component explanation can or can not be also physically to separate, the parts that show as unit can be or can not be also physical locations, namely can be positioned at a place, perhaps also can be distributed on a plurality of network element.Can select according to the actual needs wherein some or all of module to realize the purpose of the present embodiment scheme.Those of ordinary skills in the situation that do not pay creative work, namely can understand and implement.
The above is only the specific embodiment of the present invention; should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (14)
1. a structuralized data storage method, is characterized in that, comprising:
Generate the identification information of structure to be stored;
Determine the type of field to be stored in structure to be stored;
In storage space, the elongated data division of the fixed-length data of the identification information of write structure body, structure part and structure successively, formation sequence structure data;
Set up the unique corresponding relation of described identification information and described serializing structure storage format.
2. method according to claim 1, is characterized in that, the identification information of described this structure of generation comprises:
, according to the title of structure to be stored, utilize hash algorithm to generate the identification information of this structure.
3. method according to claim 1, is characterized in that, the fixed-length data part of said write structure comprises:
The byte boundary fixed-length field of write structure body;
The bit boundaries fixed-length field of write structure body.
4. method according to claim 3, is characterized in that, the fixed-length data part of said write structure also comprises:
The property value of write structure body Optional Field.
5. method according to claim 1, is characterized in that, the elongated data division of said write structure comprises:
The byte boundary variable-length field of write structure body;
The bit boundaries variable-length field of write structure body.
6. method according to claim 5, is characterized in that, in the situation that variable-length field to be written is non-array type:
Write successively length mark and the field contents of this field.
7. method according to claim 5, is characterized in that, in the situation that variable-length field to be written is array type:
At first write the length mark of this array, then write successively respectively the content of length mark and the element of each element in this array.
8. a structural data memory storage, is characterized in that, comprising:
The identification information generation unit, for the identification information that generates structure to be stored;
The type determining unit, for the type of determining structure to be stored field to be stored;
Writing unit, be used at storage space, the elongated data division of the fixed-length data of the identification information of write structure body, structure part and structure successively, formation sequence structure data;
Associative cell, for the unique corresponding relation of setting up described identification information and described serializing structure storage format.
9. device according to claim 8, is characterized in that, described identification information generation unit specifically is used for:
, according to the title of structure to be stored, utilize hash algorithm to generate the identification information of this structure.
10. device according to claim 8, is characterized in that, the said write unit comprises that fixed length partly writes subelement, specifically is used for:
The byte boundary fixed-length field of write structure body;
The bit boundaries fixed-length field of write structure body.
11. device according to claim 10, is characterized in that, described fixed length partly writes subelement, also is used for:
The property value of write structure body Optional Field.
12. device according to claim 8, is characterized in that, the said write unit comprises that elongated part writes subelement, specifically is used for:
The byte boundary variable-length field of write structure body;
The bit boundaries variable-length field of write structure body.
13. device according to claim 12, is characterized in that, described elongated part writes subelement,, in the situation that variable-length field to be written is non-array type, writes successively length mark and the field contents of this field.
14. device according to claim 12, it is characterized in that, described elongated part writes subelement, in the situation that variable-length field to be written is array type, at first write the length mark of this array, then write successively respectively the content of length mark and the element of each element in this array.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101436818A CN103389992A (en) | 2012-05-09 | 2012-05-09 | Structured data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012101436818A CN103389992A (en) | 2012-05-09 | 2012-05-09 | Structured data storage method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103389992A true CN103389992A (en) | 2013-11-13 |
Family
ID=49534268
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012101436818A Pending CN103389992A (en) | 2012-05-09 | 2012-05-09 | Structured data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103389992A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104573118A (en) * | 2015-02-05 | 2015-04-29 | 北京北大高科指纹技术有限公司 | Fingerprint and palm print data file storing method, fingerprint and palm print data file exchanging method and devices of methods |
| CN105095268A (en) * | 2014-05-12 | 2015-11-25 | 深圳市同洲电子股份有限公司 | Method and apparatus for accessing structured data |
| CN105468712A (en) * | 2015-11-20 | 2016-04-06 | 成都科来软件有限公司 | Data storage compatibility method |
| CN106446272A (en) * | 2016-10-20 | 2017-02-22 | 北京百度网讯科技有限公司 | Method and device for sending data |
| CN106547786A (en) * | 2015-09-22 | 2017-03-29 | 阿里巴巴集团控股有限公司 | A kind of date storage method and device |
| CN106815238A (en) * | 2015-11-30 | 2017-06-09 | 阿里巴巴集团控股有限公司 | A kind of serializing of structural data, unserializing method and device |
| CN107633027A (en) * | 2017-08-29 | 2018-01-26 | 深圳市诚壹科技有限公司 | Data processing method and device |
| CN107992624A (en) * | 2017-12-22 | 2018-05-04 | 百度在线网络技术（北京）有限公司 | Parse method, apparatus, storage medium and the terminal device of serialized data |
| CN108197324A (en) * | 2018-02-06 | 2018-06-22 | 百度在线网络技术（北京）有限公司 | For storing the method and apparatus of data |
| CN108540477A (en) * | 2018-04-13 | 2018-09-14 | 腾讯科技(成都)有限公司 | The method and relevant device of data communication |
| CN109388635A (en) * | 2017-08-03 | 2019-02-26 | 广东蓝盾移动互联网信息科技有限公司 | A kind of data storage method of the multi-value data based on binary system and dictionary table |
| CN109933291A (en) * | 2019-03-20 | 2019-06-25 | 浪潮商用机器有限公司 | A kind of processing method of SRAM data, device, equipment and storage medium |
| CN110191156A (en) * | 2019-05-08 | 2019-08-30 | 深圳前海微众银行股份有限公司 | A kind of data processing method and device based on block chain |
| CN110377561A (en) * | 2019-07-19 | 2019-10-25 | 深圳前海微众银行股份有限公司 | A kind of file management method and device |
| CN111124551A (en) * | 2019-11-22 | 2020-05-08 | 矩阵元技术（深圳）有限公司 | Data serialization and deserialization method and device and computer equipment |
| CN114356232A (en) * | 2021-12-30 | 2022-04-15 | 西北工业大学 | Data reading and writing method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477532A (en) * | 2008-12-23 | 2009-07-08 | 北京畅游天下网络技术有限公司 | Method, apparatus and system for implementing data storage and access |
| CN101923569A (en) * | 2010-07-09 | 2010-12-22 | 南京朗坤软件有限公司 | Storage method of structure type data of real-time database |
-
2012
- 2012-05-09 CN CN2012101436818A patent/CN103389992A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101477532A (en) * | 2008-12-23 | 2009-07-08 | 北京畅游天下网络技术有限公司 | Method, apparatus and system for implementing data storage and access |
| CN101923569A (en) * | 2010-07-09 | 2010-12-22 | 南京朗坤软件有限公司 | Storage method of structure type data of real-time database |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105095268A (en) * | 2014-05-12 | 2015-11-25 | 深圳市同洲电子股份有限公司 | Method and apparatus for accessing structured data |
| CN104573118B (en) * | 2015-02-05 | 2018-03-02 | 北京北大高科指纹技术有限公司 | Fingers and palms line data file storage method, exchange method and its device |
| CN104573118A (en) * | 2015-02-05 | 2015-04-29 | 北京北大高科指纹技术有限公司 | Fingerprint and palm print data file storing method, fingerprint and palm print data file exchanging method and devices of methods |
| CN106547786A (en) * | 2015-09-22 | 2017-03-29 | 阿里巴巴集团控股有限公司 | A kind of date storage method and device |
| CN105468712A (en) * | 2015-11-20 | 2016-04-06 | 成都科来软件有限公司 | Data storage compatibility method |
| CN106815238A (en) * | 2015-11-30 | 2017-06-09 | 阿里巴巴集团控股有限公司 | A kind of serializing of structural data, unserializing method and device |
| CN106815238B (en) * | 2015-11-30 | 2020-10-20 | 阿里巴巴集团控股有限公司 | Serialization and deserialization method and device for structured data |
| CN106446272A (en) * | 2016-10-20 | 2017-02-22 | 北京百度网讯科技有限公司 | Method and device for sending data |
| CN109388635A (en) * | 2017-08-03 | 2019-02-26 | 广东蓝盾移动互联网信息科技有限公司 | A kind of data storage method of the multi-value data based on binary system and dictionary table |
| CN107633027A (en) * | 2017-08-29 | 2018-01-26 | 深圳市诚壹科技有限公司 | Data processing method and device |
| CN107992624A (en) * | 2017-12-22 | 2018-05-04 | 百度在线网络技术（北京）有限公司 | Parse method, apparatus, storage medium and the terminal device of serialized data |
| CN107992624B (en) * | 2017-12-22 | 2020-08-04 | 百度在线网络技术（北京）有限公司 | Method, device, storage medium and terminal equipment for analyzing serialized data |
| CN108197324A (en) * | 2018-02-06 | 2018-06-22 | 百度在线网络技术（北京）有限公司 | For storing the method and apparatus of data |
| CN108197324B (en) * | 2018-02-06 | 2021-07-16 | 百度在线网络技术（北京）有限公司 | Method and apparatus for storing data |
| CN108540477A (en) * | 2018-04-13 | 2018-09-14 | 腾讯科技(成都)有限公司 | The method and relevant device of data communication |
| CN109933291A (en) * | 2019-03-20 | 2019-06-25 | 浪潮商用机器有限公司 | A kind of processing method of SRAM data, device, equipment and storage medium |
| CN110191156A (en) * | 2019-05-08 | 2019-08-30 | 深圳前海微众银行股份有限公司 | A kind of data processing method and device based on block chain |
| CN110191156B (en) * | 2019-05-08 | 2021-11-09 | 深圳前海微众银行股份有限公司 | Data processing method and device based on block chain |
| CN110377561A (en) * | 2019-07-19 | 2019-10-25 | 深圳前海微众银行股份有限公司 | A kind of file management method and device |
| WO2021013047A1 (en) * | 2019-07-19 | 2021-01-28 | 深圳前海微众银行股份有限公司 | File management method and apparatus |
| CN111124551A (en) * | 2019-11-22 | 2020-05-08 | 矩阵元技术（深圳）有限公司 | Data serialization and deserialization method and device and computer equipment |
| CN111124551B (en) * | 2019-11-22 | 2023-11-17 | 矩阵元技术（深圳）有限公司 | Data serialization and data deserialization methods, devices and computer equipment |
| CN114356232A (en) * | 2021-12-30 | 2022-04-15 | 西北工业大学 | Data reading and writing method and device |
| CN114356232B (en) * | 2021-12-30 | 2024-04-09 | 西北工业大学 | Data reading and writing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103389992A (en) | Structured data storage method and device | |
| CN101122899B (en) | Report generation method and device | |
| CN100507839C (en) | Method and system for mapping content between a starting template and a target template | |
| CN103559184B (en) | The display packing of forms pages and device | |
| CN102024046B (en) | Data repeatability checking method and device as well as system | |
| CN103914438A (en) | Template and tag implementation based excel display and export method and system | |
| CN103123631B (en) | The generation of official documents and correspondence, the methods of exhibiting of webpage official documents and correspondence, device and Website server | |
| CN110399169A (en) | Amending method, device, equipment and the readable storage medium storing program for executing of BIOS option | |
| CN102841901A (en) | Web page display method and device | |
| CN107451237A (en) | Serializing and unserializing method, apparatus and equipment | |
| CN102982127A (en) | Method of replacing characters in batch to achieve multi-language version and batch processing device | |
| CN106648569A (en) | Target serialization achieving method and device | |
| CN105320513A (en) | I/O (input/output) method suitable for any SEG-Y seismic data | |
| CN106843962A (en) | One kind application packaging method and device | |
| CN106909554A (en) | A kind of loading method and device of database text table data | |
| CN103309849B (en) | A kind of docx document creation based on OpenXML and amending method | |
| CN104881461A (en) | Rapid data storage method | |
| CN104395881A (en) | Representation and conversion of dynamically-typed arrays | |
| CN102567419B (en) | Mass data storage device and method based on tree structure | |
| CN102387120A (en) | File transmission method, server, client and network transmission system | |
| CN102473175B (en) | Compression of XML data | |
| CN111427845B (en) | Interactive modeling analysis operator data exchange method | |
| CN105657521A (en) | Channel data storage method and device | |
| CN102855115A (en) | Method and system for displaying character label based on splicing wall | |
| CN104932982A (en) | Message access memory compiling method and related apparatus |
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: 20131113 |
|
| RJ01 | Rejection of invention patent application after publication |