CN105892956A - High-complexity distributed type storage method and system - Google Patents
High-complexity distributed type storage method and system Download PDFInfo
- Publication number
- CN105892956A CN105892956A CN201610410851.2A CN201610410851A CN105892956A CN 105892956 A CN105892956 A CN 105892956A CN 201610410851 A CN201610410851 A CN 201610410851A CN 105892956 A CN105892956 A CN 105892956A
- Authority
- CN
- China
- Prior art keywords
- data
- data message
- stored
- binary code
- chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0643—Management of files
Abstract
The invention discloses a high-complexity distributed type storage method and a high-complexity distributed type storage system. The high-complexity distributed type storage method comprises the following steps: correspondingly generating at least one data information chain by using original file data to be stored; according to preset information translation rules, translating each data information chain into binary encoding sequences of two or more than two sections; allocating all binary encoding sequences corresponding to each data information chain to different storage areas for storage, wherein the storage area is an ideal storage area in physical storage equipment. Therefore, by adopting the high-complexity distributed type storage method and the high-complexity distributed type storage system, as the finally stored data are of binary formats, the binary encoding sequences can be stored by using conventional cheap physical storage equipment, high complexity of conventional low-class physical storage equipment can be achieved, no expense storage equipment for storage is needed, and thus the large-data storage cost is lowered.
Description
Technical field
The present invention relates to reading and writing data technical field, particularly to a kind of high multiplexing distributed storage method and
System.
Background technology
Currently, along with the arrival of big data age, people can produce magnanimity number every day in work and life
According to.In order to store these big data, it has been developed that the physical storage device of high-performance high power capacity, profit
Use these physical storage devices, can effectively mass data be stored.
But, the purchase cost of above-mentioned physical storage device is the highest, makes general client be difficult to bear.
Visible, how reducing big data carrying cost is to have problem to be solved at present.
Summary of the invention
In view of this, it is an object of the invention to provide a kind of high multiplexing distributed storage method and system,
Significantly reduce big data carrying cost.Its concrete scheme is as follows:
A kind of high multiplexing distributed storage method, including:
Utilize original file data to be stored, correspondingly generate at least one data message chain；
According to presupposed information translation rule, every data message sense is translated to two or more two
Scale coding sequence；
The all binary code sequences corresponding from every data message sense are distributed to different memory areas
Store；Wherein, described memory area is the idle memory region on physical storage device.
Preferably, described utilize original file data to be stored, correspondingly generate at least one data letter
The process of breath chain, including:
Obtain original file data to be stored；
Described file to be stored data are decomposed, is correspondingly made available at least one data message chain.
Preferably, described described file to be stored data are decomposed, be correspondingly made available at least one number
According to the process of message sense, including:
Described original file data is carried out feature extraction, is correspondingly made available at least one data characteristic information；
According to presupposed information mapping mechanism, each data characteristic information is mapped to corresponding data message
Chain.
Preferably, described presupposed information translation rule is for being used for determining data message chain and binary coding sequence
The rule of mapping relations between row；Wherein, any data message sense all binary codings with at least two sections
Sequence pair should.
Preferably, described method, also include:
Obtain the data read request for file destination data that client sends；
Described file destination data are resolved, to determine the institute for synthesizing described file destination data
There is data message chain；
According to all data message chains of the described file destination data of synthesis, from corresponding physical storage device
In read out corresponding binary code sequence；
All binary code sequences reading gone out are translated into corresponding data message chain and merge place
Reason, the file data obtained after then merging feeds back to described client.
The invention also discloses a kind of high multiplexing distributed memory system, including:
Message sense generation module, for utilizing original file data to be stored, correspondingly generates at least one
Data message sense；
Message sense translation module, for according to presupposed information translation rule, translating every data message sense
Binary code sequence for two or more；
Sequence distribution memory module, for by all binary coding sequences corresponding with every data message sense
Row are distributed to different memory areas and store；Wherein, described memory area is on physical storage device
Idle memory region.
Preferably, described message sense generation module includes:
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for described file to be stored data are decomposed, be correspondingly made available to
A few data message sense.
Preferably, described data decomposition submodule includes:
Feature information extraction unit, for described original file data being carried out feature extraction, correspondingly
To at least one data characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, reflects each data characteristic information
Penetrate into corresponding data message chain.
Preferably, described presupposed information translation rule is for being used for determining data message chain and binary coding sequence
The rule of mapping relations between row；Wherein, any data message sense all binary codings with at least two sections
Sequence pair should.
Preferably, described system, also include:
Read requests acquisition module, the data for file destination data sent for obtaining client are read
Take request；
Data resolution module, for resolving described file destination data, to determine for synthesizing
State all data message chains of file destination data；
Sequence read module, is used for all data message chains according to the described file destination data of synthesis, from
Corresponding physical storage device reads out corresponding binary code sequence；
Message sense merges module, for all binary coding sequences read out by described sequence read module
Row are translated into corresponding data message chain and carry out merging treatment, the file data obtained after then merging
Feed back to described client.
In the present invention, high multiplexing distributed storage method includes: utilize original file data to be stored,
Correspondingly generate at least one data message chain；According to presupposed information translation rule, by every data information
Chain translates to the binary code sequence of two or more；By the institute corresponding with every data message sense
Have binary code sequence to be distributed to different memory areas to store；Wherein, memory area is physics
Idle memory region in storage device.Visible, in the present invention, when needs carry out data storage,
Generate corresponding data message chain first with original file data, then every data message sense is translated into
The binary code sequence of at least two sections, and the sequence after translation is distributed to different memory areas carries out
Storage.Data mode owing to finally storing is binary format, it is possible to utilize existing cheap
Physical storage device above-mentioned binary code sequence is stored, it is achieved thereby that to existing low side thing
The high multiplexing of reason storage device, and store without using expensive storage device, thus reduce big
Data carrying cost.Further, since the present invention is to be translated into by data message chain bigger for a data amount
The binary code sequence of at least two sections, and then carry out storing, that is to say and low-dimensional storage is transformed to
Higher-dimension stores, and so can reduce the data capacity of each section of sequence of final storage, such that it is able to utilize
Corresponding binary code sequence is stored by the scrappy memory area on cheap physical storage device, by
This is greatly improved the storage efficiency of unit area.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to reality
Execute the required accompanying drawing used in example or description of the prior art to be briefly described, it should be apparent that below,
Accompanying drawing in description is only embodiments of the invention, for those of ordinary skill in the art, not
On the premise of paying creative work, it is also possible to obtain other accompanying drawing according to the accompanying drawing provided.
Fig. 1 is a kind of high multiplexing distributed storage method flow chart disclosed in the embodiment of the present invention；
Fig. 2 is a kind of concrete high multiplexing distributed storage method flow chart disclosed in the embodiment of the present invention；
Fig. 3 is a kind of high multiplexing distributed memory system structural representation disclosed in the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out
Clearly and completely describe, it is clear that described embodiment is only a part of embodiment of the present invention, and
It is not all, of embodiment.Based on the embodiment in the present invention, those of ordinary skill in the art are not doing
Go out the every other embodiment obtained under creative work premise, broadly fall into the scope of protection of the invention.
The embodiment of the invention discloses a kind of high multiplexing distributed storage method, shown in Figure 1, the method
Including:
Step S11: utilize original file data to be stored, correspondingly generates at least one data message chain.
When generating data message chain, can correspondingly record between original file data and data message chain
Corresponding relation.
Step S12: according to presupposed information translation rule, every data message sense is translated to two sections or two sections
Above binary code sequence.
Step S13: all binary code sequences corresponding from every data message sense are distributed to different
Memory area stores；Wherein, memory area is the idle memory region on physical storage device.
It should be noted that in above-mentioned steps S13, different memory areas can be in different physics and deposit
Memory area on storage equipment, it is also possible to refer to the different storage zone being positioned in Same Physical storage device.
Physical storage device in the present embodiment can be can to enter binary data in currently available technology
The physical storage device miscellaneous of row storage.
It is understood that above-mentioned time binary code sequence is stored to corresponding memory area, need note
The initial address of storage in record respective memory regions.
In the embodiment of the present invention, high multiplexing distributed storage method includes: utilize original document to be stored
Data, correspondingly generate at least one data message chain；According to presupposed information translation rule, by every number
The binary code sequence of two or more is translated to according to message sense；Will be with every data message sense pair
The all binary code sequences answered are distributed to different memory areas and store；Wherein, memory area
For the idle memory region on physical storage device.Visible, in embodiments of the present invention, when needs are carried out
During data storage, generate corresponding data message chain first with original file data, then by every data
Message sense is translated into the binary code sequence of at least two sections, and is distributed to different by the sequence after translation
Memory area stores.Data mode owing to finally storing is binary format, it is possible to
Utilize existing cheap physical storage device that above-mentioned binary code sequence is stored, it is achieved thereby that
High multiplexing to existing low side physical storage device, and store without using expensive storage device,
Thus reduce big data carrying cost.Further, since the embodiment of the present invention is by bigger for a data amount
Data message chain be translated into the binary code sequence of at least two sections, and then carry out storing, that is to say
Low-dimensional storage is transformed to higher-dimension storage, so can reduce the data of each section of sequence of final storage
Capacity, such that it is able to utilize the scrappy memory area on cheap physical storage device to compile corresponding binary system
Code sequence stores, and the storage efficiency of unit area is thus greatly improved.
The embodiment of the invention discloses a kind of concrete high multiplexing distributed storage method, real relative to upper one
Executing example, technical scheme has been made further instruction and optimization by the present embodiment.Concrete:
In upper embodiment step S11, utilize original file data to be stored, correspondingly generate at least one
The process of data message sense, including below step S111 and S112；Wherein,
Step S111: obtain original file data to be stored；
Step S112: decompose file data to be stored, is correspondingly made available at least one data message
Chain.
Concrete, in above-mentioned steps S112, file data to be stored is decomposed, be correspondingly made available to
The process of a few data message sense, including below step S1121 and step S1122；Wherein,
Step S1121: original file data is carried out feature extraction, is correspondingly made available at least one data special
Reference ceases；
Step S1122: according to presupposed information mapping mechanism, each data characteristic information is mapped to accordingly
Data message chain.
Wherein, above-mentioned presupposed information translation rule is for being used for determining data message chain and binary code sequence
Between the rule of mapping relations；Wherein, any data message sense all binary coding sequences with at least two sections
Row correspondence.
It should be noted that the determination of mapping relations between above-mentioned data message chain and binary code sequence
Can be by realizing with reference to bio information coding and decoding mechanism.Such as, by expressing with reference to hereditary information
Protein carrier is become to realize with the mechanism carrying coding information.Wherein, a data message sense correspondence one
Bar aminoacid message sense, every section of two-stage system coded sequence then constitutes a codon, and multiple codons are then
Corresponding to an aminoacid message sense.
High multiplexing distributed storage method shown in Figure 2, in the embodiment of the present invention, may further comprise:
Step S21: obtain the data read request for file destination data that client sends；
Step S22: resolve file destination data, to determine the institute for synthesizing file destination data
There is data message chain；
Step S23: according to all data message chains of synthesis file destination data, from corresponding physical store
Equipment reads out corresponding binary code sequence；
Step S24: all binary code sequences reading gone out are translated into corresponding data message chain and go forward side by side
Row merging treatment, the file data obtained after then merging feeds back to client.
Accordingly, the embodiment of the invention discloses a kind of high multiplexing distributed memory system, shown in Figure 3,
This system includes:
Message sense generation module 31, for utilizing original file data to be stored, correspondingly generates at least
One data message sense；
Message sense translation module 32, for according to presupposed information translation rule, turning every data message sense
It is translated into the binary code sequence of two or more；
Sequence distribution memory module 33, for by all binary codings corresponding with every data message sense
Sequence is distributed to different memory areas and stores；Wherein, memory area is on physical storage device
Idle memory region.
Visible, in embodiments of the present invention, when needs carry out data storage, first with original document number
According to generating corresponding data message chain, then every data message sense is translated into the binary system of at least two sections
Coded sequence, and the sequence after translation is distributed to different memory areas stores.Owing to finally depositing
The data mode stored up is binary format, it is possible to utilize existing cheap physical storage device pair
Above-mentioned binary code sequence stores, it is achieved thereby that multiple to the height of existing low side physical storage device
With, and store without using expensive storage device, thus reduce big data carrying cost.Separately
Outward, it is that data message chain bigger for a data amount is translated at least two sections due to the embodiment of the present invention
Binary code sequence, and then carry out storing, that is to say and low-dimensional storage is transformed to higher-dimension storage,
So can reduce the data capacity of each section of sequence of final storage, such that it is able to utilize cheap physics to deposit
Corresponding binary code sequence is stored by the scrappy memory area on storage equipment, is thus greatly improved
The storage efficiency of unit area.
The embodiment of the invention discloses a kind of concrete high multiplexing distributed memory system, real relative to upper one
Executing example, technical scheme has been made further instruction and optimization by the present embodiment.Concrete:
Message sense generation module in a upper embodiment, specifically can include data acquisition submodule and data
Decompose submodule；Wherein,
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for decomposing file data to be stored, are correspondingly made available at least one
Data message sense.
Wherein, above-mentioned data decomposition submodule specifically includes feature information extraction unit and information MAP unit；
Wherein,
Feature information extraction unit, for original file data is carried out feature extraction, be correspondingly made available to
Few a kind of data characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, reflects each data characteristic information
Penetrate into corresponding data message chain.
Concrete, above-mentioned presupposed information translation rule is for being used for determining data message chain and binary coding sequence
The rule of mapping relations between row；Wherein, any data message sense all binary codings with at least two sections
Sequence pair should.
High multiplexing distributed memory system in the present embodiment, may further comprise:
Read requests acquisition module, the data for file destination data sent for obtaining client are read
Take request；
Data resolution module, for resolving file destination data, to determine for synthesizing target literary composition
All data message chains of number of packages evidence；
Sequence read module, for all data message chains according to synthesis file destination data, from accordingly
Physical storage device in read out corresponding binary code sequence；
Message sense merges module, turns for all binary code sequences read out by sequence read module
It is translated into corresponding data message chain and carries out merging treatment, the file data feedback obtained after then merging
To client.
Finally, in addition it is also necessary to explanation, in this article, term " include ", " comprising " or its
What his variant is intended to comprising of nonexcludability, so that include the process of a series of key element, side
Method, article or equipment not only include those key elements, but also include other key elements being not expressly set out,
Or also include the key element intrinsic for this process, method, article or equipment.The most more
In the case of restriction, statement " including ... " key element limited, it is not excluded that described in including
The process of key element, method, article or equipment there is also other identical element.
Multiplexing distributed storage method high to one provided by the present invention and system have carried out detailed Jie above
Continuing, principle and the embodiment of the present invention are set forth by specific case used herein, above reality
The explanation executing example is only intended to help to understand method and the core concept thereof of the present invention；Simultaneously for ability
The those skilled in the art in territory, according to the thought of the present invention, the most all can
Change part, and in sum, this specification content should not be construed as limitation of the present invention.
Claims (10)
1. one kind high multiplexing distributed storage method, it is characterised in that including:
Utilize original file data to be stored, correspondingly generate at least one data message chain；
According to presupposed information translation rule, every data message sense is translated to two or more two
Scale coding sequence；
The all binary code sequences corresponding from every data message sense are distributed to different memory areas
Store；Wherein, described memory area is the idle memory region on physical storage device.
High multiplexing distributed storage method the most according to claim 1, it is characterised in that described profit
By original file data to be stored, correspondingly generate the process of at least one data message chain, including:
Obtain original file data to be stored；
Described file to be stored data are decomposed, is correspondingly made available at least one data message chain.
High multiplexing distributed storage method the most according to claim 2, it is characterised in that described right
Described file to be stored data are decomposed, and are correspondingly made available the process of at least one data message chain, bag
Include:
Described original file data is carried out feature extraction, is correspondingly made available at least one data characteristic information；
According to presupposed information mapping mechanism, each data characteristic information is mapped to corresponding data message
Chain.
4., according to the high multiplexing distributed storage method described in any one of claims 1 to 3, its feature exists
In, described presupposed information translation rule is reflected between data message chain and binary code sequence for being used for determining
Penetrate the rule of relation；Wherein, any data message sense is all corresponding with the binary code sequence of at least two sections.
5., according to the high multiplexing distributed storage method described in any one of claims 1 to 3, its feature exists
In, also include:
Obtain the data read request for file destination data that client sends；
Described file destination data are resolved, to determine the institute for synthesizing described file destination data
There is data message chain；
According to all data message chains of the described file destination data of synthesis, from corresponding physical storage device
In read out corresponding binary code sequence；
All binary code sequences reading gone out are translated into corresponding data message chain and merge place
Reason, the file data obtained after then merging feeds back to described client.
6. one kind high multiplexing distributed memory system, it is characterised in that including:
Message sense generation module, for utilizing original file data to be stored, correspondingly generates at least one
Data message sense；
Message sense translation module, for according to presupposed information translation rule, translating every data message sense
Binary code sequence for two or more；
Sequence distribution memory module, for by all binary coding sequences corresponding with every data message sense
Row are distributed to different memory areas and store；Wherein, described memory area is on physical storage device
Idle memory region.
High multiplexing distributed memory system the most according to claim 6, it is characterised in that described letter
Breath chain generation module includes:
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for described file to be stored data are decomposed, be correspondingly made available to
A few data message sense.
High multiplexing distributed memory system the most according to claim 7, it is characterised in that described number
Include according to decomposing submodule:
Feature information extraction unit, for described original file data being carried out feature extraction, correspondingly
To at least one data characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, reflects each data characteristic information
Penetrate into corresponding data message chain.
9., according to the high multiplexing distributed memory system described in any one of claim 6 to 8, its feature exists
In, described presupposed information translation rule is reflected between data message chain and binary code sequence for being used for determining
Penetrate the rule of relation；Wherein, any data message sense is all corresponding with the binary code sequence of at least two sections.
10. according to the high multiplexing distributed memory system described in any one of claim 6 to 8, its feature
It is, also includes:
Read requests acquisition module, the data for file destination data sent for obtaining client are read
Take request；
Data resolution module, for resolving described file destination data, to determine for synthesizing
State all data message chains of file destination data；
Sequence read module, is used for all data message chains according to the described file destination data of synthesis, from
Corresponding physical storage device reads out corresponding binary code sequence；
Message sense merges module, for all binary coding sequences read out by described sequence read module
Row are translated into corresponding data message chain and carry out merging treatment, the file data obtained after then merging
Feed back to described client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610410851.2A CN105892956B (en) | 2016-06-13 | 2016-06-13 | A kind of high multiplexing distributed storage method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610410851.2A CN105892956B (en) | 2016-06-13 | 2016-06-13 | A kind of high multiplexing distributed storage method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105892956A true CN105892956A (en) | 2016-08-24 |
| CN105892956B CN105892956B (en) | 2018-11-20 |
Family
ID=56730353
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610410851.2A Active CN105892956B (en) | 2016-06-13 | 2016-06-13 | A kind of high multiplexing distributed storage method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105892956B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101583039A (en) * | 2008-04-22 | 2009-11-18 | 索尼株式会社 | Information processing apparatus and information processing method |
| CN101777056A (en) * | 2009-12-31 | 2010-07-14 | 成都市华为赛门铁克科技有限公司 | Data storage method and device |
| CN103295002A (en) * | 2013-06-03 | 2013-09-11 | 北京工业大学 | Total posture face identification method based on complete binary posture affinity scale invariant features |
| CN105574212A (en) * | 2016-02-24 | 2016-05-11 | 北京大学 | Image retrieval method for multi-index disk Hash structure |
-
2016
- 2016-06-13 CN CN201610410851.2A patent/CN105892956B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101583039A (en) * | 2008-04-22 | 2009-11-18 | 索尼株式会社 | Information processing apparatus and information processing method |
| CN101777056A (en) * | 2009-12-31 | 2010-07-14 | 成都市华为赛门铁克科技有限公司 | Data storage method and device |
| CN103295002A (en) * | 2013-06-03 | 2013-09-11 | 北京工业大学 | Total posture face identification method based on complete binary posture affinity scale invariant features |
| CN105574212A (en) * | 2016-02-24 | 2016-05-11 | 北京大学 | Image retrieval method for multi-index disk Hash structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105892956B (en) | 2018-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8856619B1 (en) | Storing data across groups of storage nodes | |
| Silberstein et al. | Optimal binary locally repairable codes via anticodes | |
| MY148034A (en) | Common charting using shapes | |
| King et al. | Sparse modulation coding for increased capacity in volume holographic storage | |
| US20120023362A1 (en) | System and method for exact regeneration of a failed node in a distributed storage system | |
| CN101799800B (en) | Method for coding electronic book, electronic newspaper and electronic magazine with hyperlink | |
| EP2365639A3 (en) | Method and system for providing low density parity check (LDPC) encoding and decoding | |
| MX2020013424A (en) | Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device. | |
| US20180024746A1 (en) | Methods of encoding and storing multiple versions of data, method of decoding encoded multiple versions of data and distributed storage system | |
| Hanusa | The lightest metals: Science and technology from Lithium to Calcium | |
| CN103559171A (en) | Data format conversion method and device for use in network application | |
| CN104636717A (en) | Method and device for identifying diagram | |
| CN103544516A (en) | Two-dimensional code encoding and decoding method, two-dimensional code encoder and two-dimensional code decoder | |
| CN105892956A (en) | High-complexity distributed type storage method and system | |
| CN112729166B (en) | Structured light encoding method, encoding and decoding method, device, computer device and medium | |
| CN105745597A (en) | Data-bearing medium | |
| CN103745252B (en) | Coding row, two-dimentional code encoding method and Quick Response Code coding/decoding method | |
| Lee et al. | An efficient method of Huffman decoding for MPEG-2 AAC and its performance analysis | |
| CN106254313B (en) | A kind of general big data acquisition byte stream resolution system and its implementation | |
| ATE423350T1 (en) | DATA STORAGE ARRAY | |
| CN113902456A (en) | Product anti-counterfeiting method and device | |
| US7240849B2 (en) | Glyph pattern generation and glyph pattern decoding | |
| CN104969174A (en) | Data-bearing media | |
| Pai et al. | High efficient distributed video coding with parallelized design for LDPCA decoding on CUDA based GPGPU | |
| KR101211436B1 (en) | Method and apparatus for encoding/decoding 3d contents data |
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 |