CN106101270A - Data distributed memory system - Google Patents
Data distributed memory system Download PDFInfo
- Publication number
- CN106101270A CN106101270A CN201610637763.6A CN201610637763A CN106101270A CN 106101270 A CN106101270 A CN 106101270A CN 201610637763 A CN201610637763 A CN 201610637763A CN 106101270 A CN106101270 A CN 106101270A
- Authority
- CN
- China
- Prior art keywords
- storage
- data
- server
- main control
- control server
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or 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
- G06F3/0608—Saving storage space on storage systems
-
- 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/0629—Configuration or reconfiguration of storage systems
-
- 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]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
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)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a kind of data distributed memory system, it includes main control server and at least one storage server；Main control server receives the data storage request that client sends, and data storage request comprises memory data output；Main control server searches the residual memory space storage server more than memory data output from least one storage server, without finding, then distributing any number of storage servers for client, the residual memory space sum of any number of storage servers is more than memory data output；After any number of storage servers receive and store the data of client upload successively, and each storage server storage completes, data storage path being back to described main control server, data storage path is for identifying the storage position of data；Unique identifier and the corresponding data storage path thereof of each storage server are back to client by main control server.The present invention can save memory space.
Description
Technical field
The present invention relates to technical field of data processing, particularly relate to a kind of data distributed memory system.
Background technology
Along with the growth of internet information, substantial amounts of data, as picture, document etc. need to be stored.At present, distributed number
According to storage system, data are carried out piecemeal storage, meanwhile, need in Installed System Memory, store substantial amounts of index information, in order to use
Family can navigate to the storage position of file when downloading data.
But, owing to the storage of a large amount of index informations takies the substantial amounts of memory headroom of system, and for the computer of storage
Quantity and memory headroom are all limited, so, from the point of view of carrying cost, current data-storage system can not be expired
Foot demand.
Summary of the invention
The technical problem that present invention mainly solves is to provide one, it is possible to.
For solving above-mentioned technical problem, the technical scheme that the present invention uses is: provide a kind of data distributed storage
System, including main control server and at least one storage server；Described main control server receives the data of client transmission and deposits
Storage request, described data storage request comprises memory data output；Described main control server is looked into from least one storage server
Residual memory space is looked for be more than the storage server of described memory data output, without finding residual memory space more than institute
State the storage server of memory data output, be then that described client distributes any number of storage servers, described any number of deposit
The residual memory space sum of storage server is more than described memory data output；Described any number of storage server receives also successively
Store the data of described client upload, and after each storage server storage completes, described data storage path is back to
Described main control server, wherein, described any number of storage servers are when storage, and the residue of a upper storage server stores
When space is finished, generating data storage path and data interruption labelling, next storage server is continuing the remaining number of storage
According to time, generate the data corresponding with described data interruption labelling and continue labelling, described data storage path is used for identifying data
Storage position, and carry described data interruption labelling and data continue labelling；Described main control server is by described each storage
Unique identifier and the corresponding data storage path thereof of server are back to described client.
Be different from the situation of prior art, the invention has the beneficial effects as follows: by main control server be client distribution deposit
Storage server, after storage server storage completes, data are stored road strength and return client by main control server again, due to native system
Do not use index information such that it is able to save memory space.
Accompanying drawing explanation
Fig. 1 is the block schematic illustration of embodiment of the present invention data distributed memory system.
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 clear, complete
Describe, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments wholely.Based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under not making creative work premise
Embodiment, broadly falls into the scope of protection of the invention.
See Fig. 1, be the block schematic illustration of embodiment of the present invention data distributed memory system.The number of the embodiment of the present invention
Main control server 1 and at least one storage server 2 is included according to distributed memory system.
Main control server 1 receives the data storage request that client 3 sends, and data storage request comprises memory data output；
Main control server 1 searches the residual memory space storage server more than memory data output from least one storage server 2
2, without finding the residual memory space storage server 2 more than memory data output, then distribute the most for client 3
Individual storage server 2, the residual memory space sum of any number of storage servers 2 is more than memory data output；Any number of deposit
After storage server 2 receives and store the data that client 3 is uploaded successively, and each storage server 2 has stored, data are deposited
Storage path is back to main control server 1, and wherein, any number of storage servers 2 are when storage, and upper one stores server 2
When residual memory space is finished, generating data storage path and data interruption labelling, next storage server 2 is continuing storage
During remaining data, generating the data corresponding with data interruption labelling and continue labelling, data storage path is used for identifying data
Storage position, and carry data interruption labelling and data continue labelling；Main control server 1 is by each storage server 2 only
One identification code and corresponding data storage path thereof are back to client 3.
Specifically, when client 3 needs to store data, the first main control server 1 in this system sends data
Storage request, asks whether to carry out data storage.Main control server 1 is after receiving data storage request, it is judged that current
Whether there is the residual memory space storage server 2 more than memory data output, if it does not, main control server 1 is client
The end 3 any number of storage servers 2 of distribution, the residual memory space of these any number of storage servers 2 is more than or equal to data
Amount of storage.Then according to the address of multiple storage servers 2 of distribution is sent to client 3 by preset order successively.
Client 3 is according to receiving the order of address of storage server 2, according to the address of each storage server 2, with
Each storage server 2 is set up and is connected, and data are uploaded to each storage server 2.The number that storage server 2 will receive
According to being stored in this locality.Wherein, first storage server 2, when residual memory space is used up, generates data storage path sum
According to interrupt flag, last storage server 2, when starting to store data, generates data and continues labelling, first storage clothes
Each storage server 2 between business device 2 and last storage server 2 is in addition to generating data storage path, also
Generate the corresponding data of data interruption labelling with a upper storage server 2 to continue labelling, and store with the next one
The data of server 2 continue the corresponding data interruption labelling of labelling.
After data are stored by these any number of storage servers 2, generate the data storing position for identifying data
Store path, and data storage path is back to main control server 1.Data of carrying this data storage path continue labelling sum
According to interrupt flag.Main control server 1 is again by unique identifier and the corresponding data storage path thereof of each storage server 2
It is back to client 3, in order to client 3 utilizes unique identifier to find storage server 2, and utilizes data storage path depositing
Storage server 2 is inquired about, downloads stored data.
By the way, the data distributed memory system of the embodiment of the present invention is that client is divided by main control server
Joining storage server, after storage server storage completes, data are stored road strength and return client by main control server again, due to this
System does not use index information such that it is able to save memory space.
The foregoing is only embodiments of the invention, not thereby limit the scope of the claims of the present invention, every utilize this
Equivalent structure or equivalence flow process that bright description and accompanying drawing content are made convert, or are directly or indirectly used in other relevant skills
Art field, is the most in like manner included in the scope of patent protection of the present invention.
Claims (1)
1. a data distributed memory system, it is characterised in that include main control server and at least one storage server；
Described main control server receives the data storage request that client sends, and described data storage request comprises data storage
Amount；
Described main control server searches residual memory space more than described memory data output from least one storage server
Storage server, without finding the residual memory space storage server more than described memory data output, is then described
Client distributes any number of storage servers, and the residual memory space sum of described any number of storage servers is more than described
Memory data output；
Described any number of storage server receives and stores the data of described client upload, and each storage server successively
After having stored, described data storage path is back to described main control server, wherein, described any number of storage servers
When storage, when the residual memory space of a upper storage server is finished, generate data storage path and data interruption labelling,
Next storage server, when continuing to store remaining data, generates the data corresponding with described data interruption labelling and continues
Labelling, described data storage path is for identifying the storage position of data, and carries described data interruption labelling and data continue
Labelling；
Unique identifier and the corresponding data storage path thereof of described each storage server are returned by described main control server
It is back to described client.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610637763.6A CN106101270A (en) | 2016-08-05 | 2016-08-05 | Data distributed memory system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610637763.6A CN106101270A (en) | 2016-08-05 | 2016-08-05 | Data distributed memory system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106101270A true CN106101270A (en) | 2016-11-09 |
Family
ID=57454509
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610637763.6A Withdrawn CN106101270A (en) | 2016-08-05 | 2016-08-05 | Data distributed memory system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106101270A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106648899A (en) * | 2016-12-28 | 2017-05-10 | 深圳Tcl数字技术有限公司 | Cloud computing storage method and device based on surplus storage space of terminal device |
| WO2018157331A1 (en) * | 2017-03-01 | 2018-09-07 | 深圳市博信诺达经贸咨询有限公司 | Storage method and system applied to big data |
| CN109871365A (en) * | 2019-01-15 | 2019-06-11 | 苏州链读文化传媒有限公司 | A kind of distributed file system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1955912A (en) * | 2006-10-13 | 2007-05-02 | 清华大学 | Method for distributing resource in large scale storage system |
| CN101710901A (en) * | 2009-10-22 | 2010-05-19 | 乐视网信息技术（北京）股份有限公司 | Distributed type storage system having p2p function and method thereof |
| CN101753936A (en) * | 2008-12-08 | 2010-06-23 | 北京中星微电子有限公司 | Configuration method of storage space and video server for video monitoring system |
| CN102694860A (en) * | 2012-05-25 | 2012-09-26 | 北京邦诺存储科技有限公司 | Method, equipment and system for data processing of cloud storage |
| CN102902602A (en) * | 2012-09-19 | 2013-01-30 | 华为技术有限公司 | Method and device for data hot backup as well as storage system |
| CN103250139A (en) * | 2012-11-07 | 2013-08-14 | 华为技术有限公司 | A method and an apparatus for migrating computing nodes ` |
| CN103617024A (en) * | 2013-11-07 | 2014-03-05 | 华为技术有限公司 | Concurrent-data processing method, concurrent-data processing device and concurrent-data system |
-
2016
- 2016-08-05 CN CN201610637763.6A patent/CN106101270A/en not_active Withdrawn
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1955912A (en) * | 2006-10-13 | 2007-05-02 | 清华大学 | Method for distributing resource in large scale storage system |
| CN101753936A (en) * | 2008-12-08 | 2010-06-23 | 北京中星微电子有限公司 | Configuration method of storage space and video server for video monitoring system |
| CN101710901A (en) * | 2009-10-22 | 2010-05-19 | 乐视网信息技术（北京）股份有限公司 | Distributed type storage system having p2p function and method thereof |
| CN102694860A (en) * | 2012-05-25 | 2012-09-26 | 北京邦诺存储科技有限公司 | Method, equipment and system for data processing of cloud storage |
| CN102902602A (en) * | 2012-09-19 | 2013-01-30 | 华为技术有限公司 | Method and device for data hot backup as well as storage system |
| CN103250139A (en) * | 2012-11-07 | 2013-08-14 | 华为技术有限公司 | A method and an apparatus for migrating computing nodes ` |
| CN103617024A (en) * | 2013-11-07 | 2014-03-05 | 华为技术有限公司 | Concurrent-data processing method, concurrent-data processing device and concurrent-data system |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106648899A (en) * | 2016-12-28 | 2017-05-10 | 深圳Tcl数字技术有限公司 | Cloud computing storage method and device based on surplus storage space of terminal device |
| WO2018157331A1 (en) * | 2017-03-01 | 2018-09-07 | 深圳市博信诺达经贸咨询有限公司 | Storage method and system applied to big data |
| CN109871365A (en) * | 2019-01-15 | 2019-06-11 | 苏州链读文化传媒有限公司 | A kind of distributed file system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106293527A (en) | Data-storage system | |
| CN103473365B (en) | A kind of file memory method based on HDFS, device and distributed file system | |
| CN102137145B (en) | Method, device and system for managing distributed contents | |
| CN101976534B (en) | Electronic map generation method and device | |
| CN102081536A (en) | Method for updating increment, and server | |
| CN103516774A (en) | Method and system for eliminating multiplicating storage based on cloud storage | |
| CN103902696A (en) | Method and device for loading resource files | |
| CN101551826B (en) | Data retrieval process, set and system | |
| CN106101270A (en) | Data distributed memory system | |
| CN101996248B (en) | Address lookup method and device | |
| CN103530168B (en) | Multi-satellite remote sensing data processing system and method based on virtualization technology | |
| CN105141672A (en) | Method, device and system for data storage | |
| CN109379448A (en) | A kind of file distribution dispositions method, device, electronic equipment and storage medium | |
| CN105808622A (en) | File storage method and device | |
| CN105208078A (en) | File storage system and method | |
| CN104919444A (en) | Topic collections | |
| CN102306165A (en) | Ship electronic chart data multi-platform shared service device and construction method thereof | |
| CN105338073A (en) | File directory processing method, server and system | |
| CN104461736B (en) | Resource allocation and searching method, resource allocation and search system and Cloud Server | |
| CN111985862A (en) | Method and apparatus for locating inventory items | |
| CN106296095A (en) | A kind of goods and materials concocting method based on wisdom storage and equipment | |
| CN108681866A (en) | Processing method, system, equipment and the storage medium of waybill | |
| CN108920105A (en) | Diagram data distributed storage method and device based on community structure | |
| CN103685278B (en) | Method and management terminal end for media release | |
| CN102298527B (en) | A kind of method of CPE parallel upgrades version and realize system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20161109 |