CN110377228A - Automatic expansion method, device, O&M terminal and the storage medium of block chain node - Google Patents
Automatic expansion method, device, O&M terminal and the storage medium of block chain node Download PDFInfo
- Publication number
- CN110377228A CN110377228A CN201910532942.7A CN201910532942A CN110377228A CN 110377228 A CN110377228 A CN 110377228A CN 201910532942 A CN201910532942 A CN 201910532942A CN 110377228 A CN110377228 A CN 110377228A
- Authority
- CN
- China
- Prior art keywords
- disk
- node
- capacity
- value
- block 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000006870 function Effects 0.000 claims description 80
- 238000012549 training Methods 0.000 claims description 14
- 238000004891 communication Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008859 change Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000003066 decision tree Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000007637 random forest analysis Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 230000000007 visual effect Effects 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/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/0638—Organizing or formatting or addressing of data
-
- 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]
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)
- Debugging And Monitoring (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of automatic expansion method of block chain node, device, O&M terminal and storage mediums, are applied to block chain O&M, which comprises obtain the disk residual capacity delta data of block chain interior joint；According to the disk residual capacity delta data, the corresponding disk size anticipation function of the node is obtained, and obtains the disk remaining capacity value of the node after preset time according to the disk size anticipation function；Disk target capacity of expansion is determined according to the disk remaining capacity value of node described after preset time, to carry out dilatation to the node according to the disk target capacity of expansion.The disk remaining capacity value of preset time posterior nodal point has wherein been evaluated by disk size anticipation function, and then it obtains disk target capacity of expansion and realizes on-demand effective dilatation of block chain node with this, disk storage space is rationally utilized, disk space usage is improved, help reduces manual intervention bring risk.
Description
Technical field
The present invention relates to the automatic expansion method of block chain field more particularly to block chain node, device, O&M terminal and
Computer readable storage medium.
Background technique
With the appearance of bit coin, block chain technology is appeared in the people visual field, and block chain technology is widely used at present
In data security arts.And in block chain project O&M, since the write-in data volume to node on every block chain can not be quasi-
Really assessment, therefore it is easy to appear the insufficient situation of storage.When the node storage for block chain occur is insufficient, manpower intervention is needed to mend
It fills storage resource and/or carries out Data Migration, this undoubtedly increases cost of serving, if storage preparation is too many, will cause resource
It wastes significantly.Therefore how the data capacity of node on every chain is effectively set, be urgently to improve disk space usage
It solves the problems, such as.
Summary of the invention
The main purpose of the present invention is to provide a kind of automatic expansion method of block chain node, device, O&M terminal and
Computer readable storage medium, it is intended to the data capacity that node on every chain can not be effectively set at present is solved, so that disk is empty
Between the low technical problem of utilization rate.
To achieve the above object, the present invention provides a kind of automatic expansion method of block chain node, comprising the following steps:
Obtain the disk residual capacity delta data of block chain interior joint；
According to the disk residual capacity delta data, the corresponding disk size anticipation function of the node, and root are obtained
The disk remaining capacity value of the node after preset time is obtained according to the disk size anticipation function；
Disk target capacity of expansion is determined according to the disk remaining capacity value of node described after preset time, according to described
Disk target capacity of expansion carries out dilatation to the node.
Optionally, the disk residual capacity delta data includes time point and corresponding remaining capacity value；
It is described according to the disk residual capacity delta data, obtain the corresponding disk size anticipation function of the node
Step includes:
A start time point is chosen from all time points of the disk residual capacity delta data, by the starting
All time points and corresponding remaining capacity value before time point as training data, by the institute after the start time point
Having time point and corresponding remaining capacity value are as sample data；
The training data is input in default arithmetic unit and carries out recurrence, to obtain time point and remaining capacity value phase
The reference prediction function of pass；
The reference prediction function is iterated by the sample data, when completing iteration after completing iteration
Reference prediction function as the corresponding disk size anticipation function of the node.
Optionally, described the step of being iterated by the sample data to the reference prediction function, includes:
It is remaining using the corresponding prediction of node described in any time point in reference prediction function calculating sample data
Capability value；
Real surplus capability value corresponding to time point when calculating prediction remaining capacity value is obtained from sample data, and
The prediction remaining capacity value and the real surplus capability value are compared, to obtain residual capacity error；
Judge whether the residual capacity error meets default stopping criterion for iteration；
When the residual capacity error meets default stopping criterion for iteration, iteration ends；
When the residual capacity error does not meet default stopping criterion for iteration, according to the residual capacity error update institute
State reference prediction function.
Optionally, described to judge that the step of whether the residual capacity error meets default stopping criterion for iteration includes:
Judge whether the residual capacity error is less than preset threshold；
When the residual capacity error is less than preset threshold, determine that the residual capacity error meets default iteration ends
Condition；
When the residual capacity error is greater than or equal to preset threshold, it is default to determine that the residual capacity error is not met
Stopping criterion for iteration.
Optionally, the disk remaining capacity value according to node described after preset time determines disk target capacity of expansion
The step of include:
Whether the disk remaining capacity value α after judging preset time is less than preset capacity setting value δ；
When disk remaining capacity value α after preset time is less than preset capacity setting value δ, the current of the node is obtained
Disk remaining capacity value β, and the node is worked as into front disk remaining capacity value β, preset capacity setting value δ and preset time
Disk remaining capacity value α afterwards is input to the disk target expansion that the node is obtained in the arithmetic unit including formula γ=β+δ-α
Hold capacity γ.
Optionally, whether the disk remaining capacity value α judged after preset time is less than the step of preset capacity setting value δ
After rapid, further includes:
When disk remaining capacity value α after preset time is greater than or equal to preset capacity setting value δ, after preset time
Disk target capacity of expansion γ of the disk remaining capacity value α as the node.
Optionally, the disk remaining capacity value according to node described after preset time determines disk target capacity of expansion
The step of after, further includes:
Judge the total surplus capacity of hard disk where whether the disk target capacity of expansion of the node is greater than the node；
Where the disk target capacity of expansion of the node is greater than the node when total surplus capacity of disk, issue hard
The prompt information of disk off-capacity；
Where the disk target capacity of expansion of the node is less than or equal to the node when total surplus capacity of disk,
Execute the step of dilatation is carried out to the node according to the disk target capacity of expansion.
In addition, to achieve the above object, the present invention also provides a kind of automatic flash chamber of block chain node, described devices
Include:
Module is obtained, for obtaining the disk residual capacity delta data of block chain interior joint；
The acquisition module is also used to obtain the corresponding magnetic of the node according to the disk residual capacity delta data
Disk capacity anticipation function, and according to the disk residual capacity of the node after disk size anticipation function acquisition preset time
Value；
Dilatation module, for determining that disk target dilatation is held according to the disk remaining capacity value of node described after preset time
Amount, to carry out dilatation to the node according to the disk target capacity of expansion.
In addition, to achieve the above object, the present invention also provides a kind of O&M terminal, the O&M terminal includes: communication mould
Block, memory, processor and it is stored in the computer program that can be run on the memory and on the processor, the meter
Calculation machine program realizes the step of automatic expansion method of block chain node as described above when being executed by the processor.
In addition, to achieve the above object, it is described computer-readable the present invention also provides a kind of computer readable storage medium
Computer program is stored on storage medium, the computer program realizes block chain link as described above when being executed by processor
The step of automatic expansion method of point.
Automatic expansion method, device, O&M terminal and the storage for a kind of block chain node that the embodiment of the present invention proposes are situated between
Matter, by the disk residual capacity delta data for obtaining block chain interior joint；According to the disk residual capacity delta data, obtain
The corresponding disk size anticipation function of the node is taken, and according to described after disk size anticipation function acquisition preset time
The disk remaining capacity value of node；Determine that disk target dilatation is held according to the disk remaining capacity value of node described after preset time
Amount, to carry out dilatation to the node according to the disk target capacity of expansion.Letter is wherein predicted by obtained disk size
Number has predicted the disk remaining capacity value of preset time posterior nodal point, and then has been determined that disk waits expanding according to disk remaining capacity value
The disk target capacity of expansion held, to carry out dilatation according to disk target capacity of expansion, it is thus achieved that block chain node
On-demand effective dilatation, is rationally utilized disk storage space, improves disk space usage, and help reduces manual intervention band
The risk come.
Detailed description of the invention
Fig. 1 is the structural schematic diagram for the hardware running environment that the embodiment of the present invention is related to；
Fig. 2 is the flow diagram of the automatic expansion method first embodiment of block chain node of the present invention；
Fig. 3 is the flow diagram of step S20 in the automatic expansion method second embodiment of block chain node of the present invention；
Fig. 4 is the functional block diagram of one embodiment of automatic flash chamber of block chain node of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
Fig. 1 is please referred to, Fig. 1 is the hardware structural diagram of O&M terminal provided by the present invention.The O&M terminal can
To be server, device end, such as computer can be, the O&M terminal may include communication module 10, memory 20
And the equal components of processor 30.In the O&M terminal, the processor 30 respectively with the memory 20 and described logical
To believe that module 10 connects, is stored with computer program on the memory 20, the computer program is executed by processor 30 simultaneously,
The step of following methods embodiment is realized when the computer program executes.
Communication module 10 can be connect by network with external communications equipment.Communication module 10 can receive external communication and set
The request that preparation goes out, can also send request, instruction and information to the external communications equipment.The external communications equipment can be with
It is other equipment or other O&M terminals, such as other servers etc..
Memory 20 can be used for storing software program and various data.Memory 20 can mainly include storing program area
The storage data area and, wherein storing program area can application program needed for storage program area, at least one function (for example obtain
Take the disk size delta data of block chain node) etc.；Storage data area may include database, and storage data area can store basis
O&M terminal uses created data or information etc..In addition, memory 20 may include high-speed random access memory, also
It may include nonvolatile memory, a for example, at least disk memory, flush memory device or the storage of other volatile solid-states
Device.
Processor 30 is the control centre of O&M terminal, utilizes each of various interfaces and the entire O&M terminal of connection
A part by running or execute the software program and/or module that are stored in memory 20, and calls and is stored in memory
Data in 20 execute the various functions and processing data of O&M terminal, to carry out integral monitoring to O&M terminal.Processor
30 may include one or more processing units；Optionally, processor 30 can integrate application processor and modem processor,
In, the main processing operation system of application processor, user interface and application program etc., modem processor are mainly handled wirelessly
Communication.It is understood that above-mentioned modem processor can not also be integrated into processor 30.
Although Fig. 1 is not shown, above-mentioned O&M terminal can also include that circuit control module is protected for connecting to power supply
Demonstrate,prove the normal work of other component.Above-mentioned O&M terminal can also include display module, for extracting the data in memory 20,
And show the system interface and the interactive interface of user and the disk size situation of change of block chain of O&M terminal.Ability
Field technique personnel are appreciated that O&M terminal structure shown in Fig. 1 does not constitute the restriction to O&M terminal, may include ratio
More or fewer components are illustrated, certain components or different component layouts are perhaps combined.
Based on above-mentioned hardware configuration, each embodiment of the method for the present invention is proposed.
Referring to fig. 2, in the first embodiment of the automatic expansion method of block chain node of the present invention, which comprises
Step S10 obtains the disk residual capacity delta data of block chain interior joint；
It should be noted that safeguarding that the account book data volume of information unification is bigger in the block chain technology of decentralization, each
Memory capacity needed for node is more, and the storage of node also relies on the amount of capacity of disk, therefore available block
The corresponding volume change situation data for occupying disk of each node in chain.Wherein volume change situation data may include that difference is gone through
History time point correspondence, which has occupied disk size situation and the node, can occupy the residual capacity of disk, by obtaining record not
With the available disk residual capacity delta data of disk residual capacity of historical time point.
Optionally, when determining residual capacity, multiple nodes can be accounted in historical time point correspondence in available block chain
According to the remaining space value of disk, then remove the maximum value and minimum value in all values, averaged is using as the time
The disk residual capacity of point, in this way can to avoid some node disk failure and cause the disk of the preset time point of prediction surplus
The problem of covolume amount inaccuracy.
Further, the magnetic of each node can also be calculated in the disk residual capacity of statistical history time point interior nodes
Disk residual capacity and the difference of average value sought, and judge whether difference is greater than or equal to preset threshold, if difference be greater than or
Equal to preset threshold, show the disk of corresponding node in actual block chain there are failure, memory capacity compared with other nodes too
Greatly, fault alarm prompting message can be sent to operation maintenance personnel, play the role of node disk storage supervision.
Step S20 obtains the corresponding disk size prediction letter of the node according to the disk residual capacity delta data
Number, and according to the disk remaining capacity value of the node after disk size anticipation function acquisition preset time；
In the present embodiment, can be by presetting statistical method, which can be using neural network to disk
Residual capacity delta data carries out recurrence, such as can be linear regression or adaptive recurrence.Alternatively, other can also be referred to
Machine learning algorithm, such as decision tree or random forests algorithm etc. obtain can be used in the node future in prediction block chain
The anticipation function of disk remaining space capacity in time.
It is understood that disk size anticipation function is to change number according to the disk residual capacity in the time in past section
According to accessed by representative historical variations trend, volume change situation before fitting in, this programme by obtaining in the past
Delta data form anticipation function, disk residual capacity for the node of some time or multiple times after estimating
Value.Optionally, wherein disk size anticipation function can change number with reference to 6 hours of current time pervious disk residual capacity
According to being obtained.
Step S30 determines disk target capacity of expansion according to the disk remaining capacity value of node described after preset time, with
Dilatation is carried out to the node according to the disk target capacity of expansion.
Wherein disk target capacity of expansion refers to the free disk capacity that the posterior nodal point of preset time needs to occupy, Huo Zhekuo
Disk remaining capacity value to be achieved is needed after appearance, the acquisition of disk target capacity of expansion then can be according to disk size anticipation function
The disk remaining capacity value of obtained preset time posterior nodal point is determined, for example, it can be set to after preset value and preset time
Disk remaining capacity value is compared determination, or the disk remaining capacity value after preset time can also be brought into formula into
Row, which calculates, to be determined.Carrying out dilatation to node can be through hot capacity-enlargement technology directly to the progress of block chain node running container
Extension, does not influence normal use.
Further, the step of carrying out dilatation to node according to disk target capacity of expansion in above-mentioned steps S30 may is that
Before reaching preset time, node is occupied into the remaining space dilatation of disk to disk target dilatation in such a way that thermal expansion is held
Capacity.By carrying out the adjustment of node disk residual capacity before preset time, it is insufficient that node storage can be prevented
Situation reduces the number of manpower intervention, and the storage of block chain node data is enable to be protected.
The disk residual capacity delta data that the present embodiment passes through acquisition block chain interior joint；Held according to the disk residue
Delta data is measured, obtains the corresponding disk size anticipation function of the node, and obtain according to the disk size anticipation function
The disk remaining capacity value of the node after preset time；It is determined according to the disk remaining capacity value of node described after preset time
Disk target capacity of expansion, to carry out dilatation to the node according to the disk target capacity of expansion.Wherein by obtaining
Disk size anticipation function has predicted the disk remaining capacity value of preset time posterior nodal point, and then according to disk remaining capacity value
The disk disk target capacity of expansion to be expanded arrived has been determined, to carry out dilatation according to disk target capacity of expansion, thus, it is possible to
It solves the problem of that manpower intervention increases cost of serving or storage preparation causes resource to waste significantly too much, realizes block
On-demand effective dilatation of chain node, is rationally utilized disk storage space, improves disk space usage, and help reduces people
Work intervenes bring risk.
Further, the first embodiment of the automatic expansion method based on block chain node of the present invention proposes block of the present invention
The second embodiment of the automatic expansion method of chain node, referring to Fig. 3, in the present embodiment, the disk residual capacity changes number
According to including time point and corresponding remaining capacity value；
The step S20 includes:
Step S21 chooses a start time point from all time points of the disk residual capacity delta data, will
All time points and corresponding remaining capacity value before the start time point as training data, by the start time point
All time points later and corresponding remaining capacity value are as sample data；
In the present embodiment, after for how to obtain capable of predicting preset time according to disk residual capacity delta data
The process of the anticipation function of disk remaining capacity value is further limited.It is emphasized that disk size anticipation function
Accuracy be related to the disk remaining capacity value and disk target capacity of expansion result of the node after preset time
Accuracy, therefore need to obtain function and trained before obtaining final disk size anticipation function, this is related to
The acquisition of training data and sample data is arrived.All disk residual capacity delta datas can be drawn according to time point
Point, time point and corresponding remaining capacity value before the start time point selected are training data, when the starting of selection
Between put after time point and corresponding remaining capacity value as sample data.Wherein, sample data and training number are divided
According to start time point to train in an intermediate position or start time point position in the time shaft that time point is constituted
The total capacity size of data is greater than or equal to the total capacity size of sample data.
The training data is input in default arithmetic unit and carries out recurrence by step S22, to obtain time point and residue
The relevant reference prediction function of capability value；
Can be according in training data time point and corresponding disk remaining capacity value to form time point and disk surplus
The two-dimensional coordinate scatter plot of covolume magnitude, wherein time point is the abscissa of the two-dimensional coordinate scatter plot, each in scatter plot
The disk remaining capacity value of scatterplot all having time point and correspondence markings.Then these scatterplots are subjected to recurrenceization and form two-dimensional curve
Figure, and the relevant change curve function of disk remaining capacity value is formed according to two dimensional plot, wherein recurrenceization can be linearly
At least one of return and adaptively return, the change curve function finally obtained can be used as reference prediction function, body
Existing is the rule at time point and disk remaining capacity value, related to time point and remaining capacity value.
Step S23 is iterated the reference prediction function by the sample data, will change after completing iteration
Reference prediction function when generation completes is as the corresponding disk size anticipation function of the node.
Whether the reference prediction function obtained by training data meets after preset time disk size situation of change can be with
It is verified by sample data, if error is larger can also to be modified iteration to reference prediction function, reduces prediction and miss
Difference.It is to be understood that the newest reference prediction function once modified is that the corresponding disk of node holds when final iteration completion
Measure anticipation function.This programme gives by the combination of sample data, training data and regression iterative operation and how to obtain magnetic
The process of disk capacity anticipation function, help finally obtain the anticipation function for meeting practical disk residual capacity situation.
Optionally, above-mentioned steps S23 may include:
Step S231, it is corresponding using the node in any time point in reference prediction function calculating sample data
Predict remaining capacity value；
In the present embodiment, some in sample data or certain several time point can be calculated by reference prediction function
Predict remaining capacity value.It is understood that reference prediction function is time point and the relevant function of remaining capacity value, therefore only
Know time point, so that it may remaining capacity value is calculated by function, and function is by curve acquisition, not actually
In the case of, therefore calculated remaining capacity value is prediction remaining capacity value.
Step S232 obtains real surplus corresponding to time point when calculating prediction remaining capacity value from sample data
Capability value, and the prediction remaining capacity value and the real surplus capability value are compared, to obtain residual capacity error；
Since the start time point in sample data including selection disk remaining capacity value recorded later changes feelings
Condition, therefore can be after obtaining prediction remaining capacity value, the real surplus that same time point is obtained from sample data is held
Then prediction remaining capacity value and real surplus capability value are compared, obtain the difference between actual value and predicted value by magnitude
Value is using as residual capacity error, thus according to the accuracy of obtained residual capacity error evaluation reference prediction function.
Step S233, judges whether the residual capacity error meets default stopping criterion for iteration；Wherein, when the residue
When volume error meets default stopping criterion for iteration, iteration ends；
Above-mentioned default stopping criterion for iteration can be configured according to actual needs, such as can recorde when calculating error
Number, the number and/or the number of iterations of residual capacity error, when number or number are greater than or equal to some setting value, it is believed that symbol
Close stopping criterion for iteration；And/or calculated error is less than some extreme value and thinks to meet stopping criterion for iteration.When being determined for compliance with repeatedly
When for termination condition, the reference prediction function of newest iteration can be exported, and stops iteration.
Step S234, when the residual capacity error does not meet default stopping criterion for iteration, according to the residual capacity
Reference prediction function described in error update.
It, can be according to the loss letter of residual capacity error calculation reference prediction function when not meeting stopping criterion for iteration
Number, and be adjusted according to parameter of the loss function to reference prediction function, to realize the iteration of reference prediction function, until repeatedly
Until in generation, completes.Reference prediction function is updated by the way that stopping criterion for iteration is arranged, can help to improve function prediction
Accuracy, more the disk space situation of change of closing to reality block chain node, improve the accuracy of on-demand dilatation indirectly.
Wherein, when stopping criterion for iteration is that residual capacity error is less than preset threshold, judge whether residual capacity error accords with
Closing the step of presetting stopping criterion for iteration may include:
Judge whether the residual capacity error is less than preset threshold；When the residual capacity error is less than preset threshold
When, determine that the residual capacity error meets default stopping criterion for iteration；It is preset when the residual capacity error is greater than or equal to
When threshold value, determine that the residual capacity error does not meet default stopping criterion for iteration.By using residual capacity error size as
The reference standard of iteration ends enables to finally obtained remaining space anticipation function and practical disk size situation of change
Error in a certain range, meets the automatic dilatation requirement of block chain node.
Further, the first embodiment of the automatic expansion method based on block chain node of the present invention proposes block of the present invention
The 3rd embodiment of the automatic expansion method of chain node, in the present embodiment, the step S30 includes:
Whether step S31, the disk remaining capacity value α after judging preset time are less than preset capacity setting value δ；
Preset capacity setting value can be fixed, which is more than or equal to 0, can also be with the time
Variation is gradually increased or reduces, the characteristic that can be stored according to the different field data of block chain practice in practical operation
It determines.It, can be by disk remaining capacity value after preset time and ownership in same time in each different time range
The preset capacity setting value of range is compared to determine disk target capacity of expansion that finish node needs dilatation to arrive.
Wherein, it when the disk remaining capacity value α after preset time is greater than or equal to preset capacity setting value δ, will preset
Disk target capacity of expansion γ of the disk remaining capacity value α as the node after time.It is understood that script according to
What disk size anticipation function was predicted is final disk target capacity of expansion, then it is considered that disk after preset time
Space is still enough, does not need to execute disk dilatation operation.
Step S32 obtains the section when disk remaining capacity value α after preset time is less than preset capacity setting value δ
Point works as front disk remaining capacity value β, and by the node as front disk remaining capacity value β, preset capacity setting value δ and
Disk remaining capacity value α after preset time is input in the arithmetic unit including formula γ=β+δ-α, obtains the magnetic of the node
Disk target capacity of expansion γ.
Disk remaining capacity value is smaller than default disk size setting value after preset time, can be according to the public affairs of arithmetic unit
Formula combines default disk size setting value, disk remaining capacity value after front disk remaining capacity value and preset time to be surveyed
It calculates, obtains the disk remaining space target value i.e. disk target capacity of expansion that finish node needs dilatation to reach.The present embodiment by
In the join operation by many kinds of parameters, it is contemplated that the demand of disk after preset time, so that the disk residual capacity after dilatation
Always bigger than working as front disk remaining space value, call data storage that is more balanced and meeting node realizes block chain node
On-demand dilatation.
Optionally, in other embodiments, held in the step S30 according to the disk residue of node described after preset time
Magnitude determined after the step of disk target capacity of expansion, further includes: judge the node disk target capacity of expansion whether
Greater than the total surplus capacity of hard disk where the node；Where the disk target capacity of expansion of the node is greater than the node
When the total surplus capacity of disk, the insufficient prompt information of hard-disk capacity is issued；When the disk target capacity of expansion of the node is small
In or equal to when the total surplus capacity of disk, execution is according to the disk target capacity of expansion to the node where the node
The step of carrying out dilatation.
It should be noted that carrying out not distributing to this disposably in the node dilatation of block chain automatically on demand in this programme
The memory space of node whole, therefore disk total surplus capacity and needs can also be seen after obtaining target capacity of expansion every time
The relationship of target capacity of expansion needed for dilatation, when target capacity of expansion is greater than disk total surplus capacity, expression node corresponds to magnetic
It is that node transfers the problem of capacity progress dilatation can solve that the hardware memory space deficiency of disk, which has not been software itself, is needed
It triggers and operation maintenance personnel is notified to carry out hardware dilatation to disk in a manner of sending prompting message.Therefore this programme passes through dilatation sky
Between comparison, distinguish whether need to carry out manpower intervention, node dilatation is very flexible and convenient.
Referring to fig. 4, the present invention also proposes a kind of automatic flash chamber of block chain node, and described device can be service
Device or O&M terminal, such as computer, in one embodiment, described device includes:
Module 10 is obtained, for obtaining the disk residual capacity delta data of block chain interior joint；
The acquisition module 10 is also used to that it is corresponding to obtain the node according to the disk residual capacity delta data
Disk size anticipation function, and held according to the disk residue of the node after disk size anticipation function acquisition preset time
Magnitude；
Dilatation module 20, for determining disk target dilatation according to the disk remaining capacity value of node described after preset time
Capacity, to carry out dilatation to the node according to the disk target capacity of expansion.
Further, in another embodiment, the disk residual capacity delta data includes time point and corresponding surplus
Covolume magnitude；The acquisition module includes:
Selection unit, for choosing an initial time from all time points of the disk residual capacity delta data
Point, using before the start time point all time points and corresponding remaining capacity value as training data, described will rise
All time points and corresponding remaining capacity value after time point beginning are as sample data；
Unit is returned, recurrence is carried out for the training data to be input in default arithmetic unit, to obtain time point
Reference prediction function relevant with remaining capacity value；
Iteration unit, for being iterated by the sample data to the reference prediction function, to complete iteration
Reference prediction function when iteration being completed afterwards is as the corresponding disk size anticipation function of the node.
Further, in another embodiment, the iteration unit includes:
Computation subunit, for utilizing the node in any time point in reference prediction function calculating sample data
Corresponding prediction remaining capacity value；
Comparing subunit, for obtaining reality corresponding to the time point calculated when predicting remaining capacity value from sample data
Border remaining capacity value, and the prediction remaining capacity value and the real surplus capability value are compared, to obtain remaining appearance
Measure error；
Judgment sub-unit, for judging whether the residual capacity error meets default stopping criterion for iteration；And when described
When residual capacity error meets default stopping criterion for iteration, iteration ends；
Subelement is updated, for being remained according to described when the residual capacity error does not meet default stopping criterion for iteration
Reference prediction function described in covolume amount error update.
Further, in another embodiment, the judgment sub-unit is specifically used for:
Judge whether the residual capacity error is less than preset threshold；When the residual capacity error is less than preset threshold
When, determine that the residual capacity error meets default stopping criterion for iteration；It is preset when the residual capacity error is greater than or equal to
When threshold value, determine that the residual capacity error does not meet default stopping criterion for iteration.
Further, in another embodiment, the dilatation module includes:
Judging unit, for judging whether the disk remaining capacity value α after preset time is less than preset capacity setting value δ；
Arithmetic element when being less than preset capacity setting value δ for the disk remaining capacity value α after preset time, obtains
The node works as front disk remaining capacity value β, and by the node as front disk remaining capacity value β, preset capacity setting
Disk remaining capacity value α after value δ and preset time is input in the arithmetic unit including formula γ=β+δ-α, is obtained described
The disk target capacity of expansion γ of node.
Further, in another embodiment, the dilatation module further include:
Setting unit is greater than or equal to preset capacity setting value δ for disk remaining capacity value α after preset time
When, using the disk remaining capacity value α after preset time as the disk target capacity of expansion γ of the node.
Further, in another embodiment, described device further include:
Judgment module, for judging hard disk where whether the disk target capacity of expansion of the node is greater than the node
Total surplus capacity；And the total surplus of disk holds where the disk target capacity of expansion of the node is less than or equal to the node
When amount, triggers the dilatation module and execute the step of dilatation is carried out to the node according to the disk target capacity of expansion；
Sending module, the total surplus for the disk where the disk target capacity of expansion of the node is greater than the node
When capacity, the insufficient prompt information of hard-disk capacity is issued.
The present invention also proposes a kind of computer readable storage medium, is stored thereon with computer program.The computer can
Reading storage medium can be the memory 20 in the O&M terminal of Fig. 1, be also possible to as ROM (Read-Only Memory, it is read-only
Memory)/RAM (Random Access Memory, random access memory), magnetic disk, at least one of CD, the meter
Calculation machine readable storage medium storing program for executing includes that some instructions are used so that a terminal device with processor (can be mobile phone, calculate
Machine, server or network equipment etc.) execute method described in each embodiment of the present invention.
It should be noted that, in this document, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that the process, method, article or the server-side that include a series of elements not only include those elements,
It but also including other elements that are not explicitly listed, or further include for this process, method, article or server-side institute
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that wrapping
Include in process, method, article or the server-side of the element that there is also other identical elements.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of automatic expansion method of block chain node, which comprises the following steps:
Obtain the disk residual capacity delta data of block chain interior joint；
According to the disk residual capacity delta data, the corresponding disk size anticipation function of the node is obtained, and according to institute
State the disk remaining capacity value that disk size anticipation function obtains the node after preset time；
Disk target capacity of expansion is determined according to the disk remaining capacity value of node described after preset time, according to the disk
Target capacity of expansion carries out dilatation to the node.
2. the automatic expansion method of block chain node as described in claim 1, which is characterized in that the disk residual capacity becomes
Changing data includes time point and corresponding remaining capacity value；
It is described according to the disk residual capacity delta data, the step of obtaining the node corresponding disk size anticipation function
Include:
A start time point is chosen from all time points of the disk residual capacity delta data, by the initial time
Point before all time points and corresponding remaining capacity value be used as training data, by after the start time point sometimes
Between point and corresponding remaining capacity value as sample data；
The training data is input in default arithmetic unit and carries out recurrence, it is relevant to obtain time point and remaining capacity value
Reference prediction function；
The reference prediction function is iterated by the sample data, with the base when completing iteration after completing iteration
Quasi- anticipation function is as the corresponding disk size anticipation function of the node.
3. the automatic expansion method of block chain node as claimed in claim 2, which is characterized in that described to pass through the sample number
Include: according to the step of being iterated to the reference prediction function
Utilize the corresponding prediction residual capacity of node described in any time point in reference prediction function calculating sample data
Value；
Real surplus capability value corresponding to time point when calculating prediction remaining capacity value is obtained from sample data, and by institute
It states prediction remaining capacity value and the real surplus capability value is compared, to obtain residual capacity error；
Judge whether the residual capacity error meets default stopping criterion for iteration；
When the residual capacity error meets default stopping criterion for iteration, iteration ends；
When the residual capacity error does not meet default stopping criterion for iteration, according to base described in the residual capacity error update
Quasi- anticipation function.
4. the automatic expansion method of block chain node as claimed in claim 3, which is characterized in that the judgement remaining appearance
Measure that the step of whether error meets default stopping criterion for iteration includes:
Judge whether the residual capacity error is less than preset threshold；
When the residual capacity error is less than preset threshold, determine that the residual capacity error meets default iteration ends item
Part；
When the residual capacity error is greater than or equal to preset threshold, determine that the residual capacity error does not meet default iteration
Termination condition.
5. the automatic expansion method of block chain node as described in claim 1, which is characterized in that it is described according to preset time after
The disk remaining capacity value of the node determines that the step of disk target capacity of expansion includes:
Whether the disk remaining capacity value α after judging preset time is less than preset capacity setting value δ；
When disk remaining capacity value α after preset time is less than preset capacity setting value δ, obtain the node works as front disk
Remaining capacity value β, and by the node when front disk remaining capacity value β, preset capacity setting value δ and the preset time after
Disk remaining capacity value α is input to the disk target dilatation appearance that the node is obtained in the arithmetic unit including formula γ=β+δ-α
Measure γ.
6. the automatic expansion method of block chain node as claimed in claim 5, which is characterized in that after the judgement preset time
Disk remaining capacity value α the step of whether being less than preset capacity setting value δ after, further includes:
When disk remaining capacity value α after preset time is greater than or equal to preset capacity setting value δ, by the magnetic after preset time
Disk target capacity of expansion γ of the disk remaining capacity value α as the node.
7. the automatic expansion method of block chain node as claimed in any one of claims 1 to 6, which is characterized in that the basis is pre-
After if the disk remaining capacity value of the node determines the step of disk target capacity of expansion after the time, further includes:
Judge the total surplus capacity of hard disk where whether the disk target capacity of expansion of the node is greater than the node；
Where the disk target capacity of expansion of the node is greater than the node when total surplus capacity of disk, issues hard disk and hold
Measure insufficient prompt information；
Where the disk target capacity of expansion of the node is less than or equal to the node when total surplus capacity of disk, execute
The step of dilatation is carried out to the node according to the disk target capacity of expansion.
8. a kind of automatic flash chamber of block chain node, which is characterized in that described device includes:
Module is obtained, for obtaining the disk residual capacity delta data of block chain interior joint；
The acquisition module is also used to obtain the corresponding disk of the node according to the disk residual capacity delta data and hold
Anticipation function is measured, and obtains the disk remaining capacity value of the node after preset time according to the disk size anticipation function；
Dilatation module, for determining disk target capacity of expansion according to the disk remaining capacity value of node described after preset time,
To carry out dilatation to the node according to the disk target capacity of expansion.
9. a kind of O&M terminal, which is characterized in that the O&M terminal includes: communication module, memory, processor and is stored in
On the memory and the computer program that can run on the processor, the computer program are executed by the processor
The step of automatic expansion method of Shi Shixian block chain node as described in any one of claim 1 to 7.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program, the block chain node as described in any one of claims 1 to 7 is realized when the computer program is executed by processor
The step of automatic expansion method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910532942.7A CN110377228A (en) | 2019-06-19 | 2019-06-19 | Automatic expansion method, device, O&M terminal and the storage medium of block chain node |
| PCT/CN2019/120904 WO2020253111A1 (en) | 2019-06-19 | 2019-11-26 | Automatic expansion method and apparatus for blockchain node, and operation and maintenance terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910532942.7A CN110377228A (en) | 2019-06-19 | 2019-06-19 | Automatic expansion method, device, O&M terminal and the storage medium of block chain node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110377228A true CN110377228A (en) | 2019-10-25 |
Family
ID=68248977
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910532942.7A Pending CN110377228A (en) | 2019-06-19 | 2019-06-19 | Automatic expansion method, device, O&M terminal and the storage medium of block chain node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110377228A (en) |
| WO (1) | WO2020253111A1 (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111258506A (en) * | 2020-02-07 | 2020-06-09 | 汉海信息技术(上海)有限公司 | Data storage method and device |
| CN111625196A (en) * | 2020-05-26 | 2020-09-04 | 北京海益同展信息科技有限公司 | Block chain node capacity expansion method and device, computer equipment and storage medium |
| CN111625189A (en) * | 2020-05-19 | 2020-09-04 | 无锡华云数据技术服务有限公司 | Method, device, equipment and medium for detecting data rebalance state |
| CN111737361A (en) * | 2020-07-22 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Block chain processing method, device, equipment and storage medium |
| CN111984190A (en) * | 2020-07-26 | 2020-11-24 | 苏州浪潮智能科技有限公司 | Storage pool capacity expansion method and system for mass storage device |
| WO2020253111A1 (en) * | 2019-06-19 | 2020-12-24 | 深圳壹账通智能科技有限公司 | Automatic expansion method and apparatus for blockchain node, and operation and maintenance terminal and storage medium |
| CN113655965A (en) * | 2021-08-20 | 2021-11-16 | 湖北央中巨石信息技术有限公司 | Capacity expansion method of block chain network, block chain network system and block chain network operation method |
| CN115390752A (en) * | 2022-08-10 | 2022-11-25 | 中科豪联(杭州)技术有限公司 | Multi-disk cache file management method |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112988071B (en) * | 2021-03-15 | 2024-05-24 | 中国建设银行股份有限公司 | Distributed storage capacity expansion method, device, storage medium and equipment |
| CN117453662A (en) * | 2022-07-19 | 2024-01-26 | 腾讯科技（深圳）有限公司 | Transaction processing method, apparatus, electronic device, and computer-readable storage medium |
| CN117422542B (en) * | 2023-10-31 | 2024-05-28 | 苏银凯基消费金融有限公司 | System and method for storing and verifying consumption financial business based on blockchain technology |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1677934A (en) * | 2004-03-31 | 2005-10-05 | 华为技术有限公司 | Method and system for monitoring network service performance |
| CN1991778A (en) * | 2005-12-29 | 2007-07-04 | 英业达股份有限公司 | Snapshot extending system and method |
| CN103365781A (en) * | 2012-03-29 | 2013-10-23 | 国际商业机器公司 | Method and device for dynamically reconfiguring storage system |
| CN103970641A (en) * | 2014-05-15 | 2014-08-06 | 浪潮电子信息产业股份有限公司 | Equipment expansion method based on capacity prediction technology |
| CN104202435A (en) * | 2014-09-28 | 2014-12-10 | 北京奇虎科技有限公司 | Data extracting method and device |
| CN104317638A (en) * | 2014-10-17 | 2015-01-28 | 华为技术有限公司 | Application stretching management method and device |
| US20150277773A1 (en) * | 2014-03-31 | 2015-10-01 | Emc Corporation | Dynamic storage tiering |
| CN107092442A (en) * | 2017-04-24 | 2017-08-25 | 杭州宏杉科技股份有限公司 | Storage system resources distribution method and device |
| CN107480028A (en) * | 2017-07-21 | 2017-12-15 | 东软集团股份有限公司 | The acquisition methods and device of residual time length workable for disk |
| CN107832139A (en) * | 2017-09-26 | 2018-03-23 | 上海点融信息科技有限责任公司 | For the method, apparatus and system for the computing resource for managing block chain link point |
| CN109189323A (en) * | 2018-07-06 | 2019-01-11 | 华为技术有限公司 | Expansion method and equipment |
| CN109766234A (en) * | 2018-12-11 | 2019-05-17 | 国网甘肃省电力公司信息通信公司 | Disk storage capacity prediction technique based on time series models |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104866408B (en) * | 2014-02-20 | 2017-12-22 | 阿里巴巴集团控股有限公司 | The capacity prediction methods and device of a kind of application system |
| CN108845881A (en) * | 2018-05-30 | 2018-11-20 | 有米科技股份有限公司 | The method and device of server capacity dynamic adjustment |
| CN109885469B (en) * | 2019-02-27 | 2022-09-30 | 深信服科技股份有限公司 | Capacity expansion method, prediction model creation method, device, equipment and medium |
| CN110377228A (en) * | 2019-06-19 | 2019-10-25 | 深圳壹账通智能科技有限公司 | Automatic expansion method, device, O&M terminal and the storage medium of block chain node |
-
2019
- 2019-06-19 CN CN201910532942.7A patent/CN110377228A/en active Pending
- 2019-11-26 WO PCT/CN2019/120904 patent/WO2020253111A1/en active Application Filing
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1677934A (en) * | 2004-03-31 | 2005-10-05 | 华为技术有限公司 | Method and system for monitoring network service performance |
| CN1991778A (en) * | 2005-12-29 | 2007-07-04 | 英业达股份有限公司 | Snapshot extending system and method |
| CN103365781A (en) * | 2012-03-29 | 2013-10-23 | 国际商业机器公司 | Method and device for dynamically reconfiguring storage system |
| US20150277773A1 (en) * | 2014-03-31 | 2015-10-01 | Emc Corporation | Dynamic storage tiering |
| CN103970641A (en) * | 2014-05-15 | 2014-08-06 | 浪潮电子信息产业股份有限公司 | Equipment expansion method based on capacity prediction technology |
| CN104202435A (en) * | 2014-09-28 | 2014-12-10 | 北京奇虎科技有限公司 | Data extracting method and device |
| CN104317638A (en) * | 2014-10-17 | 2015-01-28 | 华为技术有限公司 | Application stretching management method and device |
| CN107092442A (en) * | 2017-04-24 | 2017-08-25 | 杭州宏杉科技股份有限公司 | Storage system resources distribution method and device |
| CN107480028A (en) * | 2017-07-21 | 2017-12-15 | 东软集团股份有限公司 | The acquisition methods and device of residual time length workable for disk |
| CN107832139A (en) * | 2017-09-26 | 2018-03-23 | 上海点融信息科技有限责任公司 | For the method, apparatus and system for the computing resource for managing block chain link point |
| CN109189323A (en) * | 2018-07-06 | 2019-01-11 | 华为技术有限公司 | Expansion method and equipment |
| CN109766234A (en) * | 2018-12-11 | 2019-05-17 | 国网甘肃省电力公司信息通信公司 | Disk storage capacity prediction technique based on time series models |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020253111A1 (en) * | 2019-06-19 | 2020-12-24 | 深圳壹账通智能科技有限公司 | Automatic expansion method and apparatus for blockchain node, and operation and maintenance terminal and storage medium |
| CN111258506A (en) * | 2020-02-07 | 2020-06-09 | 汉海信息技术(上海)有限公司 | Data storage method and device |
| CN111625189A (en) * | 2020-05-19 | 2020-09-04 | 无锡华云数据技术服务有限公司 | Method, device, equipment and medium for detecting data rebalance state |
| CN111625189B (en) * | 2020-05-19 | 2023-07-28 | 华云数据控股集团有限公司 | Method, device, equipment and medium for detecting data re-balance state |
| CN111625196A (en) * | 2020-05-26 | 2020-09-04 | 北京海益同展信息科技有限公司 | Block chain node capacity expansion method and device, computer equipment and storage medium |
| WO2021238513A1 (en) * | 2020-05-26 | 2021-12-02 | 京东数科海益信息科技有限公司 | Blockchain node capacity expansion method and apparatus, computer device, and storage medium |
| CN111737361A (en) * | 2020-07-22 | 2020-10-02 | 百度在线网络技术（北京）有限公司 | Block chain processing method, device, equipment and storage medium |
| CN111737361B (en) * | 2020-07-22 | 2021-01-15 | 百度在线网络技术（北京）有限公司 | Block chain processing method, device, equipment and storage medium |
| CN111984190A (en) * | 2020-07-26 | 2020-11-24 | 苏州浪潮智能科技有限公司 | Storage pool capacity expansion method and system for mass storage device |
| CN111984190B (en) * | 2020-07-26 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Storage pool capacity expansion method and system for mass storage device |
| CN113655965A (en) * | 2021-08-20 | 2021-11-16 | 湖北央中巨石信息技术有限公司 | Capacity expansion method of block chain network, block chain network system and block chain network operation method |
| CN115390752A (en) * | 2022-08-10 | 2022-11-25 | 中科豪联(杭州)技术有限公司 | Multi-disk cache file management method |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020253111A1 (en) | 2020-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110377228A (en) | Automatic expansion method, device, O&M terminal and the storage medium of block chain node | |
| CN108960629A (en) | Distribution method, device and the computer readable storage medium of maintenance task | |
| CN111325417B (en) | Method and device for realizing privacy protection and realizing multi-party collaborative updating of business prediction model | |
| CN107239339A (en) | System function optimization parameter determination method, system function optimization method and device | |
| CN109120451A (en) | Equipment evaluation method, equipment and computer readable storage medium based on Internet of Things | |
| CN107480059B (en) | Method and device for acquiring operation sequence, storage medium, processor and server | |
| CN107452072A (en) | BIM line modelings method and its system based on webpage | |
| CN110347582A (en) | Bury a test method and device | |
| US11409928B2 (en) | Configurable digital twin | |
| CN104021226B (en) | Prefetch the update method and device of rule | |
| CN111666393A (en) | Verification method and device of intelligent question-answering system, computer equipment and storage medium | |
| CN108613389B (en) | Water consumption analysis method and system for water heater and computer equipment | |
| CN111507541B (en) | Goods quantity prediction model construction method, goods quantity measurement device and electronic equipment | |
| CN109885774A (en) | Recommended method, device and the equipment of individualized content | |
| Özerol et al. | A parallel between regret theory and outranking methods for multicriteria decision making under imprecise information | |
| CN106815283A (en) | Data processing method, device and electronic equipment | |
| CN110058869A (en) | Mobile application method for pushing, computer readable storage medium and terminal device | |
| CN109636664A (en) | A kind of distribution system, distribution main website and its point table model update method | |
| CN111489196B (en) | Prediction method and device based on deep learning network, electronic equipment and medium | |
| CN108898648A (en) | A kind of K line chart building method, system and relevant device | |
| CN109635955A (en) | A kind of feature combination method, device and equipment | |
| CN106611005A (en) | Method and device for setting crawl time interval of crawler | |
| CN111935005A (en) | Data transmission method, device, processing equipment and medium | |
| CN109600757A (en) | Prediction technique, device, computer equipment and the storage medium of base station dilatation | |
| CN109032795A (en) | The processing method and processing device of data buffer storage, storage medium, electronic device |
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 | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20240227 |