CN108111628A - A kind of dynamic capacity-expanding storage method and system - Google Patents
A kind of dynamic capacity-expanding storage method and system Download PDFInfo
- Publication number
- CN108111628A CN108111628A CN201810049360.9A CN201810049360A CN108111628A CN 108111628 A CN108111628 A CN 108111628A CN 201810049360 A CN201810049360 A CN 201810049360A CN 108111628 A CN108111628 A CN 108111628A
- Authority
- CN
- China
- Prior art keywords
- storage
- capacity
- registration
- uid
- 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.)
- Granted
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/50—Network services
- H04L67/56—Provisioning of proxy services
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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]
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (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
The invention belongs to technical field of data storage, and in particular to a kind of dynamic capacity-expanding storage method and system comprise the following steps：Registrar receives the registration request that user terminal is sent, and UID is registered for registration request distribution, and passes through load-balanced server and registration request and registration UID are sent to storage agent server；Registration request and registration UID are sent to database server and stored by storage agent server by storing routing, while registration UID is reported to storage management center；Storage management center receives the remaining memory capacity of calculating database after registration UID, when remaining memory capacity is less than threshold capacity, apply for memory node to O＆M end to expand the capacity of database server, and the memory node applied is increased into storage routing.Dynamic extended storage capacity of the present invention not only meets growing user data storage demand, but also saves cost of labor, avoids the error of artificial dilatation, makes storage more efficient.
Description
Technical field
The invention belongs to technical field of data storage, and in particular to a kind of dynamic capacity-expanding storage method and system.
Background technology
With the development of internet, internet enters the every aspect of people's life, applied to the various app in life
Occurring in succession, the user data of registration increasingly expands, and increases registration amount day newly and can reach several ten million, thus to the memory requirement of data
Also it is original higher.
In traditional storage scheme, storage service extends difficult, it is necessary to be provided with sufficient storage very early, disposable to carry out
Dilatation avoids subsequently changing as far as possible.Dilatation is generally carried out by artificial manual operations, excessive manual intervention not only increases
Cost of labor, and because artificial factor, may inevitably introduce some problems.For these problems, gently then
Take a long time to position investigation, it is heavy then may result in loss of data.
The content of the invention
For in the prior art the defects of, the present invention provides a kind of dynamic capacity-expanding storage method and system, compared to biography
The storage scheme of system, dynamic extended storage capacity not only meet growing user data storage demand, but also save
Cost of labor, avoids the error of artificial dilatation, makes storage more efficient.
In a first aspect, the present invention provides a kind of dynamic capacity-expanding storage methods, comprise the following steps：
Registrar receives the registration request that user terminal is sent, and registers UID for registration request distribution, and passes through negative
It carries equalization server and registration request and registration UID is sent to storage agent server；
Registration request and registration UID are sent to database server and deposited by storage agent server by storing routing
Storage, while registration UID is reported to storage management center；
Storage management center receives the remaining memory capacity of calculating database after registration UID, when remaining memory capacity is small
When threshold capacity, apply for memory node to O＆M end to expand the capacity of database server, and the storage section that will apply
Point increases to storage routing.
Preferably, the registrar receives the registration request that user terminal is sent, and will by load-balanced server
Registration request is sent to storage agent server, is specially：
Registrar receives the registration request that user terminal is sent, and the registration request is sent to cache server, and
New user's judging result of order caching server feedback；
After registrar is determined as new user according to new user's judging result, will be registered by load-balanced server please
It asks and is sent to storage agent server.
Preferably, the storage management center receives the remaining memory capacity and threshold value of calculating database after registration UID
Capacity when remaining memory capacity is less than threshold capacity, applies for memory node to expand the appearance of database server to O＆M end
Amount, and the memory node applied is increased into storage routing, it is specially：
After storage management center receives registration UID, the occupancy memory capacity that database server is used is calculated；
Storage management center subtracts occupancy memory capacity according to the total memory capacity of database server, obtains remaining storage
Capacity；
Storage management center judges whether remaining memory capacity is less than threshold capacity, if so, send memory node application to
O＆M end, and receive the memory node distribution information of O＆M end feedback；
Information is distributed in storage management center according to memory node, and newly assigned data equipment is carried out storehouse table initialization behaviour
Make, and increase to storage routing using the storehouse table information of initialization as memory node；
Storage management center distributes information according to memory node and obtains newly-increased memory capacity, is updated according to newly-increased memory capacity
Total memory capacity.
Second aspect, the present invention provides a kind of dynamic capacity-expanding storage systems, are deposited suitable for the dynamic described in first aspect
Method for storing including registrar, load-balanced server, storage agent server, storage routing, database server and is deposited
Store up administrative center；
For receiving the registration request of user terminal transmission, UID is registered for registration request distribution for registrar, and
Registration request and registration UID are sent to by storage agent server by load-balanced server；
Registration request and registration UID are sent to database server by storage agent server for passing through storage routing
It is stored, while registration UID is reported to storage management center；
Storage management center, for receive registration UID after calculate database remaining memory capacity, when residue storage hold
When amount is less than threshold capacity, applies for memory node to expand the capacity of database server to O＆M end, and deposited what is applied
Storage node increases to storage routing.
Preferably, the registrar is specifically used for：
The registration request that user terminal is sent is received, the registration request is sent to cache server, and order caching takes
The new user's judging result for device feedback of being engaged in；
After being determined as new user according to new user's judging result, for registration request distribution registration UID；
Registration request and registration UID are sent to by storage agent server by load-balanced server.
Preferably, the storage management center is specifically used for：
After receiving registration UID, the occupancy memory capacity that database server is used is calculated；
Occupancy memory capacity is subtracted according to the total memory capacity of database server, obtains remaining memory capacity；
Judge whether remaining memory capacity is less than threshold capacity, if so, sending memory node application gives O＆M end, and receive
The memory node distribution information of O＆M end feedback；
Information is distributed according to memory node, newly assigned data equipment is subjected to storehouse table initialization operation, and will initialization
Storehouse table information as memory node increase to storage routing；
Information is distributed according to memory node and obtains newly-increased memory capacity, and total memory capacity is updated according to newly-increased memory capacity.
Beneficial effects of the present invention are：Compared to traditional storage scheme, dynamic extended storage capacity is not only met
Growing user data storage demand, and cost of labor is saved, the error of artificial dilatation is avoided, makes storage higher
Effect.
Description of the drawings
It, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical solution of the prior art
Embodiment or attached drawing needed to be used in the description of the prior art are briefly described.In all of the figs, similar element
Or part is generally identified by similar reference numeral.In attached drawing, each element or part might not be drawn according to actual ratio.
Fig. 1 is the flow chart of dynamic capacity-expanding storage method in the present embodiment；
Fig. 2 is the structure diagram of dynamic capacity-expanding storage system in the present embodiment.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained without making creative work
Example, belongs to the scope of protection of the invention.
It should be appreciated that ought use in this specification and in the appended claims, term " comprising " and "comprising" instruction
Described spy, entirety, step, operation, the presence of element and/or component, but it is not precluded from one or more of the other feature, whole
Body, step, operation, element, component and/or its presence or addition gathered.
It is also understood that the term used in this description of the invention is merely for the sake of the mesh for describing specific embodiment
And be not intended to limit the present invention.As description of the invention and it is used in the attached claims, unless on
Other situations are hereafter clearly indicated, otherwise " one " of singulative, "one" and "the" are intended to include plural form.
It will be further appreciated that the term "and/or" used in description of the invention and the appended claims is
Refer to any combinations and all possible combinations of one or more of the associated item listed, and including these combinations.
Embodiment one：
A kind of dynamic capacity-expanding storage method is present embodiments provided, this method is run based on dynamic capacity-expanding storage system, institute
Stating dynamic capacity-expanding storage system includes registrar, load-balanced server, storage agent server, storage routing, data
Storehouse server, storage management center etc..As shown in Figure 1, this method comprises the following steps：
S1, registrar receive the registration request that user terminal is sent, and register UID for registration request distribution, and lead to
Registration request and registration UID are sent to storage agent server by overload equalization server.Load-balanced server be used for into
Row load balancing is distributed, entire so as to ensure by the registration request of user and registration UID equilibrium assignments to storage agent server
The response speed of system.
The step S1 is specially：
Registrar receives the registration request that user terminal is sent, and the registration request is sent to cache server, and
New user's judging result of order caching server feedback；Cache server belongs to a part for database server, stores
User part message, such as User ID.Whether cache server is new user for identifying the user terminal of the transmission registration request,
If being stored with the User ID at the user end, show the registered mistake in the user end, if not being stored with the user at the user end
ID then shows that the user end did not registered.
After registrar is determined as new user according to new user's judging result, will be registered by load-balanced server please
Summation registration UID is sent to storage agent server, and storage agent server is then forwarded to rear end and is stored, if not new use
Registered information is then fed back to user terminal in family.Repetition storing user's registered data are so avoided, waste memory space.
S2, storage agent server by store routing by registration request and registration UID be sent to database server into
Row storage, while registration UID is reported to storage management center.Database server includes several data for being used to store data
Equipment has a corresponding memory node of each data equipment in storage routing, and storage routing is according to memory node by registration request
Data equipment is sent to be stored.Register UID as the system be registration request distribution an identity information.
S3, storage management center receives the remaining memory capacity of calculating database after registration UID, when remaining memory capacity
During less than threshold capacity, apply for memory node to O＆M end to expand the capacity of database server, and the storage that will apply
Node increases to storage routing.
The step S3 is specially：
After storage management center receives registration UID, the occupancy memory capacity that database server is used is calculated.
Storage management center subtracts occupancy memory capacity according to the total memory capacity of database server, obtains remaining storage
Capacity.Such as the total memory capacity that is allocated of current database server is 10,000,000,000, the uid currently distributed to 9,000,000,000,
So administrative center can calculate the memory space of current residual 1,000,000,000.
Storage management center judges whether remaining memory capacity is less than threshold capacity, if so, send memory node application to
O＆M end, and receive the memory node distribution information of O＆M end feedback；After O＆M termination receives memory node application, by redundancy
Data equipment distributes to database server to expand the capacity of database server, then by the memory node of the data equipment
Distribution information is sent to storage management center.
Information is distributed in storage management center according to memory node, and newly assigned data equipment is carried out storehouse table initialization behaviour
Make, and increase to storage routing using the storehouse table information of initialization as memory node；The memory node of newly-increased data equipment increases
After being added to storage routing, storage agent server can store data into the newly-increased data equipment by storing routing.
Storage management center distributes information according to memory node and obtains newly-increased memory capacity, is updated according to newly-increased memory capacity
Total memory capacity.And pervious total memory capacity is added into newly-increased memory capacity and just can obtain new total memory capacity, so as under
It is secondary to be calculated.
To sum up, the present embodiment has the following advantages compared to traditional storage scheme：
First, it is more efficient without artificial dilatation.Cost of labor is saved, avoids the error of artificial dilatation, makes storage higher
Effect.
2nd, the utility value of hardware is improved, avoids the early stage waste of hardware.Traditional-handwork dilatation is, it is necessary to very early
Sufficient storage is provided, disposable progress dilatation causes the idle of hardware early period；Dynamic capacity-expanding processing, which is to store, to be reached
Before maximum storage, storage application is carried out, and after carrying out necessary initialization, storage is come into operation, the hardware brought fills
Divide and use.
Embodiment two：
A kind of dynamic capacity-expanding storage system is present embodiments provided, suitable for the dynamic storage method described in embodiment one,
As shown in Fig. 2, including registrar, load-balanced server, storage agent server, storage routing, database server
With storage management center；
For receiving the registration request of user terminal transmission, UID is registered for registration request distribution for registrar, and
Registration request and registration UID are sent to by storage agent server by load-balanced server.Load-balanced server is used for
Load balancing distribution is carried out, by the registration request equilibrium assignment of user to storage agent server, so as to ensure whole system
Response speed.
Specifically, registrar receives the registration request that user terminal is sent, the registration request is sent to caching clothes
Business device, and new user's judging result of order caching server feedback；Cache server belongs to a part for database server,
Store user part message, such as User ID.Cache server for identify send the registration request user terminal whether be
New user if being stored with the User ID at the user end, shows the registered mistake in the user end, if not being stored with the user end
User ID, then show the user end do not registered.
After registrar is determined as new user according to new user's judging result, will be registered by load-balanced server please
Summation registration UID is sent to storage agent server, and storage agent server is then forwarded to rear end and is stored, if not new use
Registered information is then fed back to user terminal in family.Repetition storing user's registered data are so avoided, waste memory space.
Registration request and registration UID are sent to database clothes by the storage agent server for passing through storage routing
Business device is stored, while registration UID is reported to storage management center.Database server is used to store data including several
Data equipment, have a corresponding memory node of each data equipment in storage routing, storage routing will be noted according to memory node
Volume request is sent to data equipment and is stored.Register UID as the system be registration request distribution an identity information.
Storage management center, for receive registration UID after calculate database remaining memory capacity, when residue storage hold
When amount is less than threshold capacity, applies for memory node to expand the capacity of database server to O＆M end, and deposited what is applied
Storage node increases to storage routing.
Specifically, after storage management center receives registration UID, calculate the occupancy storage that database server is used and hold
Amount.
Storage management center subtracts occupancy memory capacity according to the total memory capacity of database server, obtains remaining storage
Capacity.Such as the total memory capacity that is allocated of current database server is 10,000,000,000, the uid currently distributed to 9,000,000,000,
So administrative center can calculate the memory space of current residual 1,000,000,000.
Storage management center judges whether remaining memory capacity is less than threshold capacity, if so, send memory node application to
O＆M end, and receive the memory node distribution information of O＆M end feedback；.
Information is distributed in storage management center according to memory node, and newly assigned data equipment is carried out storehouse table initialization behaviour
Make, and increase to storage routing using the storehouse table information of initialization as memory node.The memory node of newly-increased data equipment increases
After being added to storage routing, storage agent server can store data into the newly-increased data equipment by storing routing.
Storage management center distributes information according to memory node and obtains newly-increased memory capacity, is updated according to newly-increased memory capacity
Total memory capacity.And pervious total memory capacity is added into newly-increased memory capacity and just can obtain new total memory capacity, so as under
It is secondary to be calculated.
To sum up, the present embodiment has the following advantages compared to traditional storage scheme：
First, it is more efficient without artificial dilatation.Cost of labor is saved, avoids the error of artificial dilatation, makes storage higher
Effect.
2nd, the utility value of hardware is improved, avoids the early stage waste of hardware.Traditional-handwork dilatation is, it is necessary to very early
Sufficient storage is provided, disposable progress dilatation causes the idle of hardware early period；Dynamic capacity-expanding processing, which is to store, to be reached
Before maximum storage, storage application is carried out, and after carrying out necessary initialization, storage is come into operation, the hardware brought fills
Divide and use.
Those of ordinary skill in the art may realize that each exemplary lists described with reference to the embodiments described herein
Member and method and step can be realized with the combination of electronic hardware, computer software or the two, in order to clearly demonstrate hardware
With the interchangeability of software, each exemplary composition and step are generally described according to function in the above description.This
A little functions are performed actually with hardware or software mode, specific application and design constraint depending on technical solution.Specially
Industry technical staff can realize described function to each specific application using distinct methods, but this realization is not
It is considered as beyond the scope of this invention.
In several embodiments provided herein, it should be understood that disclosed method and system can pass through it
Its mode is realized.For example, the division of unit described above, is only a kind of division of logic function, can have in actual implementation
Other dividing mode, such as multiple units or component may be combined or can be integrated into another system or some features
It can ignore or not perform.Said units may or may not be physically separate, to be shown as unit component
It may or may not be physical location, you can be located at a place or multiple network element can also be distributed to
On.Some or all of unit therein can be selected to realize the purpose of the embodiment of the present invention according to the actual needs.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that unit is individually physically present or two or more units integrate in a unit.It is above-mentioned integrated
The form that hardware had both may be employed in unit is realized, can also be realized in the form of SFU software functional unit.
Finally it should be noted that：The above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe is described in detail the present invention with reference to foregoing embodiments, it will be understood by those of ordinary skill in the art that：Its according to
Can so modify to the technical solution recorded in foregoing embodiments either to which part or all technical characteristic into
Row equivalent substitution；And these modifications or replacement, the essence of appropriate technical solution is not made to depart from various embodiments of the present invention technology
The scope of scheme should all cover among the claim of the present invention and the scope of specification.
Claims (6)
1. a kind of dynamic capacity-expanding storage method, which is characterized in that comprise the following steps：
Registrar receives the registration request that user terminal is sent, and registers UID for registration request distribution, and it is equal to pass through load
Registration request and registration UID are sent to storage agent server by weighing apparatus server；
Registration request and registration UID are sent to database server and stored by storage agent server by storing routing,
Registration UID is reported to storage management center simultaneously；
Storage management center receives the remaining memory capacity of calculating database after registration UID, when remaining memory capacity is less than threshold
When being worth capacity, apply for memory node to expand the capacity of database server to O＆M end, and the memory node applied is increased
It is added to storage routing.
2. a kind of dynamic capacity-expanding storage method according to claim 1, which is characterized in that the registrar, which receives, to be used
The registration request that family end is sent, for registration request distribution registration UID, and pass through load-balanced server by registration request and
Registration UID is sent to storage agent server, is specially：
Registrar receives the registration request that user terminal is sent, and the registration request is sent to cache server, and is received
New user's judging result of cache server feedback；
After registrar is determined as new user according to new user's judging result, for registration request distribution registration UID；
Registration request and registration UID are sent to storage agent server by registrar by load-balanced server.
3. a kind of dynamic capacity-expanding storage method according to claim 1, which is characterized in that the storage management center receives
The remaining memory capacity of database is calculated after to registration UID, when remaining memory capacity is less than threshold capacity, is applied to O＆M end
The memory node applied is increased to storage routing by memory node to expand the capacity of database server, is specially：
After storage management center receives registration UID, the occupancy memory capacity that database server is used is calculated；
Storage management center subtracts occupancy memory capacity according to the total memory capacity of database server, obtains remaining storage and holds
Amount；
Storage management center judges whether remaining memory capacity is less than threshold capacity, if so, sending memory node application to O＆M
End, and receive the memory node distribution information of O＆M end feedback；
Information is distributed in storage management center according to memory node, and newly assigned data equipment is carried out storehouse table initialization operation, and
Increase to storage routing using the storehouse table information of initialization as memory node；
Storage management center distributes information according to memory node and obtains newly-increased memory capacity, is always deposited according to the update of newly-increased memory capacity
Store up capacity.
4. a kind of dynamic capacity-expanding storage system, suitable for dynamic storage method described in claim 1, which is characterized in that including
Registrar, load-balanced server, storage agent server, storage routing, database server and storage management center；
Registrar for receiving the registration request of user terminal transmission, is registered UID for registration request distribution, and is passed through
Registration request and registration UID are sent to storage agent server by load-balanced server；
Registration request and registration UID are sent to database server progress by storage agent server for passing through storage routing
Storage, while registration UID is reported to storage management center；
Storage management center, for receive registration UID after calculate database remaining memory capacity, when remaining memory capacity is small
When threshold capacity, apply for memory node to O＆M end to expand the capacity of database server, and the storage section that will apply
Point increases to storage routing.
5. a kind of dynamic capacity-expanding storage system according to claim 4, which is characterized in that the registration service implement body is used
In：
The registration request that user terminal is sent is received, the registration request is sent to cache server, and order caching server
New user's judging result of feedback；
After being determined as new user according to new user's judging result, for registration request distribution registration UID；
Registration request and registration UID are sent to by storage agent server by load-balanced server.
A kind of 6. dynamic capacity-expanding storage system according to claim 5, which is characterized in that the storage management center tool
Body is used for：
After receiving registration UID, the occupancy memory capacity that database server is used is calculated；
Occupancy memory capacity is subtracted according to the total memory capacity of database server, obtains remaining memory capacity；
Judge whether remaining memory capacity is less than threshold capacity, if so, sending memory node application gives O＆M end, and receive O＆M
The memory node distribution information of end feedback；
Information is distributed according to memory node, newly assigned data equipment is subjected to storehouse table initialization operation, and by the storehouse of initialization
Table information increases to storage routing as memory node；
Information is distributed according to memory node and obtains newly-increased memory capacity, and total memory capacity is updated according to newly-increased memory capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810049360.9A CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810049360.9A CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108111628A true CN108111628A (en) | 2018-06-01 |
| CN108111628B CN108111628B (en) | 2021-08-17 |
Family
ID=62218648
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810049360.9A Active CN108111628B (en) | 2018-01-18 | 2018-01-18 | Dynamic capacity-expansion storage method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108111628B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109085999A (en) * | 2018-06-15 | 2018-12-25 | 华为技术有限公司 | data processing method and processing system |
| CN110825308A (en) * | 2018-08-07 | 2020-02-21 | 北京国双科技有限公司 | Data space management method and device |
| CN111796768A (en) * | 2020-06-30 | 2020-10-20 | 中国工商银行股份有限公司 | Distributed service coordination method, device and system |
| CN114640607A (en) * | 2022-05-12 | 2022-06-17 | 武汉四通信息服务有限公司 | Monitoring service registration method and device, computer equipment and storage medium |
| CN117082068A (en) * | 2023-08-25 | 2023-11-17 | 北京神州云合数据科技发展有限公司 | Elastic expansion method and system for tax return server |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102222107A (en) * | 2011-06-28 | 2011-10-19 | 中国联合网络通信集团有限公司 | Data access system and method |
| CN102508693A (en) * | 2011-09-29 | 2012-06-20 | 华中科技大学 | Web server capacity expansion system based on virtual machine |
| CN105162859A (en) * | 2015-08-20 | 2015-12-16 | 湖南亿谷科技发展股份有限公司 | Dynamic server dilatation system and method |
| CN105391695A (en) * | 2015-10-20 | 2016-03-09 | 山东泰信电子股份有限公司 | Terminal registration method and verification method |
| CN105847352A (en) * | 2016-03-22 | 2016-08-10 | 青岛海信传媒网络技术有限公司 | Distributed cache system-based capacity expansion method, device and distributed cache system |
| US20160371790A1 (en) * | 2015-06-17 | 2016-12-22 | Sap Se | Extension Ledger |
-
2018
- 2018-01-18 CN CN201810049360.9A patent/CN108111628B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102222107A (en) * | 2011-06-28 | 2011-10-19 | 中国联合网络通信集团有限公司 | Data access system and method |
| CN102508693A (en) * | 2011-09-29 | 2012-06-20 | 华中科技大学 | Web server capacity expansion system based on virtual machine |
| US20160371790A1 (en) * | 2015-06-17 | 2016-12-22 | Sap Se | Extension Ledger |
| CN105162859A (en) * | 2015-08-20 | 2015-12-16 | 湖南亿谷科技发展股份有限公司 | Dynamic server dilatation system and method |
| CN105391695A (en) * | 2015-10-20 | 2016-03-09 | 山东泰信电子股份有限公司 | Terminal registration method and verification method |
| CN105847352A (en) * | 2016-03-22 | 2016-08-10 | 青岛海信传媒网络技术有限公司 | Distributed cache system-based capacity expansion method, device and distributed cache system |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109085999A (en) * | 2018-06-15 | 2018-12-25 | 华为技术有限公司 | data processing method and processing system |
| CN110825308A (en) * | 2018-08-07 | 2020-02-21 | 北京国双科技有限公司 | Data space management method and device |
| CN110825308B (en) * | 2018-08-07 | 2023-12-26 | 北京国双科技有限公司 | Data space management method and device |
| CN111796768A (en) * | 2020-06-30 | 2020-10-20 | 中国工商银行股份有限公司 | Distributed service coordination method, device and system |
| CN111796768B (en) * | 2020-06-30 | 2023-08-22 | 中国工商银行股份有限公司 | Distributed service coordination method, device and system |
| CN114640607A (en) * | 2022-05-12 | 2022-06-17 | 武汉四通信息服务有限公司 | Monitoring service registration method and device, computer equipment and storage medium |
| CN117082068A (en) * | 2023-08-25 | 2023-11-17 | 北京神州云合数据科技发展有限公司 | Elastic expansion method and system for tax return server |
| CN117082068B (en) * | 2023-08-25 | 2024-03-29 | 北京神州云合数据科技发展有限公司 | Elastic expansion method and system for tax return server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108111628B (en) | 2021-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108111628A (en) | A kind of dynamic capacity-expanding storage method and system | |
| CN105391797B (en) | Cloud Server load-balancing method and device based on SDN | |
| CN110601922B (en) | Method and device for realizing comparison experiment, electronic equipment and storage medium | |
| CN104683161B (en) | Network management and device based on SaaS | |
| CN106657287A (en) | Data access method and system | |
| CN106936618A (en) | A kind of collecting method and system | |
| CN108322502A (en) | Method, gateway system and storage medium for equalization server load | |
| CN106067858A (en) | Communication means between container, Apparatus and system | |
| CN109873910A (en) | Processing method, device and the storage medium of session request | |
| CN106209411B (en) | Distributed network system (DNS) fault-tolerance approach, device and fault tolerant type distributed network system (DNS) | |
| CN103838855A (en) | Method for updating residual tickets | |
| CN110445884A (en) | A kind of container IP address management method and device | |
| CN107835262A (en) | A kind of streaming media server dynamical load distribution method | |
| CN110515727A (en) | A kind of the memory headroom operating method and relevant apparatus of FPGA | |
| CN109121185A (en) | The selection method and device, computer readable storage medium of network slice subnet | |
| CN104202386B (en) | A kind of high concurrent amount distributed file system and its secondary load equalization methods | |
| CN109086136A (en) | A kind of request processing method and relevant apparatus of Samba software | |
| CN109067931A (en) | A kind of method and system of cloud management platform virtual machine floating IP address setting | |
| CN105847352A (en) | Distributed cache system-based capacity expansion method, device and distributed cache system | |
| CN105376347A (en) | IP address allocation method and system | |
| CN101594642B (en) | Resource allocation method and resource allocation device used for communication network element device | |
| CN109819023A (en) | Distributed transaction processing method and Related product | |
| CN106790469A (en) | A kind of buffer control method, device and system | |
| CN107770296B (en) | Method and device for allocating addresses | |
| CN112037019B (en) | Method and device for allocating self-service equipment of banking outlets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |