CN105892956B - A kind of high multiplexing distributed storage method and system - Google Patents
A kind of high multiplexing distributed storage method and system Download PDFInfo
- Publication number
- CN105892956B CN105892956B CN201610410851.2A CN201610410851A CN105892956B CN 105892956 B CN105892956 B CN 105892956B CN 201610410851 A CN201610410851 A CN 201610410851A CN 105892956 B CN105892956 B CN 105892956B
- Authority
- CN
- China
- Prior art keywords
- data
- information
- binary code
- chain
- information 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000000605 extraction Methods 0.000 claims description 10
- 238000013507 mapping Methods 0.000 claims description 9
- 230000002194 synthesizing effect Effects 0.000 claims description 8
- 230000015572 biosynthetic process Effects 0.000 claims description 4
- 238000003786 synthesis reaction Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000013500 data storage Methods 0.000 description 4
- 108020004705 Codon Proteins 0.000 description 2
- 150000001413 amino acids Chemical class 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 108091026890 Coding region Proteins 0.000 description 1
- 241001269238 Data Species 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
- 102000004169 proteins and genes Human genes 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application discloses a kind of high multiplexing distributed storage methods and system, this method to include：Using original file data to be stored, at least one data information chain is correspondingly generated；Rule is translated according to presupposed information, every data information chain is translated to the binary code sequence of two or more；All binary code sequences corresponding from every data information chain are distributed to different storage regions to store；Wherein, storage region is the idle memory region on physical storage device.It can be seen that, in this application, since the data mode finally stored is binary format, so can be stored using existing cheap physical storage device to above-mentioned binary code sequence, to realize the height multiplexing to existing low side physical storage device, without being stored using expensive storage equipment, big data carrying cost is thus reduced.
Description
Technical field
The present invention relates to reading and writing data technical field, in particular to a kind of high multiplexing distributed storage method and system.
Background technique
Currently, with the arrival of big data era, people can generate mass data in work and life daily.In order to deposit
These big datas are stored up, it, can be with using these physical storage devices it has been developed that the physical storage device of high-performance high capacity
Effectively mass data is stored.
However, the purchase cost of above-mentioned physical storage device is very high, general client is enabled to be difficult to bear.As it can be seen that how
Reducing big data carrying cost is current problem to be solved.
Summary of the invention
In view of this, being greatly reduced the purpose of the present invention is to provide a kind of high multiplexing distributed storage method and system
Big data carrying cost.Its concrete scheme is as follows：
A kind of high multiplexing distributed storage method, including：
Using original file data to be stored, at least one data information chain is correspondingly generated；
Rule is translated according to presupposed information, every data information chain is translated to the binary coding of two or more
Sequence；
All binary code sequences corresponding from every data information chain are distributed to different storage regions to deposit
Storage；Wherein, the storage region is the idle memory region on physical storage device.
Preferably, described to utilize original file data to be stored, correspondingly generate the mistake of at least one data information chain
Journey, including：
Obtain original file data to be stored；
The file to be stored data are decomposed, at least one data information chain is correspondingly made available.
Preferably, described that the file to be stored data are decomposed, it is correspondingly made available at least one data information chain
Process, including：
Feature extraction is carried out to the original file data, 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 information chain.
Preferably, the presupposed information translation rule is to reflect between data information chain and binary code sequence for determining
Penetrate the rule of relationship；Wherein, any data information chain is corresponding at least two sections of binary code sequence.
Preferably, the method further includes：
Obtain the data read request for file destination data that client is sent；
The file destination data are parsed, to determine that all data for synthesizing the file destination data are believed
Cease chain；
According to all data information chains for synthesizing the file destination data, read out from corresponding physical storage device
Corresponding binary code sequence；
All binary code sequences read out are translated into corresponding data information chain and carry out merging treatment, then
The file data obtained after merging is fed back into the client.
The invention also discloses a kind of high multiplexing distributed memory systems, including：
Information chain generation module correspondingly generates at least one data letter for utilizing original file data to be stored
Cease chain；
Information chain translation module, for according to presupposed information translate rule, by every data information chain translate to two sections or
Two sections or more of binary code sequence；
Sequence is distributed memory module, for being distributed to all binary code sequences corresponding with every data information chain
Different storage regions are stored；Wherein, the storage region is the idle memory region on physical storage device.
Preferably, the information chain generation module includes：
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for decomposing to the file to be stored data, are correspondingly made available at least one number
According to information chain.
Preferably, the data decomposition submodule includes：
Feature information extraction unit is correspondingly made available at least one for carrying out feature extraction to the original file data
Kind data characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, each data characteristic information to be mapped to accordingly
Data information chain.
Preferably, the presupposed information translation rule is to reflect between data information chain and binary code sequence for determining
Penetrate the rule of relationship；Wherein, any data information chain is corresponding at least two sections of binary code sequence.
Preferably, the system further includes：
Read requests obtain module, for obtaining the data read request for file destination data of client transmission；
Data resolution module, for being parsed to the file destination data, to determine for synthesizing the target text
All data information chains of number of packages evidence；
Sequence read module, for all data information chains according to the synthesis file destination data, from corresponding object
Corresponding binary code sequence is read out in reason storage equipment；
Information chain merging module, all binary code sequences for reading out the sequence read module are translated into
Corresponding data information chain simultaneously carries out merging treatment, and the file data obtained after merging is then fed back to the client.
In the present invention, height multiplexing distributed storage method includes：Using original file data to be stored, correspondingly generate
At least one data information chain；Rule is translated according to presupposed information, every data information chain is translated to two or more
Binary code sequence；All binary code sequences corresponding from every data information chain are distributed to different memory blocks
Domain is stored；Wherein, storage region is the idle memory region on physical storage device.As it can be seen that in the present invention, working as needs
When carrying out data storage, corresponding data information chain is generated first with original file data, then turns every data information chain
It is translated at least two sections of binary code sequence, and the sequence after translation is distributed to different storage regions and is stored.By
In the data mode finally stored be binary format, so can using existing cheap physical storage device to above-mentioned
Binary code sequence is stored, so that the height multiplexing to existing low side physical storage device is realized, it is high without utilizing
Expensive storage equipment is stored, and big data carrying cost is thus reduced.In addition, due to the present invention be by a data amount compared with
Big data information chain is translated at least two sections of binary code sequence, and then stored, it that is to say and store low-dimensional
It is transformed to higher-dimension storage, can reduce the data capacity of each section of sequence finally stored in this way, it is cheap so as to utilize
Scrappy storage region on physical storage device stores corresponding binary code sequence, and unit thus greatly improved
The storage efficiency in region.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of invention for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is a kind of high multiplexing distributed storage method flow chart disclosed by the embodiments of the present invention；
Fig. 2 is a kind of specific high multiplexing distributed storage method flow chart disclosed by the embodiments of the present invention；
Fig. 3 is a kind of high multiplexing distributed memory system structural schematic diagram disclosed by the embodiments of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a kind of high multiplexing distributed storage methods, and shown in Figure 1, this method includes：
Step S11：Using original file data to be stored, at least one data information chain is correspondingly generated.
When generating data information chain, the corresponding pass between original file data and data information chain can be correspondingly recorded
System.
Step S12：Rule is translated according to presupposed information, every data information chain is translated to two or more two
Scale coding sequence.
Step S13：All binary code sequences corresponding from every data information chain are distributed to different memory blocks
Domain is stored；Wherein, storage region is the idle memory region on physical storage device.
It should be noted that different storage regions can be on different physical storage devices in above-mentioned steps S13
Storage region, may also mean that the different storage zone on same physical storage device.
Physical storage device in the present embodiment can be in currently available technology and can store to binary data
Miscellaneous physical storage device.
It is understood that it is above-mentioned when storing binary code sequence to corresponding storage region, it need to record and accordingly deposit
The initial address stored in storage area domain.
In the embodiment of the present invention, height multiplexing distributed storage method includes：Using original file data to be stored, accordingly
Ground generates at least one data information chain；Rule is translated according to presupposed information, every data information chain is translated into two sections or two
Section or more binary code sequence；All binary code sequences corresponding from every data information chain are distributed to different
Storage region is stored；Wherein, storage region is the idle memory region on physical storage device.As it can be seen that of the invention real
It applies in example, when needing to carry out data storage, corresponding data information chain is generated first with original file data, then by every
Data information chain is translated at least two sections of binary code sequence, and the sequence after translation is distributed to different storage regions
It is stored.Since the data mode finally stored is binary format, so can be deposited using existing cheap physics
Storage equipment stores above-mentioned binary code sequence, so that the height multiplexing to existing low side physical storage device is realized,
Without being stored using expensive storage equipment, big data carrying cost is thus reduced.In addition, since the present invention is implemented
Example is the biggish data information chain of a data amount to be translated at least two sections of binary code sequence, and then stored
, it that is to say and low-dimensional storage is transformed to higher-dimension storage, the data that can reduce each section of sequence finally stored in this way are held
Amount, so as to be deposited using the scrappy storage region on cheap physical storage device to corresponding binary code sequence
Storage, thus greatly improved the storage efficiency of unit area.
The embodiment of the invention discloses a kind of specific high multiplexing distributed storage methods, relative to a upper embodiment, originally
Embodiment has made further instruction and optimization to technical solution.Specifically：
In upper embodiment step S11, using original file data to be stored, at least one data letter is correspondingly generated
Cease the process of chain, including below step S111 and S112；Wherein,
Step S111：Obtain original file data to be stored；
Step S112：File to be stored data are decomposed, at least one data information chain is correspondingly made available.
Specifically, decomposing in above-mentioned steps S112 to file to be stored data, it is correspondingly made available at least one data
The process of information chain, including below step S1121 and step S1122；Wherein,
Step S1121：Feature extraction is carried out to original file data, is correspondingly made available at least one data characteristic information；
Step S1122：According to presupposed information mapping mechanism, each data characteristic information is mapped to corresponding data and is believed
Cease chain.
Wherein, above-mentioned presupposed information translation rule is to map between data information chain and binary code sequence for determining
The rule of relationship；Wherein, any data information chain is corresponding at least two sections of binary code sequence.
It should be noted that the determination of mapping relations can pass through between above-mentioned data information chain and binary code sequence
It is realized with reference to biological information coding and decoding mechanism.For example, being expressed as protein carrier by reference to hereditary information to carry and compile
The mechanism of code information is realized.Wherein, the corresponding amino acid information chain of a data information chain, and every section of two-stage system code sequence
Column then constitute a codon, and multiple codons then correspond to an amino acid information chain.
Shown in Figure 2, the high multiplexing distributed storage method in the embodiment of the present invention still further comprises：
Step S21：Obtain the data read request for file destination data that client is sent；
Step S22：File destination data are parsed, to determine that all data for synthesizing file destination data are believed
Cease chain；
Step S23：According to all data information chains of synthesis file destination data, read from corresponding physical storage device
Take out corresponding binary code sequence；
Step S24：All binary code sequences read out are translated into corresponding data information chain and are merged
Processing, then feeds back to client for the file data obtained after merging.
Correspondingly, the embodiment of the invention discloses a kind of high multiplexing distributed memory system, shown in Figure 3, the system
Including：
Information chain generation module 31 correspondingly generates at least one data for utilizing original file data to be stored
Information chain；
Every data information chain is translated to two sections for translating rule according to presupposed information by information chain translation module 32
Or two sections or more of binary code sequence；
Sequence is distributed memory module 33, for distributing all binary code sequences corresponding with every data information chain
It is stored to different storage regions；Wherein, storage region is the idle memory region on physical storage device.
As it can be seen that in embodiments of the present invention, when needing to carry out data storage, being generated first with original file data corresponding
Data information chain, then every data information chain is translated at least two sections of binary code sequence, and will be after translation
Sequence is distributed to different storage regions and is stored.Since the data mode finally stored is binary format, so
Above-mentioned binary code sequence can be stored using existing cheap physical storage device, to realize to existing low
The high multiplexing for holding physical storage device thus reduces big data storage without being stored using expensive storage equipment
Cost.In addition, due to the embodiment of the present invention be the biggish data information chain of a data amount is translated into the two of at least two sections into
Coded sequence processed, and then stored, it that is to say and low-dimensional storage is transformed to higher-dimension storage, can reduce finally deposit in this way
The data capacity of each section of sequence of storage, so as to utilize the scrappy storage region on cheap physical storage device to corresponding
Binary code sequence is stored, and the storage efficiency of unit area thus greatly improved.
The embodiment of the invention discloses a kind of specific high multiplexing distributed memory systems, relative to a upper embodiment, originally
Embodiment has made further instruction and optimization to technical solution.Specifically：
Information chain generation module in a upper embodiment, can specifically include data acquisition submodule and data decompose submodule
Block；Wherein,
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for decomposing to file to be stored data, are correspondingly made available at least one data letter
Cease chain.
Wherein, above-mentioned data decompose submodule and specifically include feature information extraction unit and information MAP unit；Wherein,
Feature information extraction unit is correspondingly made available at least one number for carrying out feature extraction to original file data
According to characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, each data characteristic information to be mapped to accordingly
Data information chain.
Specifically, above-mentioned presupposed information translation rule is to reflect between data information chain and binary code sequence for determining
Penetrate the rule of relationship；Wherein, any data information chain is corresponding at least two sections of binary code sequence.
High multiplexing distributed memory system in the present embodiment, still further comprises：
Read requests obtain module, for obtaining the data read request for file destination data of client transmission；
Data resolution module, for being parsed to file destination data, to determine for synthesizing file destination data
All data information chains；
Sequence read module is deposited for all data information chains according to synthesis file destination data from corresponding physics
Corresponding binary code sequence is read out in storage equipment；
Information chain merging module, all binary code sequences for reading out sequence read module are translated into accordingly
Data information chain and carry out merging treatment, the file data obtained after merging is then fed back into client.
Finally, it is to be noted that, herein, the terms "include", "comprise" or its any other variant are intended to
Cover non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or setting
Standby intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in the process, method, article or apparatus that includes the element.
A kind of high multiplexing distributed storage method provided by the present invention and system are described in detail above, herein
In apply that a specific example illustrates the principle and implementation of the invention, the explanation of above example is only intended to sides
Assistant solves method and its core concept of the invention；At the same time, for those skilled in the art, think of according to the present invention
Think, there will be changes in the specific implementation manner and application range, in conclusion the content of the present specification should not be construed as pair
Limitation of the invention.
Claims (8)
1. a kind of high multiplexing distributed storage method, which is characterized in that including：
Using original file data to be stored, at least one data information chain is correspondingly generated；
Rule is translated according to presupposed information, every data information chain is translated to two sections or more of binary code sequence；
All binary code sequences corresponding from every data information chain are distributed to different storage regions to store；Its
In, the storage region is the idle memory region on physical storage device；
Wherein, the method also includes：
Obtain the data read request for file destination data that client is sent；The file destination data are solved
Analysis, to determine all data information chains for synthesizing the file destination data；According to the synthesis file destination data
All data information chains, read out corresponding binary code sequence from corresponding physical storage device；The institute that will be read out
There is binary code sequence to be translated into corresponding data information chain and carries out merging treatment, the number of files that then will be obtained after merging
According to feeding back to the client.
2. high multiplexing distributed storage method according to claim 1, which is characterized in that described using to be stored original
File data correspondingly generates the process of at least one data information chain, including：
Obtain original file data to be stored；
The file to be stored data are decomposed, at least one data information chain is correspondingly made available.
3. high multiplexing distributed storage method according to claim 2, which is characterized in that described to the file to be stored
Data are decomposed, and the process of at least one data information chain is correspondingly made available, including：
Feature extraction is carried out to the original file data, 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 information chain.
4. high multiplexing distributed storage method according to any one of claims 1 to 3, which is characterized in that the default letter
Breath translation rule is the rule for determining mapping relations between data information chain and binary code sequence；Wherein, any number
It is corresponding at least two sections of binary code sequence according to information chain.
5. a kind of high multiplexing distributed memory system, which is characterized in that including：
Information chain generation module correspondingly generates at least one data information chain for utilizing original file data to be stored；
Every data information chain is translated to two sections or more for translating rule according to presupposed information by information chain translation module
Binary code sequence；
Sequence is distributed memory module, for all binary code sequences corresponding with every data information chain to be distributed to difference
Storage region stored；Wherein, the storage region is the idle memory region on physical storage device；
Wherein, the system also includes：
Read requests obtain module, for obtaining the data read request for file destination data of client transmission；
Data resolution module, for being parsed to the file destination data, to determine for synthesizing the file destination number
According to all data information chains；
Sequence read module, for being deposited from corresponding physics according to all data information chains for synthesizing the file destination data
Corresponding binary code sequence is read out in storage equipment；
Information chain merging module, all binary code sequences for reading out the sequence read module are translated into accordingly
Data information chain and carry out merging treatment, the file data obtained after merging is then fed back into the client.
6. high multiplexing distributed memory system according to claim 5, which is characterized in that the information chain generation module packet
It includes：
Data acquisition submodule, for obtaining original file data to be stored；
Data decompose submodule, for decomposing to the file to be stored data, are correspondingly made available at least one data letter
Cease chain.
7. high multiplexing distributed memory system according to claim 6, which is characterized in that the data decompose submodule packet
It includes：
Feature information extraction unit is correspondingly made available at least one number for carrying out feature extraction to the original file data
According to characteristic information；
Information MAP unit, for according to presupposed information mapping mechanism, each data characteristic information to be mapped to corresponding number
According to information chain.
8. according to the described in any item high multiplexing distributed memory systems of claim 5 to 7, which is characterized in that the default letter
Breath translation rule is the rule for determining mapping relations between data information chain and binary code sequence；Wherein, any number
It is corresponding at least two sections of binary code sequence according to information chain.
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 CN105892956A (en) | 2016-08-24 |
| CN105892956B true 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 |
|---|---|
| CN105892956A (en) | 2016-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Somarakis et al. | ThinkNature nature-based solutions handbook | |
| ATE325389T1 (en) | SYSTEM AND METHOD FOR CONVERTING A RELATIONAL DATABASE INTO A HIERARCHICAL DATABASE | |
| CN101661391B (en) | Object serializing method, object deserializing method, device and system | |
| CN103077183B (en) | A kind of data lead-in method and its system of distributed sequence list | |
| EP1176755A3 (en) | Key distribution system, method and program providing medium | |
| CN105528347B (en) | Data block storage method, data query method and data modification method | |
| AU2003268530A1 (en) | Method and apparatus for grouping pages within a block | |
| RU2004125846A (en) | METHOD AND SYSTEM FOR STORAGE AND QUICK REMOVAL OF ALTITUDE TAGS OF DIGITAL LOCAL MODELS FOR USE IN LOCATION DETERMINATION SYSTEMS | |
| DE69331061T2 (en) | Fault-tolerant hierarchical bus system | |
| FR2932637B1 (en) | METHOD AND DEVICE FOR ENCODING AN IMAGE SEQUENCE | |
| CN102930192A (en) | Method for generating and acquiring safety information and relevant devices | |
| WO2004090674A3 (en) | Content bridge for associating host content and guest content wherein guest content is determined by search | |
| DK1188151T3 (en) | Devices and methods for biometric authentication | |
| CN102024057B (en) | Method and device for building index of mass data record | |
| CN108874905A (en) | A kind of high-efficiency storage method of magnanimity geographic information tile data | |
| CN105892956B (en) | A kind of high multiplexing distributed storage method and system | |
| CN111506603A (en) | Data processing method, device, equipment and storage medium | |
| DE60322081D1 (en) | ||
| CN109213940B (en) | Method, storage medium, equipment and system for realizing user position calculation under big data | |
| ATE376741T1 (en) | METHOD AND DEVICE FOR RETRIEVING DATA STORAGE ACCESS INFORMATION | |
| CA2350488A1 (en) | Methods and systems for generating interactive information formatted for a device | |
| CN102063415A (en) | Method and system for embedding single-byte fonts in PDF (Portable Document Format) file | |
| KR101418233B1 (en) | SENC data providing system for ENC data application system | |
| EA200200012A1 (en) | METHOD AND DEVICE FOR SYNCHRONIZATION DURING CODING AND DECODING OF DATA PRINTED ON THE DATA TAPE | |
| CN101894098A (en) | Embedded font 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 |