CN110209666A - A kind of date storage method and terminal device - Google Patents
A kind of date storage method and terminal device Download PDFInfo
- Publication number
- CN110209666A CN110209666A CN201910269375.0A CN201910269375A CN110209666A CN 110209666 A CN110209666 A CN 110209666A CN 201910269375 A CN201910269375 A CN 201910269375A CN 110209666 A CN110209666 A CN 110209666A
- Authority
- CN
- China
- Prior art keywords
- storage
- data
- target data
- node
- acquisition system
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2219—Large Object storage; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2477—Temporal data queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
-
- 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
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Power Engineering (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a kind of date storage method, terminal device.Wherein, which comprises obtain target data to be stored；The memory node that the predicted access times of estimated line duration and the target data match is determined from storage network data base；The target data is stored to the memory node；The storage information of the target data is stored to each node of the storage network data base.Compared to the prior art, date storage method provided by the present application can effectively improve the safety and trackability of data storage, and have higher access efficiency.
Description
Technical field
This application involves technical field of data storage, and in particular to a kind of date storage method, terminal device.
Background technique
With the fast development of Internet technology with the arrival of big data era, the importance of data is higher and higher, accordingly
, the requirement to data storage technology is also higher and higher, particularly with data storage authenticity, non-volatibility, can not distort
Property and trackability propose increasingly higher demands.
Currently, data storage depends on data server realization, this is a kind of storage mode of height center,
After the illegal events such as distorting by hacker attacks, manager, it may be maliciously tampered without being easily noticed by the users, to give
The user of data brings serious loss.
Moreover, the node in network data base is more and more with the fast development of Network storage technology, it is a large amount of non-
Dedicated node and multimeshed network node are added in network data base under the excitation for the mechanism of being awarded, but these nodes are deposited
In biggish unstability, it is easy to happen offline situation, if may face so as to cause using the node storing data
The data of the storage problem non-readable when needing to access, influences data access efficiency.
Therefore, safety, the convenience of network data memory technology how are improved, so that it is higher to provide a kind of safety
, data storage scheme retrospective and that have higher access efficiency, it has also become urgently solve the problems, such as.
Summary of the invention
In view of the above problems, the application provides a kind of date storage method, device, terminal device and computer-readable Jie
Matter.
The application first aspect provides a kind of date storage method, comprising:
Obtain target data to be stored；
Determine that estimated line duration and the predicted access times of the target data match from storage network data base
Memory node；
The target data is stored to the memory node；
The storage information of the target data is stored to each node of the storage network data base.
In some change embodiments of the application first aspect, described determine from storage network data base expects
The memory node that line duration and the predicted access times of the target data match, comprising:
Determine that estimated line duration and the predicted access times of the target data match from storage network data base
Multiple alternate nodes；
The memory node for storing the target data is selected from the multiple alternate node using common recognition mechanism.
In some change embodiments of the application first aspect, described determine from storage network data base expects
Multiple alternate nodes that line duration and the predicted access times of the target data match, comprising:
Determine the predicted access times of target data；
Determine the estimated line duration of each node in the storage network data base；
Calculate separately the estimated line duration of each node and the matching degree of the predicted access times；
Choose the highest multiple nodes of matching degree alternately node.
It is described to calculate separately expecting for each node in some change embodiments of the application first aspect
The matching degree of line time and the predicted access times, comprising:
The estimated line duration of each node and the matching of the predicted access times are calculated separately using following formula
Degree:
Wherein,
A=x1-x0
In above formula, σ indicates matching degree, and m indicates that correction factor, a indicate the duration of predicted access times, and b indicates estimated and visits
The time is asked with it is expected that line duration is overlapped duration, c indicates predicted access times midpoint and it is expected that inclined between line duration midpoint
Shifting amount, x0And x1It respectively indicates the start time point of predicted access times and terminates time point, y0And y1It respectively indicates and expects
The start time point of line time and termination time point.
It is described to deposit the storage information of the target data in some change embodiments of the application first aspect
It stores up to each node of the storage network data base, comprising:
Generate the storage information of the target data；
Data acquisition system is generated according to the storage information；
The data acquisition system is stored to each node of the storage network data base.
In some change embodiments of the application first aspect, the storage information for generating the target data,
Include:
Generate the finger print information of the target data；
According to the node identification of the finger print information and the memory node for storing the target data, the target is generated
The storage information of data.
In some change embodiments of the application first aspect, the finger print information for generating the target data,
Include:
Obtain the Data Identification of the target data；And
The summary info of the target data is generated using Message Digest 5；
The finger print information of the target data is generated according to the Data Identification and the summary info.
It is described that data set is generated according to the storage information in some change embodiments of the application first aspect
It closes, comprising:
According to the Data Identification or summary info of the target data, in the storage network data base described in lookup
The historical storage data acquisition system of target data；
Generate the summary info of the historical storage data acquisition system；
According to the summary info of the storage information and the historical storage data acquisition system, storing data collection is generated.
It is described that data set is generated according to the storage information in some change embodiments of the application first aspect
It closes, comprising:
The corresponding data acquisition system of upper primary storage event is searched in the storage network data base；
Generate the summary info of the corresponding data acquisition system of the last storage event；
According to the summary info of the storage information and the corresponding data acquisition system of the last storage event, generation is deposited
Store up data set.
The application second aspect provides a kind of data storage device, comprising:
Target data obtains module, for obtaining target data to be stored；
Memory node determining module, for determining estimated line duration and the number of targets from storage network data base
According to the memory node that matches of predicted access times；
Target data memory module, for storing the target data to the memory node；
Information distribution module is stored, for storing the storage information of the target data to the storage network data
Each node in library.
In some change embodiments of the application second aspect, the memory node determining module, comprising:
Alternate node determination unit, for determining estimated line duration and the number of targets from storage network data base
According to multiple alternate nodes for matching of predicted access times；
Memory node determination unit, for being selected from the multiple alternate node for storing using common recognition mechanism
State the memory node of target data.
In some change embodiments of the application second aspect, the alternate node determination unit, comprising:
Access time determines subelement, for determining the predicted access times of target data；
Line duration determines subelement, for determining when expecting online of each node in the storage network data base
Between；
Matching degree computation subunit, the estimated line duration for calculating separately each node expect access with described
The matching degree of time；
Alternate node chooses subelement, for choosing the highest multiple nodes of matching degree alternately node.
In some change embodiments of the application second aspect, the matching degree computation subunit, specifically use with
Lower formula calculates separately the estimated line duration of each node and the matching degree of the predicted access times:
Wherein,
A=x1-x0
In above formula, σ indicates matching degree, and m indicates that correction factor, a indicate the duration of predicted access times, and b indicates estimated and visits
The time is asked with it is expected that line duration is overlapped duration, c indicates predicted access times midpoint and it is expected that inclined between line duration midpoint
Shifting amount, x0And x1It respectively indicates the start time point of predicted access times and terminates time point, y0And y1It respectively indicates and expects
The start time point of line time and termination time point.
In some change embodiments of the application second aspect, the storage information distribution module, comprising:
Information generating unit is stored, for generating the storage information of the target data；
Data acquisition system generation unit, for generating data acquisition system according to the storage information；
Data acquisition system storage unit, for storing the data acquisition system to each section of the storage network data base
Point.
In some change embodiments of the application second aspect, the storage information generating unit, comprising:
Fingerprint generates subelement, for generating the finger print information of the target data；
It stores information and generates subelement, for the memory node according to the finger print information and the storage target data
Node identification, generate the storage information of the target data.
In some change embodiments of the application second aspect, the fingerprint generates subelement, comprising:
Data Identification obtains subelement, for obtaining the Data Identification of the target data；And
Summary info generates subelement, for generating the summary info of the target data using Message Digest 5；
Finger print information generates subelement, for generating the number of targets according to the Data Identification and the summary info
According to finger print information.
In some change embodiments of the application second aspect, the data acquisition system generation unit, comprising:
History data set inquires subelement, for the Data Identification or summary info according to the target data, described
The historical storage data acquisition system of the target data is searched in storage network data base；
Historical data set abstracts subelement, for generating the summary info of the historical storage data acquisition system；
The first data set generation subelement, for being plucked according to the storage information and the historical storage data acquisition system
Information is wanted, storing data collection is generated.
In some change embodiments of the application second aspect, the data acquisition system generation unit, comprising:
Formerly storage inquiry subelement, it is corresponding for searching upper primary storage event in the storage network data base
Data acquisition system；
Formerly storage abstract subelement, for generating the abstract letter of the corresponding data acquisition system of the last storage event
Breath；
First data set generation subelement, for corresponding according to the storage information and the last storage event
The summary info of data acquisition system generates storing data collection.
The application third aspect provides a kind of terminal device, comprising: memory, processor and is stored in the memory
Computer program that is upper and can running on the processor, the processor execute this Shen when running the computer program
It please method described in first aspect.
The application fourth aspect provides a kind of computer-readable medium, is stored thereon with computer-readable instruction, the meter
Calculation machine readable instruction can be executed by processor method described in the application first aspect.
The date storage method that the application first aspect provides, comprising: obtain target data to be stored；From storage net
The memory node that the predicted access times of estimated line duration and the target data match is determined in network database；By institute
Target data is stated to store to the memory node；The storage information of the target data is stored to the storage network data
Each node in library.Compared to the prior art, date storage method provided by the present application, it is only necessary to by target data store to
It stores on the memory node in network data base, then stores the storage information of the target data to the storage network
Each node of database, so that each node of the storage network data base becomes the witness of the target data true and false
Node, due to the storage information can not be deleted or be distorted easily, so as to ensure target data trackability and
Authenticity.In addition, the application embodiment be sufficiently contemplated when selecting memory node the predicted access times of target data with
The problem of estimated line duration of memory node matches, so as to effectively avoid leading to data because memory node is offline
Inaccessible situation, it is ensured that data access efficiency.To sum up, the date storage method that the application first aspect provides can be with
The safety and trackability of data storage are effectively improved, and has higher access efficiency.
The terminal device and fourth aspect of data storage device, third aspect offer that the application second aspect provides
The computer-readable medium of offer, the date storage method provided with above-mentioned first aspect have for identical inventive concept
Identical beneficial effect.
Detailed description of the invention
By reading the following detailed description of the preferred embodiment, various other advantages and benefits are general for this field
Logical technical staff will become clear.The drawings are only for the purpose of illustrating a preferred embodiment, and is not considered as to this Shen
Limitation please.And throughout the drawings, the same reference numbers will be used to refer to the same parts.In the accompanying drawings:
Fig. 1 shows a kind of flow chart of date storage method provided by the application embodiment；
Fig. 2 shows a kind of schematic diagrames of data storage device provided by the application embodiment；
Fig. 3 shows a kind of schematic diagram of terminal device provided by the application embodiment；
Fig. 4 shows a kind of schematic diagram of computer-readable medium provided by the application embodiment.
Specific embodiment
The illustrative embodiments of the disclosure are more fully described below with reference to accompanying drawings.Although showing this in attached drawing
Disclosed illustrative embodiments, it being understood, however, that may be realized in various forms the disclosure without that should be illustrated here
Embodiment is limited.It is to be able to thoroughly understand the disclosure on the contrary, providing these embodiments, and can incite somebody to action
The scope of the present disclosure is fully disclosed to those skilled in the art.
It should be noted that unless otherwise indicated, technical term or scientific term used in this application should be this Shen
It please the ordinary meaning that is understood of one of ordinary skill in the art.
Referenced herein " embodiment " is it is meant that a particular feature, structure, or characteristic described can wrap in conjunction with the embodiments
It is contained at least one embodiment of the application.The phrase, which occurs, in each position in the description might not each mean phase
Same embodiment, nor the independent or alternative embodiment with other embodiments mutual exclusion.Those skilled in the art are explicitly
Implicitly understand, embodiment described herein can be combined with other embodiments.
The application embodiment provides a kind of date storage method, device, terminal device and computer-readable medium.
Embodiments herein is illustrated with reference to the accompanying drawing.
Referring to FIG. 1, it illustrates a kind of flow chart of date storage method provided by the application embodiment, institute
State date storage method, comprising the following steps:
Step S101: target data to be stored is obtained.
Step S102: the estimated access of estimated line duration and the target data is determined from storage network data base
The memory node that time matches.
In the embodiment of the present application, in the storage network data base, target data be can store in the storage network
Any one or more nodes of database, the node for storing the target data can temporarily be known as memory node, simultaneously
The storage information of the target data can then be stored in each node of the storage network data base, increase without will lead to
Network transmission expense and the problems such as improve each node storage capacity demand, provides that a kind of safety is higher, retrospective data
Storage scheme.
In some embodiments, described to determine estimated line duration and the number of targets from storage network data base
According to the memory node that matches of predicted access times, may include:
Determine that estimated line duration and the predicted access times of the target data match from storage network data base
Multiple alternate nodes；
The memory node for storing the target data is selected from the multiple alternate node using common recognition mechanism.
Wherein, the common recognition mechanism can be used any common recognition algorithm in the prior art and realize that the application does not limit
It is fixed.
By above embodiment, multiple alternate nodes of time match can be first selected, then recycle common recognition mechanism
Memory node is selected from the multiple alternate node, so as to reduce the number of nodes for participating in common recognition, is improved efficiency.
In some embodiments, described to determine estimated line duration and the number of targets from storage network data base
According to multiple alternate nodes for matching of predicted access times, may include:
Determine the predicted access times of target data；
Determine the estimated line duration of each node in the storage network data base；
Calculate separately the estimated line duration of each node and the matching degree of the predicted access times；
Choose the highest multiple nodes of matching degree alternately node.
Wherein, the predicted access times of the target data can be according to the attribute information and history of the target data
It accesses data etc. to determine, such as target data is the office data of certain company, then its predicted access times is then workaday
Working time, such, no longer citing repeats the present embodiment one by one.
The estimated line duration of each node can attribute information, history online data according to each node
With use planning etc. to determine, for example, Mr. Yu's multimeshed network node (can be participated in the node of multiple network data bases, but be needed
Switch between each network data base by regulation), the estimated line duration of this storage network data base can be according to pre-
Switching law, switching time for first setting etc. determine；For another example, described in the attribute information of certain nodes its it is online when
Between, the estimated line duration can be directly determined accordingly；For another example, system can also be passed through according to the history online data of node
The estimated line duration for determining the node is counted, the embodiment of the present application no longer repeats one by one, should all be in the protection scope of the application
Within
In some embodiments, the estimated line duration for calculating separately each node and the estimated access
The matching degree of time may include:
The estimated line duration of each node and the matching of the predicted access times are calculated separately using following formula
Degree:
Wherein,
A=x1-x0
In above formula, σ indicates matching degree, and m indicates that correction factor, a indicate the duration of predicted access times, and b indicates estimated and visits
The time is asked with it is expected that line duration is overlapped duration, c indicates predicted access times midpoint and it is expected that inclined between line duration midpoint
Shifting amount, x0And x1It respectively indicates the start time point of predicted access times and terminates time point, y0And y1It respectively indicates and expects
The start time point of line time and termination time point.
By above embodiment, the estimated line duration of node and the estimated visit of target data can be effectively determined
Ask the matching degree of time, matching degree is higher, and above-mentioned estimated line duration and the predicted access times are more overlapped, and selects in this way
After the higher node of matching degree come is further defined as memory node, when accessing the target data, the memory node is online
Probability also can be higher, thus the problem for effectively avoiding data non-readable.And due to the correction factor m of introducing, the amendment system
Number has fully considered that the factor that estimated line duration and the predicted access times are offset from one another influences, so that the matching selected
Higher node is spent, not only estimated line duration and the predicted access times registration of the target data are higher, and the two
Duration also differs smaller, realizes more accurate matching, so that node is not necessarily chosen as line duration is very long
Alternate node solves the problems, such as that the time match degree of long-term online node and all data is all higher, and causes in turn
All data be likely to be stored in the probability of long-term online node, realize the data storage of precision, differentiation.
Step S103: the target data is stored to the memory node.
Step S104: the storage information of the target data is stored to each node of the storage network data base.
In some embodiments, described to store the storage information of the target data to the storage network data
Each node in library may include:
Generate the storage information of the target data；
Data acquisition system is generated according to the storage information；
The data acquisition system is stored to each node of the storage network data base.
Above-described embodiment can be realized using network data memory technology, for example, generating data set according to storage information
It closes, the data acquisition system can be the data acquisition system for being contained in the link information of other data acquisition systems, thus by each data set
Conjunction is chained up the large data sets to form distributed storage, it is ensured that the storage information after storing can not tamper and can
Retrospective.
In some embodiments, the storage information for generating the target data may include:
Generate the finger print information of the target data；
According to the node identification of the finger print information and the memory node for storing the target data, the target is generated
The storage information of data.
Wherein, in some embodiments, the finger print information for generating the target data may include:
Obtain the Data Identification of the target data；And
The summary info of the target data is generated using Message Digest 5；
The finger print information of the target data is generated according to the Data Identification and the summary info.
Wherein, the finger print information of the target data can be generated using message digest algorithm such as MD5 algorithm etc., this
Apply for embodiment without limitation.Due to needing that data acquisition system is stored or backed up in each node, it is unsuitable for logarithm
It carries out according to the target data for measuring larger (for example, its data volume of the data of MB, GB above data size is larger) in storage network number
It is stored according to each node in library, to solve the above-mentioned problems, in the embodiment of the present application, target data is stored to network
In at least one memory node in database, the storage information of target data is then subjected to distributed storage, due to described
The size of finger print information can be far smaller than the size of target data, therefore the size of the storage information may insure to institute
It states storage information and carries out distributed storage, due to containing the finger print information of the target data in the storage information,
The storage information can be efficiently used for recognizing the true and false of target data, so that it is guaranteed that the target data is true
Reality and trackability.
To sum up, by above embodiment, it can use the finger print information using lesser data volume and realize distribution
Storage and to the witness of target data authenticity.
In some embodiments, described that data acquisition system is generated according to the storage information, may include:
According to the Data Identification or summary info of the target data, in the storage network data base described in lookup
The historical storage data acquisition system of target data；
Generate the summary info of the historical storage data acquisition system；
According to the summary info of the storage information and the historical storage data acquisition system, storing data collection is generated.
The historical storage number of the target data is inquired first when generating storing data collection by above embodiment
According to set, storing data collection then is generated using the summary info of the storage information and the historical storage data acquisition system, from
And be associated the current version of target data with old version, the large data sets of distributed storage are formed, are realized to target
The retrospect of the modification history of data.
In some embodiments, described that data acquisition system is generated according to the storage information, may include:
The corresponding data acquisition system of upper primary storage event is searched in the storage network data base；
Generate the summary info of the corresponding data acquisition system of the last storage event；
According to the summary info of the storage information and the corresponding data acquisition system of the last storage event, generation is deposited
Store up data set.
By above embodiment, when generating storing data collection, inquired upper one in the storage network data base first
Then the corresponding data acquisition system of secondary storage event utilizes the storage information and the corresponding data of the last time storage event
The summary info of set generates storing data collection, thus by the storage of each storage event in the storage network data base
Information association is got up, and the large data sets of distributed storage are formed, so that it is guaranteed that the storage information tamper and can not can chase after
Tracing back property, due to the storage information be for being recognized or being witnessed to target data, may further ensure that institute
State the trackability of target data.
Compared to the prior art, date storage method provided by the present application, it is only necessary to store target data to storage net
On memory node in network database, then the storage information of the target data is stored to the storage network data base
Each node so that it is described storage network data base each node become the target data true and false witness node, by
It can not be deleted or be distorted easily in the storage information, so as to ensure the trackability and authenticity of target data.
In addition, the predicted access times of target data are sufficiently contemplated when selecting memory node for the application embodiment and storage saves
The problem of estimated line duration of point matches, so as to effectively avoid causing data that can not visit because memory node is offline
The case where asking, it is ensured that data access efficiency.To sum up, date storage method provided by the embodiments of the present application can effectively improve
The safety and trackability of data storage, and have higher access efficiency.
The application also provides a kind of data storage device.The device may include having used herein described data
The system (including distributed system) of storage method, software (application), module, component, server, client, quantum computer
Deng and combine it is necessary implement hardware device.Device based on same innovation thinking, in a kind of embodiment provided by the present application
As described in the following examples.Since the implementation that device solves the problems, such as is similar to method, the specific device of the application
Implementation may refer to the implementation of preceding method, overlaps will not be repeated.It is used below, term " unit " or " mould
The combination of the software and/or hardware of predetermined function may be implemented in block ".Although device described in following embodiment preferably with
Software is realized, but the realization of the combination of hardware or software and hardware is also that may and be contemplated.
Specifically, Fig. 2 is a kind of modular structure schematic diagram of data storage device embodiment provided by the present application, such as Fig. 2
Shown, the data storage device 10 may include:
Target data obtains module 101, for obtaining target data to be stored；
Memory node determining module 102, for determining estimated line duration and the target from storage network data base
The memory node that the predicted access times of data match；
Target data memory module 103, for storing the target data to the memory node；
Information distribution module 104 is stored, for storing the storage information of the target data to the storage network number
According to each node in library.
In some change embodiments of the embodiment of the present application, the memory node determining module 102, comprising:
Alternate node determination unit, for determining estimated line duration and the number of targets from storage network data base
According to multiple alternate nodes for matching of predicted access times；
Memory node determination unit, for being selected from the multiple alternate node for storing using common recognition mechanism
State the memory node of target data.
In some change embodiments of the embodiment of the present application, the alternate node determination unit, comprising:
Access time determines subelement, for determining the predicted access times of target data；
Line duration determines subelement, for determining when expecting online of each node in the storage network data base
Between；
Matching degree computation subunit, the estimated line duration for calculating separately each node expect access with described
The matching degree of time；
Alternate node chooses subelement, for choosing the highest multiple nodes of matching degree alternately node.
In some change embodiments of the embodiment of the present application, the matching degree computation subunit, specifically using following
Formula calculates separately the estimated line duration of each node and the matching degree of the predicted access times:
Wherein,
A=x1-x0
In above formula, σ indicates matching degree, and m indicates that correction factor, a indicate the duration of predicted access times, and b indicates estimated and visits
The time is asked with it is expected that line duration is overlapped duration, c indicates predicted access times midpoint and it is expected that inclined between line duration midpoint
Shifting amount, x0And x1It respectively indicates the start time point of predicted access times and terminates time point, y0And y1It respectively indicates and expects
The start time point of line time and termination time point.
In some change embodiments of the embodiment of the present application, the storage information distribution module 104, comprising:
Information generating unit is stored, for generating the storage information of the target data；
Data acquisition system generation unit, for generating data acquisition system according to the storage information；
Data acquisition system storage unit, for storing the data acquisition system to each section of the storage network data base
Point.
In some change embodiments of the embodiment of the present application, the storage information generating unit, comprising:
Fingerprint generates subelement, for generating the finger print information of the target data；
It stores information and generates subelement, for the memory node according to the finger print information and the storage target data
Node identification, generate the storage information of the target data.
In some change embodiments of the embodiment of the present application, the fingerprint generates subelement, comprising:
Data Identification obtains subelement, for obtaining the Data Identification of the target data；And
Summary info generates subelement, for generating the summary info of the target data using Message Digest 5；
Finger print information generates subelement, for generating the number of targets according to the Data Identification and the summary info
According to finger print information.
In some change embodiments of the embodiment of the present application, the data acquisition system generation unit, comprising:
History data set inquires subelement, for the Data Identification or summary info according to the target data, described
The historical storage data acquisition system of the target data is searched in storage network data base；
Historical data set abstracts subelement, for generating the summary info of the historical storage data acquisition system；
The first data set generation subelement, for being plucked according to the storage information and the historical storage data acquisition system
Information is wanted, storing data collection is generated.
In some change embodiments of the embodiment of the present application, the data acquisition system generation unit, comprising:
Formerly storage inquiry subelement, it is corresponding for searching upper primary storage event in the storage network data base
Data acquisition system；
Formerly storage abstract subelement, for generating the abstract letter of the corresponding data acquisition system of the last storage event
Breath；
First data set generation subelement, for corresponding according to the storage information and the last storage event
The summary info of data acquisition system generates storing data collection.
In some change embodiments of the embodiment of the present application, the target data memory module 102, comprising:
Multinode storage unit, for the target data to be stored to multiple storage sections into storage network data base
Point.
Data storage device 10 provided by the embodiments of the present application, the data storage side provided with the application previous embodiment
Method is for identical inventive concept, beneficial effect having the same.
In the above-described embodiment, a kind of date storage method and device are provided, corresponding, the application is also
A kind of terminal device is provided, the terminal device can be arbitrary the electronic equipment with store function, and can be used as and deposit
The node in network data base is stored up, for example, server, server cluster, desktop computer, laptop, smart phone
Deng.Referring to FIG. 3, Fig. 3 is a kind of schematic diagram of terminal device provided by the embodiments of the present application.As shown in figure 3, the terminal
Equipment 20 includes: processor 200, memory 201, bus 202 and communication interface 203, the processor 200, communication interface
203 and memory 201 connected by bus 202；Being stored in the memory 201 can run on the processor 200
Computer program, the processor 200 executes any data storage side provided by the present application when running the computer program
Method.
Wherein, memory 201 may include high-speed random access memory (RAM:Random Access Memory),
It may further include non-labile memory (non-volatile memory), for example, at least a magnetic disk storage.Pass through
At least one communication interface 203 (can be wired or wireless) is realized between the system network element and at least one other network element
Communication connection, internet, wide area network, local network, Metropolitan Area Network (MAN) etc. can be used.
Bus 202 can be isa bus, pci bus or eisa bus etc..The bus can be divided into address bus, number
According to bus, control bus etc..Wherein, memory 201 is for storing program, and the processor 200 is executed instruction receiving
Afterwards, described program is executed, the date storage method that aforementioned the embodiment of the present application any embodiment discloses can be applied to
In processor 200, or realized by processor 200.
Processor 200 may be a kind of IC chip, the processing capacity with signal.It is above-mentioned during realization
Each step of method can be completed by the integrated logic circuit of the hardware in processor 200 or the instruction of software form.On
The processor 200 stated can be general processor, including central processing unit (Central Processing Unit, abbreviation
CPU), network processing unit (Network Processor, abbreviation NP) etc.；It can also be digital signal processor (DSP), dedicated
Integrated circuit (ASIC), ready-made programmable gate array (FPGA) either other programmable logic device, discrete gate or transistor
Logical device, discrete hardware components.It may be implemented or execute the disclosed each method in the embodiment of the present application, step and patrol
Collect block diagram.General processor can be microprocessor or the processor is also possible to any conventional processor etc..In conjunction with
The step of method disclosed in the embodiment of the present application, can be embodied directly in hardware decoding processor and execute completion, or with translating
Hardware and software module combination in code processor execute completion.Software module can be located at random access memory, flash memory, read-only
The storage medium of this fields such as memory, programmable read only memory or electrically erasable programmable memory, register maturation
In.The storage medium is located at memory 201, and processor 200 reads the information in memory 201, completes in conjunction with its hardware above-mentioned
The step of method.
Terminal device provided by the embodiments of the present application is with date storage method provided by the embodiments of the present application for identical
Inventive concept, beneficial effect having the same.
The embodiment of the present application also provides a kind of computer-readable medium corresponding with above-mentioned date storage method, please join
Fig. 4 is examined, the computer readable storage medium shown is CD 30, is stored thereon with computer program (i.e. program product), institute
Computer program is stated when being run by processor, date storage method provided by aforementioned any embodiment can be executed.
It should be noted that the example of the computer readable storage medium can also include, but are not limited to phase change memory
(PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other kinds of arbitrary access
Memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or its
His optics, magnetic-based storage media, this is no longer going to repeat them.
Computer readable storage medium provided by the embodiments of the present application and data provided by the embodiments of the present application store for
Identical inventive concept, beneficial effect having the same.
It should be noted that the flow chart and block diagram in the drawings show according to the systems of multiple embodiments of the application,
The architecture, function and operation in the cards of method and computer program product.In this regard, in flowchart or block diagram
Each box can represent a part of a module, section or code, one of the module, section or code
Subpackage is containing one or more executable instructions for implementing the specified logical function.It should also be noted that at some as replacement
Realization in, function marked in the box can also occur in a different order than that indicated in the drawings.For example, two companies
Continuous box can actually be basically executed in parallel, they can also be executed in the opposite order sometimes, this is according to related
Depending on function.It is also noted that each box in block diagram and or flow chart and the side in block diagram and or flow chart
The combination of frame can be realized with the dedicated hardware based system for executing defined function or movement, or can be used
The combination of specialized hardware and computer instruction is realized.
It is apparent to those skilled in the art that for convenience and simplicity of description, foregoing description is
The specific work process of system, device and unit, can refer to corresponding processes in the foregoing method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through
Other modes are realized.The apparatus embodiments described above are merely exemplary, for example, the division of the unit, only
For a kind of logical function partition, there may be another division manner in actual implementation, in another example, multiple units or components can be with
In conjunction with or be desirably integrated into another system, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be through some communication interfaces, device or unit it is indirect
Coupling or communication connection can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, as unit
The component of display may or may not be physical unit, it can and it is in one place, or may be distributed over more
In a network unit.Some or all of unit therein can be selected to realize this embodiment scheme according to the actual needs
Purpose.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
It, can if the function is realized in the form of SFU software functional unit and when sold or used as an independent product
To be stored in a computer readable storage medium.Based on this understanding, the technical solution of the application substantially or
Say that the part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products,
The computer software product is stored in a storage medium, including some instructions are used so that computer equipment (can be with
Personal computer, server or the network equipment etc.) execute each embodiment the method for the application all or part
Step.And storage medium above-mentioned include: U disk, it is mobile hard disk, read-only memory (ROM, Read-Only Memory), random
Access various Jie that can store program code such as memory (RAM, Random Access Memory), magnetic or disk
Matter.
Finally, it should be noted that the above various embodiments is only to illustrate the technical solution of the application, rather than its limitations；
Although the application is described in detail referring to foregoing embodiments, those skilled in the art should understand that: its
It is still possible to modify the technical solutions described in the foregoing embodiments, or special to some or all of technologies
Sign is equivalently replaced；And these are modified or replaceed, each embodiment of the application that it does not separate the essence of the corresponding technical solution
The range of technical solution should all cover in claims hereof and the range of specification.
Claims (10)
1. a kind of date storage method characterized by comprising
Obtain target data to be stored；
What determining estimated line duration and the predicted access times of the target data matched from storage network data base deposits
Store up node；
The target data is stored to the memory node；
The storage information of the target data is stored to each node of the storage network data base.
2. the method according to claim 1, wherein when described determining estimated online from storage network data base
Between the memory node that matches with the predicted access times of the target data, comprising:
Determining estimated line duration and the predicted access times of the target data match more from storage network data base
A alternate node；
The memory node for storing the target data is selected from the multiple alternate node using common recognition mechanism.
3. according to the method described in claim 2, it is characterized in that, when described determining estimated online from storage network data base
Between multiple alternate nodes for matching with the predicted access times of the target data, comprising:
Determine the predicted access times of target data；
Determine the estimated line duration of each node in the storage network data base；
Calculate separately the estimated line duration of each node and the matching degree of the predicted access times；
Choose the highest multiple nodes of matching degree alternately node.
4. according to the method described in claim 3, it is characterized in that, the estimated line duration for calculating separately each node
With the matching degree of the predicted access times, comprising:
The estimated line duration of each node and the matching degree of the predicted access times are calculated separately using following formula:
Wherein,
A=x1-x0
In above formula, σ indicates matching degree, and m indicates correction factor, and a indicates the duration of predicted access times, when b indicates estimated access
Between with it is expected that line duration is overlapped duration, c indicates predicted access times midpoint and it is expected that offset between line duration midpoint,
x0And x1It respectively indicates the start time point of predicted access times and terminates time point, y0And y1Respectively indicate estimated line duration
Start time point and terminate time point.
5. the method according to claim 1, wherein described store the storage information of the target data to institute
State each node of storage network data base, comprising:
Generate the storage information of the target data；
Data acquisition system is generated according to the storage information；
The data acquisition system is stored to each node of the storage network data base.
6. according to the method described in claim 5, it is characterized in that, the storage information for generating the target data, comprising:
Generate the finger print information of the target data；
According to the node identification of the finger print information and the memory node for storing the target data, the target data is generated
Store information.
7. according to the method described in claim 6, it is characterized in that, the finger print information for generating the target data, comprising:
Obtain the Data Identification of the target data；And
The summary info of the target data is generated using Message Digest 5；
The finger print information of the target data is generated according to the Data Identification and the summary info.
8. according to the method described in claim 5, it is characterized in that, described generate data acquisition system, packet according to the storage information
It includes:
According to the Data Identification or summary info of the target data, the number of targets is searched in the storage network data base
According to historical storage data acquisition system；
Generate the summary info of the historical storage data acquisition system；
According to the summary info of the storage information and the historical storage data acquisition system, storing data collection is generated.
9. according to the method described in claim 5, it is characterized in that, described generate data acquisition system, packet according to the storage information
It includes:
The corresponding data acquisition system of upper primary storage event is searched in the storage network data base；
Generate the summary info of the corresponding data acquisition system of the last storage event；
According to the summary info of the storage information and the corresponding data acquisition system of the last storage event, storing data is generated
Collection.
10. a kind of terminal device, comprising: memory, processor and be stored on the memory and can be on the processor
The computer program of operation, which is characterized in that perform claim requires 1 to 9 when the processor runs the computer program
Method described in one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910269375.0A CN110209666B (en) | 2019-04-04 | 2019-04-04 | data storage method and terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910269375.0A CN110209666B (en) | 2019-04-04 | 2019-04-04 | data storage method and terminal equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110209666A true CN110209666A (en) | 2019-09-06 |
| CN110209666B CN110209666B (en) | 2020-01-31 |
Family
ID=67785299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910269375.0A Active CN110209666B (en) | 2019-04-04 | 2019-04-04 | data storage method and terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110209666B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075582A (en) * | 2011-01-26 | 2011-05-25 | 南京财经大学 | Storage method for data storage model of credible cloud storage system |
| CN103020255A (en) * | 2012-12-21 | 2013-04-03 | 华为技术有限公司 | Hierarchical storage method and hierarchical storage device |
| CN103713852A (en) * | 2012-09-28 | 2014-04-09 | 联想(北京)有限公司 | Method for processing information, service platform and electronic devices |
| CN106055272A (en) * | 2016-05-20 | 2016-10-26 | 乐视控股（北京）有限公司 | Selection method and apparatus of storage medium |
| US20170068682A1 (en) * | 2015-09-04 | 2017-03-09 | Wal-Mart Stores, Inc. | FILE MANAGEMENT FOR eDISCOVERY |
| CN107094155A (en) * | 2017-06-14 | 2017-08-25 | 广东工业大学 | A kind of secure storage method of data and device based on alliance's block chain |
| CN108696571A (en) * | 2018-03-28 | 2018-10-23 | 深圳市网心科技有限公司 | Cloud storage service system, method, cloud service smart machine and electronic device |
-
2019
- 2019-04-04 CN CN201910269375.0A patent/CN110209666B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075582A (en) * | 2011-01-26 | 2011-05-25 | 南京财经大学 | Storage method for data storage model of credible cloud storage system |
| CN103713852A (en) * | 2012-09-28 | 2014-04-09 | 联想(北京)有限公司 | Method for processing information, service platform and electronic devices |
| CN103020255A (en) * | 2012-12-21 | 2013-04-03 | 华为技术有限公司 | Hierarchical storage method and hierarchical storage device |
| US20170068682A1 (en) * | 2015-09-04 | 2017-03-09 | Wal-Mart Stores, Inc. | FILE MANAGEMENT FOR eDISCOVERY |
| CN106055272A (en) * | 2016-05-20 | 2016-10-26 | 乐视控股（北京）有限公司 | Selection method and apparatus of storage medium |
| CN107094155A (en) * | 2017-06-14 | 2017-08-25 | 广东工业大学 | A kind of secure storage method of data and device based on alliance's block chain |
| CN108696571A (en) * | 2018-03-28 | 2018-10-23 | 深圳市网心科技有限公司 | Cloud storage service system, method, cloud service smart machine and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110209666B (en) | 2020-01-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20240169458A1 (en) | System and process for tokenization and management of liability | |
| CN110019292B (en) | Data query method and device | |
| JP6362805B1 (en) | Method for enabling access to past transactions in a blockchain network and nodes for configuring the network | |
| CN110413870A (en) | Method of Commodity Recommendation, device and server | |
| CN110263145A (en) | A kind of electronic contract signature method and electronic contract sign equipment | |
| CN113283675B (en) | Index data analysis method, device, equipment and storage medium | |
| CN109993572A (en) | Retention ratio statistical method, device, equipment and storage medium | |
| CN110020741A (en) | The method, apparatus and electronic equipment of data prediction | |
| CN105468623A (en) | Data processing method and apparatus | |
| US8510750B2 (en) | Method for caching resource representations in a contextual address space | |
| CN110275767A (en) | A kind of batch data processing method and processing device | |
| CN110209347A (en) | A kind of retrospective date storage method | |
| CN112882956A (en) | Method and device for automatically generating full-scene automatic test case through data combination calculation, storage medium and electronic equipment | |
| CN109271564A (en) | Declaration form querying method and equipment | |
| CN110109867A (en) | Improve the method, apparatus and computer program product of on-line mode detection | |
| CN110209666A (en) | A kind of date storage method and terminal device | |
| Frenk et al. | An optimal stopping approach for the end-of-life inventory problem | |
| CN110209679A (en) | A kind of date storage method for promoting access efficiency, terminal device | |
| CN116225690A (en) | Memory multidimensional database calculation load balancing method and system based on docker | |
| CN115562934A (en) | Service flow switching method based on artificial intelligence and related equipment | |
| CN114444440A (en) | Identifier generation method, device, storage medium and system | |
| CN109614386B (en) | Data processing method, device, server and computer readable storage medium | |
| CN113313492A (en) | Electronic certificate generation method and related device | |
| Cheng et al. | An efficient service discovery algorithm for counting bloom filter-based service registry | |
| CN111814029A (en) | Data query method, system and computing 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |