CN116505955B - Method for monitoring and managing health state of disk use - Google Patents
Method for monitoring and managing health state of disk use Download PDFInfo
- Publication number
- CN116505955B CN116505955B CN202310785754.1A CN202310785754A CN116505955B CN 116505955 B CN116505955 B CN 116505955B CN 202310785754 A CN202310785754 A CN 202310785754A CN 116505955 B CN116505955 B CN 116505955B
- Authority
- CN
- China
- Prior art keywords
- sequence
- applicable
- packet
- data
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000012544 monitoring process Methods 0.000 title claims abstract description 24
- 230000036541 health Effects 0.000 title abstract description 13
- 238000007906 compression Methods 0.000 claims abstract description 45
- 230000006835 compression Effects 0.000 claims abstract description 45
- 230000007717 exclusion Effects 0.000 claims abstract description 16
- 238000012545 processing Methods 0.000 claims abstract description 10
- 230000003862 health status Effects 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000009825 accumulation Methods 0.000 claims description 2
- 230000006837 decompression Effects 0.000 description 15
- 238000013144 data compression Methods 0.000 description 14
- 230000000694 effects Effects 0.000 description 9
- 238000011156 evaluation Methods 0.000 description 4
- 238000006073 displacement reaction Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3037—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a memory, e.g. virtual memory, cache
-
- 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0674—Disk device
- G06F3/0676—Magnetic disk device
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Human Computer Interaction (AREA)
- Mathematical Physics (AREA)
- Quality & Reliability (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to a method for monitoring and managing the health state of a disk, which comprises the following steps: converting the historical data sequence of the magnetic disk into a binary data sequence, dividing the binary data sequence according to the grouping length, calculating the applicability of each grouping length in the grouping length value range, obtaining the applicability maximum applicability, obtaining a Huffman code total table according to the applicability, processing the grouping sequence corresponding to the applicable grouping according to the priority exclusion degree, further obtaining a Huffman code sub table corresponding to the applicable grouping, and compressing the magnetic disk index sequence according to the Huffman code total table and the Huffman code sub tables of all the applicable groupings to obtain a compression result of the magnetic disk index sequence. The invention further improves the Huffman coding to lead the compression result of the magnetic disc index sequence to break through the entropy limit on the basis that the compression result of the magnetic disc index sequence reaches the entropy limit as much as possible, thereby reducing the influence of the history index data on the used magnetic disc.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a method for monitoring and managing the health state of a disk.
Background
By recording various indexes of the magnetic disk during operation, such as disk temperature, magnetic head vertical displacement, seek time and the like, comprehensive and accurate evaluation about the current state of the magnetic disk can be obtained, and further, the monitoring of the use health state of the magnetic disk is realized. Meanwhile, a history index database of the disk state can be established by recording various indexes for a long time, and state evaluation, early warning and optimization suggestions can be provided for the disk by comparing the history index data with current index data; therefore, the historical index data of the disk is important for monitoring and managing the usage health status of the disk.
With the increase of the use time of the disk, the data volume of the history index data of the disk is larger and larger, so that the use health state of the disk is monitored and managed according to the history index data of the disk, the use of the disk is not influenced as much as possible, the data volume of the history index data stored in the disk is required to be as small as possible, the history index data of the disk is required to be compressed, the storage space occupied by the history index data of the disk is small, and the influence of the history index data of the storage disk on the use disk is further reduced.
The Huffman coding is a common data compression method, and the data is compressed by utilizing the Huffman coding, namely if probability distribution of all kinds of data is not obeyed in a form of 2 minus n times, the result of data compression cannot reach the entropy limit, namely the compression effect of the data is not optimal; meanwhile, when the probability distribution of the data is in a form of 2 minus n power, the result of data compression reaches an entropy limit, namely the entropy limit is reached, namely the limit when the data is compressed through Huffman coding can not be improved any more; in summary, there is a limit to the compression effect of compressing data by huffman coding.
Therefore, if probability distribution of all kinds of data is made to obey a form of 2 minus n power as much as possible, the result of data compression reaches the entropy limit, and on the basis, improvement of Huffman coding makes the result of data compression break through the entropy limit, which is a key for improving the data compression effect, reducing the storage space occupied by the historical index data of the magnetic disk and further reducing the influence of the historical index data of the storage magnetic disk on the use of the magnetic disk.
Disclosure of Invention
The invention provides a method for monitoring and managing the use health state of a magnetic disk, which aims to solve the existing problems.
The invention relates to a method for monitoring and managing the use health state of a magnetic disk, which adopts the following technical scheme:
one embodiment of the present invention provides a method for monitoring and managing a health status of use of a disk, the method comprising the steps of:
recording a sequence formed by disc data in a preset time period according to sequence as a disc history data sequence, and converting the disc history data sequence into a binary data sequence;
constructing an ideal frequency sequence corresponding to each packet length, dividing the binary data sequence according to each packet length to obtain all packets corresponding to each packet length, and calculating the applicability of each packet length according to the actual frequency sequence and the ideal frequency sequence of all packets corresponding to each packet length; the packet length with the largest applicability is marked as the applicable length, a data sequence and an applicable packet sequence formed by all applicable packets are obtained according to the applicable length, and a Huffman code summary table is obtained according to the applicable packet sequence;
marking any applicable packet except the applicable packet with the largest actual frequency as a target applicable packet, and processing a packet sequence corresponding to the target applicable packet to obtain a Huffman coding sub-table of the target applicable packet, wherein the Huffman coding sub-table comprises the following steps:
K1, constructing a normal form Huffman tree according to a grouping sequence corresponding to the target applicable grouping, and obtaining a target Huffman coding table corresponding to the target applicable grouping according to the normal form Huffman tree;
k2, calculating the priority exclusion degree of each applicable packet according to the Huffman coding table and the target Huffman coding table corresponding to the target applicable packet, and removing the applicable packet with the priority exclusion degree greater than or equal to 0 and the maximum priority exclusion degree from the packet sequence corresponding to the target applicable packet;
k3, repeating the steps from K1 to K2 until the priority exclusion degree of all the applicable packets in the packet sequence corresponding to the target applicable packet is smaller than 0, and taking the target Huffman coding table constructed according to the packet sequence corresponding to the target applicable packet as a Huffman coding table corresponding to the target applicable packet;
processing the grouping sequences corresponding to all the applicable groupings to obtain Huffman coding sub-tables of all the applicable groupings;
and compressing the disk index sequence according to the Huffman coding total table and all Huffman coding sub tables applicable to grouping to obtain a compression result of the disk index sequence.
Further, the construction of the ideal frequency sequence corresponding to each packet length comprises the following specific steps:
Taking any integer in the grouping length value range as the grouping length F to obtain the length equal toThe ideal probability sequence of the length of the packet is recorded as an ideal probability sequence corresponding to the packet length F, and the last ideal probability in the ideal probability sequence is +.>The ith ideal probability in the ideal probability sequence is +.>。
Further, the dividing the binary data sequence according to each packet length to obtain all packets corresponding to each packet length, and calculating the applicability of each packet length according to the actual frequency sequence and the ideal frequency sequence of all packets corresponding to each packet length, including the following specific steps:
taking any integer in a value range of the grouping length as the grouping length F, dividing a binary data sequence into a plurality of subsequences according to the grouping length, dividing the same plurality of subsequences into a group, obtaining actual frequencies of all groups, and marking the sequence formed by arranging the actual frequencies of all groups in sequence from big to small as an actual frequency sequence corresponding to the grouping length;
the calculation formula of the applicability of the packet length F is:
in the method, in the process of the invention, Indicating the applicability of the packet length F, N indicating the number of all packets, +.>Represents the i-th actual probability in the actual frequency sequence,/->Representing the ith theory in the ideal frequency sequenceProbability of thinking, ->Representing the accumulation length.
Further, the method for obtaining the data sequence and the applicable packet sequence composed of all applicable packets according to the applicable length comprises the following specific steps:
dividing a binary data sequence into a plurality of subsequences according to the applicable length, marking each subsequence as data, marking a sequence formed by all data according to sequence as a data sequence, and marking all kinds of packets corresponding to the applicable length as applicable packets; the sequence formed by ordering all applicable packets in the order of actual frequency from big to small is recorded as the applicable packet sequence.
Further, the obtaining the huffman code summary table according to the applicable grouping sequence comprises the following specific steps:
constructing a binary tree of N layers, wherein the left nodes of all layers in the binary tree and the right nodes of the last layer are required to be leaf nodes, and other nodes in the binary tree are parent nodes, wherein N is the number of all kinds of applicable packets in the applicable packet sequence; and marking left nodes of all layers and right nodes of the last layer as target nodes, sequentially distributing each group in the applicable group sequence to each target node according to the sequence from top to bottom, distributing codes to binary trees according to the mode of left 0 and right 1, marking the obtained binary trees as normal form Huffman trees, further obtaining a Huffman coding table, and marking the Huffman coding table as a Huffman coding table.
Further, the packet sequence corresponding to the target applicable packet specifically includes:
all data belonging to the target applicable group in the data sequence are obtained and marked as target data, the next data of each target data in the data sequence is marked as target back neighbor data, all target back neighbor data are obtained, the frequency of each applicable group in all target back neighbor data is counted and marked as the target frequency of each applicable group corresponding to the target applicable group, and the sequence formed by sequencing all applicable groups according to the sequence from the large target frequency to the small target frequency is marked as the group sequence corresponding to the target applicable group.
Further, the building of the normal huffman tree according to the grouping sequence corresponding to the target applicable grouping includes the following specific steps:
constructing a T+1-layer binary tree, wherein the left nodes of all layers and the right nodes of the last layer in the binary tree are leaf nodes, and other nodes in the binary tree are father nodes, wherein T is the length of a packet sequence corresponding to a target applicable packet; and marking left nodes of all layers except the first two layers and right nodes of the last layer as target nodes, sequentially distributing each applicable packet in a packet sequence corresponding to the target applicable packet to each target node according to the sequence from top to bottom, distributing codes to binary trees according to a left 0-right 1 mode, and marking the obtained binary tree as a normal Huffman tree.
Further, the calculating the priority exclusion degree of each applicable packet includes the following specific steps:
the length of the code corresponding to each applicable packet in the Huffman code table is recorded as the first length of each applicable packet, the length of the code corresponding to each applicable packet in the target Huffman code table corresponding to the target applicable packet is recorded as the second length of each applicable packet, the difference between the second length of each applicable packet and the first length of each applicable packet after adding 1 is recorded as the increment degree of each applicable packet, and the product of the increment degree of each applicable packet and the target frequency of each applicable packet is recorded as the product of the increment degree of each applicable packet.
Further, the compressing the disk index sequence to obtain a compression result of the disk index sequence includes the following specific steps:
recording a sequence formed by all index data of the collected disk running time as a disk index sequence, coding the disk index sequence in a GB2312 coding mode to obtain a binary data sequence, dividing the binary data sequence according to an applicable length to obtain a disk data sequence, and compressing all data in the disk data sequence according to the sequence to obtain a compression result of the disk index sequence, wherein the method comprises the following steps: and recording any one data as current data, recording the previous data of the current data in the disk data sequence as front neighbor data, judging whether the current data can be compressed by using a Huffman code sub-table corresponding to the front neighbor data, if so, compressing the current data according to the Huffman code sub-table corresponding to the front neighbor data, and adding an identifier before the obtained coding result, and if not, compressing the current data according to the Huffman code summary table.
The technical scheme of the invention has the beneficial effects that: the method comprises the steps of converting a disc history data sequence into a binary data sequence, constructing the applicable degree of each grouping length through the difference of the frequencies of all the groupings corresponding to each grouping length and ideal frequencies, obtaining the applicable length of the data compression result reaching the entropy limit as far as possible, constructing a normal form Huffman total tree according to the actual frequencies of all the groupings, obtaining the target frequency of each grouping corresponding to the target grouping through the target adjacent data of the target data, constructing a normal form Huffman tree according to the target frequency sequence corresponding to the target grouping, judging the length of the encoding result of each grouping in the normal form Huffman total tree, reserving the grouping of the encoding result in the normal form Huffman total tree, further encoding the reserved data according to the normal form Huffman total tree, enabling the data of the disc sequence to reach the compression result of the disc according to the target frequency sequence of each grouping corresponding to the target data, further reducing the entropy index of the target data of the target sequence, and further reducing the compression result of the disc, and further reducing the influence of the data of the disc history data.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart illustrating steps of a method for monitoring and managing health status of a disk according to the present invention;
fig. 2 is a canonical huffman tree constructed from an applicable grouping sequence;
fig. 3 is a table of huffman codes;
fig. 4 is a canonical huffman tree constructed from a sequence of packets corresponding to applicable packets 111;
fig. 5 shows a huffman coding sub-table corresponding to the applicable group 111;
fig. 6 is a canonical huffman tree constructed from a sequence of packets corresponding to applicable packet 100;
fig. 7 shows a huffman coding table corresponding to the applicable packet 100.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following detailed description refers to the specific implementation, structure, characteristics and effects of a method for monitoring and managing the health status of a magnetic disk according to the present invention, with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of a method for monitoring and managing the health status of a magnetic disk according to the present invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating a method for monitoring and managing a health status of a disk according to an embodiment of the invention is shown, the method includes the following steps:
s001, obtaining a disk history data sequence, and converting the disk history data sequence into a binary data sequence.
It should be noted that, by recording various indexes of the magnetic disk during operation, such as the disk temperature, the vertical displacement of the magnetic head, the seek time, etc., a comprehensive and accurate assessment about the current state of the magnetic disk can be obtained, thereby realizing the monitoring of the use health state of the magnetic disk. Meanwhile, by recording various indexes for a long time, a historical index database of the disk state can be established, and by comparing the historical index data with the current index data, state evaluation, early warning and optimization suggestions can be provided for the disk, comprising the following steps: by comparing the historical data with the current data, whether the disk has an abnormal state or not can be found, and when the early warning condition and the alarm condition are reached, an administrator can be reminded to process and maintain at the first time, and early warning and alarm are provided for the disk; through analysis of historical data, the overall utilization rate, service life and other conditions of the magnetic disk can be obtained, and more accurate health state evaluation can be performed; by analyzing the historical data, deeper understanding of disk operation can be obtained, and suggestions such as workload or storage optimization, disk number expansion or training schemes are further provided. Therefore, the historical index data of the disk is important for monitoring and managing the use health state of the disk, and a historical index database of the disk needs to be established.
It should be further noted that, as the service time of the disk increases, the data amount of the history index data of the disk is larger and larger, so that, in order to monitor and manage the service health state of the disk according to the history index data of the disk, the use of the disk is not affected as much as possible, the data amount of the history index data stored in the disk needs to be as small as possible, which requires compressing the history index data of the disk, and reduces the storage space occupied by the history index data of the disk, thereby reducing the influence of using the disk. According to the embodiment, the Huffman coding is improved, so that the compression efficiency of the Huffman coding is improved, and the data volume after the data is compressed by the Huffman coding is reduced, so that more data can be temporarily stored in the buffer. The disk data includes disk position data and index data of disk operation time, and has a large number of data types, and in order to enable encoding and compression of the disk data by huffman encoding, a unified data format is required, and therefore, the disk data needs to be converted.
In this embodiment, the disk data includes disk position data and index data of a disk running time, where the disk position data includes information of a machine room and cabinet where the server is located, product serial number information of the server, and disk slot information, and the index data includes disk temperature, vertical displacement of a magnetic head, seek time, and the like.
And recording a sequence formed by the disk data in a preset time period according to the sequence as a disk history data sequence. In this embodiment, the preset time period is one week, and in other embodiments, the implementation personnel may set the preset time period according to actual implementation conditions and experience.
In order to unify data formats, the embodiment encodes the disk history data sequence by an encoding mode, and records a sequence formed by encoding results of all data according to sequence as a binary data sequence, wherein the disk history data sequence comprises Chinese characters, english letters, arabic numerals and various symbols.
Common coding modes include: ANSI coding, ASCII coding, UTF8 coding, UNICODE coding, GB2312 coding, UCS-2 coding, UTF16 coding, etc., the coding scheme used in this embodiment is GB2312 coding.
S002, dividing the binary data sequence according to the grouping length, calculating the applicable degree of each grouping length in the grouping length value range, obtaining the applicable length with the maximum applicable degree, and obtaining the Huffman code summary table according to the applicable length.
It should be noted that, the compression of data by huffman coding has a limitation, that is, if the probability distribution of all kinds of data is not subjected to the form of 2 minus n, the result of data compression cannot reach the entropy limit, that is, the compression effect of data cannot reach the best, therefore, in this embodiment, the applicability of each packet length is constructed by the difference between the frequency and the ideal frequency of all kinds of packets corresponding to each packet length, so as to obtain the applicable length that the result of data compression reaches the entropy limit as much as possible, and the normal form huffman total tree is constructed according to the actual frequency of all packets, so that the compression efficiency of huffman coding is improved, and the data amount after data is compressed by huffman coding is reduced, so that more data can be temporarily stored in the buffer.
1. Dividing the binary data sequence according to the packet length, and calculating the applicability of each packet length in the value range of the packet length.
In the present embodiment, the packet length is taken as a rangeAny integer in the data sequence is used as a grouping length F, a binary data sequence is divided into a plurality of subsequences according to the grouping length, the same plurality of subsequences are divided into a group, the frequency of all groups is obtained, and the frequency is recorded as the actual frequency of each group; the sequence formed by arranging all kinds of grouping according to the order from big to small is marked as an actual frequency sequence corresponding to the grouping length F, the sequence formed by arranging all kinds of grouping according to the order from big to small is marked as a grouping sequence corresponding to the grouping length F, and the ith actual frequency in the actual frequency sequence is the actual frequency of the i groups in the grouping sequence.
In the present embodiment of the present invention, in the present embodiment,=3，/>in other embodiments, the practitioner may set +.>And->。
The probability distribution of all the obtained groups is required to be in a form of 2 minus n times as much as possible, a normal form Huffman tree constructed according to all the groups in the form of 2 minus n times as much as possible is required to be subjected to the probability distribution, the compression result of the data compressed according to the normal form Huffman tree reaches the entropy limit as much as possible, and the best compression effect can be achieved; thus, a length equal to Is marked as an ideal probability sequence corresponding to the packet length F, and the last ideal probability in the ideal probability sequence is +.>The ith ideal probability in the ideal probability sequence is +.>Where N represents the length of the packet sequence, and is also the number of packets corresponding to the packet length F, which represents the packet length.
According to the actual frequency sequence and the ideal probability sequence corresponding to the packet length F, the applicability of the packet length F is calculated, specifically:
in the method, in the process of the invention,indicating the applicability of the packet length F, N indicating the number of all packets, +.>Represents the i-th actual probability in the actual frequency sequence,/->Representing the i-th ideal probability in the ideal frequency sequence,/->Representing the accumulated length。
For Huffman coding, the larger the actual probability of a packet, the smaller the data size of the coding result of that packet, e.g., the firstThe data size of the coding result of the seed group is +.>Then is less than->Grouping of which the actual frequency of the seed grouping is large, i.e. before +.in the grouping order sequence>The data amount of the encoding result of the seed group is equal to or less than +.>Thus, front->Sum of actual frequencies of individual packetsThe larger the data amount of the encoding result is equal to or less than +. >The more packets of a corresponding compressed data volume is smaller; front ∈in the ideal frequency sequence>Sum of ideal probabilities->Indicating that before +.>The expected value of the sum of the actual frequencies of the individual packets, and (2)>The closer->Even->Ratio->In case of large size, front->The closer the sum of the actual frequencies of the individual packets is to the expected value, the more the entropy limit can be reached at this time; />As front->Weight of difference between sum of actual frequencies and expected value of individual packets, for the former +.>The closer the value is expected to be to the expected value or even to exceed the expected value, the greater the corresponding weight is.
Calculating the value range of the packet lengthThe degree of applicability of all packet lengths within.
2. Obtaining the applicable length with the maximum applicable degree, and obtaining the Huffman code summary table according to the applicable length.
In other embodiments, the packet length with the largest applicable degree is recorded as an applicable length, the binary data sequence is divided into a plurality of subsequences according to the applicable length, each subsequence is recorded as data, the sequence formed by all data according to the sequence is recorded as a data sequence, and all kinds of packets corresponding to the applicable length are recorded as applicable packets; the sequence formed by ordering all applicable packets in the order of actual frequency from big to small is recorded as the applicable packet sequence.
Constructing a binary tree of N layers, wherein the left nodes of all layers in the binary tree and the right nodes of the last layer are required to be leaf nodes, and other nodes in the binary tree are parent nodes, wherein N is the number of all kinds of applicable packets in the applicable packet sequence; the method comprises the steps of marking left nodes of all layers and right nodes (total N nodes) of the last layer as target nodes, sequentially distributing each group in an applicable group sequence to each target node according to the sequence from top to bottom, distributing codes to binary trees according to the mode of left 0 and right 1, marking the obtained binary trees as normal form Huffman trees, further obtaining a Huffman coding table, marking the Huffman coding table as a Huffman coding total table, wherein the Huffman coding total table comprises the coding results of all applicable groups.
In other embodiments, codes may be assigned to the binary tree in a manner of left 1 and right 0, thereby obtaining a huffman code summary table.
For example, if the applicable length is 3, there are 8 applicable groups, 000,001,010,011,100,101,110,111 respectively, and the applicable group sequence formed by sorting the applicable groups according to the order of the actual frequencies from large to small is {011,111,100,000,101,011,110,010}, and if a normal huffman tree constructed according to the applicable group sequence is shown in fig. 2, a huffman code summary table is obtained as shown in fig. 3.
S003, processing a grouping sequence corresponding to the applicable grouping according to the priority exclusion degree, and further obtaining a Huffman coding sub-table corresponding to the applicable grouping.
It should be noted that, when the probability distribution of the data obeys the form of the power of 2 minus n, the result of data compression reaches the entropy limit, that means that the entropy limit is reached when the data is compressed by huffman coding, and cannot be improved any more, resulting in limited compression efficiency when the disk index sequence is compressed by the existing huffman coding. Step S002 makes probability distribution of all kinds of data obey the form of 2 minus n power as much as possible, makes the result of data compression reach entropy limit, and on this basis, improves Huffman coding to make the result of data compression break through entropy limit, which is key to improving data compression effect, reducing storage space occupied by history index data of disk, and further reducing influence of history index data of storage disk on disk. Therefore, in this embodiment, the target frequency of each packet corresponding to the target packet is obtained by using the target post-adjacent data of the target data corresponding to the target packet, a normal huffman tree is constructed according to the target frequency sequence corresponding to the target packet, the length of the encoding result of each packet in the normal huffman tree is determined, the packet with the length of the encoding result in the normal huffman tree smaller than that of the encoding result in the normal huffman tree is reserved, the reserved data corresponding to the packet is encoded according to the normal huffman tree, so that the compression result of the disk index sequence reaches the entropy limit as much as possible, the compression result of the huffman encoding is further improved to break through the entropy limit, the data amount of the compression result of the disk index sequence is reduced, the compression effect of the disk index sequence is improved, the storage space occupied by the history index data of the disk is reduced, and the influence of the history index data of the storage disk on the use disk is reduced.
In this embodiment, the applicable packet with the largest actual frequency is marked as a default applicable packet, any applicable packet except the default applicable packet is marked as a target applicable packet, all data belonging to the target applicable packet in the data sequence is obtained and marked as target data, the next data of each target data in the data sequence is marked as target back neighbor data, all target back neighbor data is obtained, the frequency of each applicable packet in all target back neighbor data is counted and marked as the target frequency of each applicable packet corresponding to the target applicable packet, and the sequence formed by sequencing all applicable packets according to the sequence from the large target frequency to the small target applicable packet is marked as the packet sequence corresponding to the target applicable packet.
Processing a packet sequence corresponding to the target applicable packet to obtain a Huffman coding sub-table corresponding to the target applicable packet, comprising:
k1, constructing a normal form Huffman tree according to a grouping sequence corresponding to a target applicable grouping, wherein the normal form Huffman tree comprises the following steps: constructing a T+1-layer binary tree, wherein the left nodes of all layers and the right nodes of the last layer in the binary tree are leaf nodes, and other nodes in the binary tree are father nodes, wherein T is the length of a packet sequence corresponding to a target applicable packet; and marking left nodes of all layers except the first two layers and right nodes (T nodes in total) of the last layer as target nodes, sequentially distributing each applicable packet in a packet sequence corresponding to the target applicable packet to each target node according to the sequence from top to bottom, distributing codes to binary trees according to a left mode and a right mode, marking the obtained binary tree as a normal Huffman tree, obtaining a Huffman coding table according to the normal Huffman tree, marking the Huffman coding table as a target Huffman coding table corresponding to the target applicable packet, wherein the target Huffman coding table comprises the coding results of all applicable packets in the packet sequence corresponding to the target applicable packet.
In other embodiments, the binary tree may be assigned with codes in a manner of left 1 and right 0, so as to obtain a target huffman code table corresponding to the target applicable group, and it should be noted that the assignment code manner of the binary tree corresponding to the target huffman code table corresponding to the target applicable group needs to be the same as the assignment code manner of the binary tree corresponding to the huffman code table.
K2, marking the length of the corresponding code of each applicable packet in the Huffman code table as the first length of each applicable packet, marking the length of the corresponding code of each applicable packet in the target Huffman code table corresponding to the target applicable packet as the second length of each applicable packet, marking the difference between the second length of each applicable packet and the first length of each applicable packet after adding 1 as the increment degree of each applicable packet, marking the product of the increment degree of each applicable packet and the target frequency of each applicable packet as the priority exclusion degree of each applicable packet, and removing the applicable packet with the priority exclusion degree larger than or equal to 0 and the largest priority exclusion degree from the packet sequence corresponding to the target applicable packet;
it should be noted that, in order to make the compression result have decompression, the encoding result needs to be distinguished, that is, an identifier is added before the encoding result corresponding to the target huffman encoding table, so that the second length of each applicable packet is added by 1 as the length of the encoding result of each applicable packet.
And K3, repeating the steps from K1 to K2 until the priority exclusion degree of all the applicable packets in the packet sequence corresponding to the target applicable packet is smaller than 0, and taking the target Huffman coding table constructed according to the packet sequence corresponding to the target applicable packet as the Huffman coding table corresponding to the target applicable packet.
According to the method, all Huffman coding sub-tables applicable to the groups are obtained.
For example, the packet sequence corresponding to the applicable packet 111 is {001,101,110,010}, and the normal huffman tree constructed according to the packet sequence corresponding to the applicable packet 111 is shown in fig. 4, and the huffman coding packet table corresponding to the applicable packet 111 is shown in fig. 5; the packet sequence corresponding to the applicable packet 100 is {000,110}, and the normal huffman tree constructed according to the packet sequence corresponding to the applicable packet 100 is shown in fig. 6, and the huffman coding table corresponding to the applicable packet 100 is shown in fig. 7.
S004, compressing the disk index sequence according to the Huffman coding total table and all Huffman coding sub tables applicable to grouping to obtain a compression result of the disk index sequence.
When the use health state of the disk is monitored, index data of the disk running time is required to be collected, a sequence formed by all the index data is recorded as a disk index sequence, and the disk index sequence is compressed according to a Huffman code total table and Huffman code sub-tables of all applicable groups to obtain a compression result of the disk index sequence, which is specifically as follows:
Encoding the disk index sequence in a GB2312 encoding mode to obtain a binary data sequence, dividing the binary data sequence according to the applicable length to obtain a disk data sequence, and compressing all data in the disk data sequence according to the sequence to obtain a compression result of the disk index sequence, wherein the method comprises the following steps: and recording any one data as current data, recording the previous data of the current data in the disk data sequence as front neighbor data, judging whether the current data can be compressed by using a Huffman code sub-table corresponding to the front neighbor data, if so, compressing the current data according to the Huffman code sub-table corresponding to the front neighbor data, and adding an identifier before the obtained coding result, and if not, compressing the current data according to the Huffman code summary table.
In this embodiment, since codes are allocated to the binary tree in a mode of left 0 and right 1, and further, a total huffman coding table and huffman coding sub-tables of all applicable groups are obtained, so that the identifier is 0; in other embodiments, if the binary tree is assigned with codes of left 1 and right 0, a total table of huffman codes and a table of huffman codes for all applicable packets are obtained, and the identifier is 1.
For example, the lengths of the encoding results of the applicable packets 001,101,110,010 obtained according to the huffman coding table are 6,5,7,7 respectively, the lengths of the encoding results of the applicable packets 001,101,110,010 obtained according to the huffman coding table corresponding to the applicable packet 111 are 2,3,4,5 respectively, and the lengths of the encoding results of the applicable packets 001,101,110,010 after the identifier is added are 3,4,5,6 respectively, and compared with the lengths of the encoding results of the applicable packets 001,101,110,010 obtained according to the huffman coding table, the compressed data amount is reduced and the compression efficiency is improved; the lengths of the encoding results of the applicable packets 000,110 obtained according to the huffman coding table are 4 and 7 respectively, the lengths of the encoding results of the applicable packets 000,1100 obtained according to the huffman coding table corresponding to the applicable packet 100 are 2 and 3 respectively, and the lengths of the encoding results of the applicable packets 000,110 after the identifier is added are 3 and 4 respectively, so that the compressed data size is reduced and the compression efficiency is improved compared with the case that the length of the encoding results of the applicable packets 000,110 obtained according to the huffman coding table is shorter.
S005, decompressing the compression result of the disk index sequence to obtain the disk index sequence.
Decompressing the compression result of the disk index sequence according to the sequence, including: performing first decompression on the compression result of the disk index sequence according to the Huffman coding summary table: if the applicable grouping corresponding to the first decompression result is a default applicable grouping, performing second decompression on the remaining compression results of the disk index sequence according to the Huffman coding table, and if the first decompression result does not belong to the default applicable grouping, judging whether the first element in the remaining compression results of the disk index sequence is an identifier or not: if yes, performing secondary decompression on the residual compression results of the disk index sequence according to a Huffman coding sub-table of the applicable group corresponding to the primary decompression result, and if not, performing secondary decompression on the residual compression results of the disk index sequence according to a Huffman coding total table; if the applicable grouping corresponding to the second decompression result is a default applicable grouping, performing third decompression on the remaining compression results of the disk index sequence according to the Huffman coding table, and if the second decompression result does not belong to the default applicable grouping, judging whether the first element in the remaining compression results of the disk index sequence is 0: if yes, performing third decompression on the residual compression results of the disk index sequence according to the Huffman coding sub-table of the applicable group corresponding to the second decompression result, and if not, performing third decompression on the residual compression results of the disk index sequence according to the Huffman coding total table; and the same goes on until decompression is completed on the compression result of the disk index sequence, and the disk index sequence is obtained.
The method comprises the steps of converting a disc history data sequence into a binary data sequence, constructing the applicable degree of each grouping length through the difference of the frequencies of all the groupings corresponding to each grouping length and ideal frequencies, obtaining the applicable length of the data compression result reaching the entropy limit as far as possible, constructing a normal form Huffman total tree according to the actual frequencies of all the groupings, obtaining the target frequency of each grouping corresponding to the target grouping through the target adjacent data of the target data, constructing a normal form Huffman tree according to the target frequency sequence corresponding to the target grouping, judging the length of the encoding result of each grouping in the normal form Huffman total tree, reserving the grouping of the encoding result in the normal form Huffman total tree, further encoding the reserved data according to the normal form Huffman total tree, enabling the data of the disc sequence to reach the compression result of the disc according to the target frequency sequence of each grouping corresponding to the target data, further reducing the entropy index of the target data of the target sequence, and further reducing the compression result of the disc, and further reducing the influence of the data of the disc history data.
It should be noted that: the sequence of the embodiments of the present invention is only for description, and does not represent the advantages and disadvantages of the embodiments. The processes depicted in the accompanying drawings do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments.
Claims (9)
1. A method for monitoring and managing the health status of use of a magnetic disk, comprising the steps of:
recording a sequence formed by disc data in a preset time period according to sequence as a disc history data sequence, and converting the disc history data sequence into a binary data sequence;
constructing an ideal frequency sequence corresponding to each packet length, dividing the binary data sequence according to each packet length to obtain all packets corresponding to each packet length, and calculating the applicability of each packet length according to the actual frequency sequence and the ideal frequency sequence of all packets corresponding to each packet length; the packet length with the largest applicability is marked as the applicable length, a data sequence and an applicable packet sequence formed by all applicable packets are obtained according to the applicable length, and a Huffman code summary table is obtained according to the applicable packet sequence;
Marking any applicable packet except the applicable packet with the largest actual frequency as a target applicable packet, and processing a packet sequence corresponding to the target applicable packet to obtain a Huffman coding sub-table of the target applicable packet, wherein the Huffman coding sub-table comprises the following steps:
k1, constructing a normal form Huffman tree according to a grouping sequence corresponding to the target applicable grouping, and obtaining a target Huffman coding table corresponding to the target applicable grouping according to the normal form Huffman tree;
k2, calculating the priority exclusion degree of each applicable packet according to the Huffman coding table and the target Huffman coding table corresponding to the target applicable packet, and removing the applicable packet with the priority exclusion degree greater than or equal to 0 and the maximum priority exclusion degree from the packet sequence corresponding to the target applicable packet;
k3, repeating the steps from K1 to K2 until the priority exclusion degree of all the applicable packets in the packet sequence corresponding to the target applicable packet is smaller than 0, and taking the target Huffman coding table constructed according to the packet sequence corresponding to the target applicable packet as a Huffman coding table corresponding to the target applicable packet;
processing the grouping sequences corresponding to all the applicable groupings to obtain Huffman coding sub-tables of all the applicable groupings;
and compressing the disk index sequence according to the Huffman coding total table and all Huffman coding sub tables applicable to grouping to obtain a compression result of the disk index sequence.
2. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein the constructing the ideal frequency sequence corresponding to each packet length comprises the following specific steps:
taking any integer in the grouping length value range as the grouping length F to obtain the length equal toThe ideal probability sequence of the length of the packet is recorded as an ideal probability sequence corresponding to the packet length F, and the last ideal probability in the ideal probability sequence is thatExcept for the last ideal probabilityIn addition, the ith ideal probability in the ideal probability sequence is +.>。
3. The method for monitoring and managing health status of use of magnetic disk according to claim 1, wherein the dividing the binary data sequence according to each packet length to obtain all packets corresponding to each packet length, and calculating the applicability of each packet length according to the actual frequency sequence and the ideal frequency sequence of all packets corresponding to each packet length comprises the following specific steps:
taking any integer in a value range of the grouping length as the grouping length F, dividing a binary data sequence into a plurality of subsequences according to the grouping length, dividing the same plurality of subsequences into a group, obtaining actual frequencies of all groups, and marking the sequence formed by arranging the actual frequencies of all groups in sequence from big to small as an actual frequency sequence corresponding to the grouping length;
The calculation formula of the applicability of the packet length F is:
in the method, in the process of the invention,indicating the applicability of the packet length F, N indicating the number of all packets, +.>Represents the i-th actual probability in the actual frequency sequence,/->Representing the i-th ideal probability in the ideal frequency sequence,/->Representing the accumulation length.
4. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein the step of obtaining the data sequence and the applicable packet sequence composed of all applicable packets according to the applicable length comprises the following specific steps:
dividing a binary data sequence into a plurality of subsequences according to the applicable length, marking each subsequence as data, marking a sequence formed by all data according to sequence as a data sequence, and marking all kinds of packets corresponding to the applicable length as applicable packets; the sequence formed by ordering all applicable packets in the order of actual frequency from big to small is recorded as the applicable packet sequence.
5. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein the step of obtaining a huffman code table according to an applicable grouping sequence comprises the following specific steps:
constructing a binary tree of N layers, wherein the left nodes of all layers in the binary tree and the right nodes of the last layer are required to be leaf nodes, and other nodes in the binary tree are parent nodes, wherein N is the number of all kinds of applicable packets in the applicable packet sequence; and marking left nodes of all layers and right nodes of the last layer as target nodes, sequentially distributing each group in the applicable group sequence to each target node according to the sequence from top to bottom, distributing codes to binary trees according to the mode of left 0 and right 1, marking the obtained binary trees as normal form Huffman trees, further obtaining a Huffman coding table, and marking the Huffman coding table as a Huffman coding table.
6. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein the packet sequence corresponding to the target applicable packet specifically comprises:
all data belonging to the target applicable group in the data sequence are obtained and marked as target data, the next data of each target data in the data sequence is marked as target back neighbor data, all target back neighbor data are obtained, the frequency of each applicable group in all target back neighbor data is counted and marked as the target frequency of each applicable group corresponding to the target applicable group, and the sequence formed by sequencing all applicable groups according to the sequence from the large target frequency to the small target frequency is marked as the group sequence corresponding to the target applicable group.
7. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein the building of the normal huffman tree according to the packet sequence corresponding to the target applicable packet comprises the following specific steps:
constructing a T+1-layer binary tree, wherein the left nodes of all layers and the right nodes of the last layer in the binary tree are leaf nodes, and other nodes in the binary tree are father nodes, wherein T is the length of a packet sequence corresponding to a target applicable packet; and marking left nodes of all layers except the first two layers and right nodes of the last layer as target nodes, sequentially distributing each applicable packet in a packet sequence corresponding to the target applicable packet to each target node according to the sequence from top to bottom, distributing codes to binary trees according to a left 0-right 1 mode, and marking the obtained binary tree as a normal Huffman tree.
8. The method for monitoring and managing health status of use of a magnetic disk according to claim 1, wherein said calculating the priority exclusion degree of each applicable packet comprises the following specific steps:
the length of the code corresponding to each applicable packet in the Huffman code table is recorded as the first length of each applicable packet, the length of the code corresponding to each applicable packet in the target Huffman code table corresponding to the target applicable packet is recorded as the second length of each applicable packet, the difference between the second length of each applicable packet and the first length of each applicable packet after adding 1 is recorded as the increment degree of each applicable packet, and the product of the increment degree of each applicable packet and the target frequency of each applicable packet is recorded as the product of the increment degree of each applicable packet.
9. The method for monitoring and managing the health status of use of a magnetic disk according to claim 1, wherein the compressing the magnetic disk index sequence to obtain the compression result of the magnetic disk index sequence comprises the following specific steps:
recording a sequence formed by all index data of the collected disk running time as a disk index sequence, coding the disk index sequence in a GB2312 coding mode to obtain a binary data sequence, dividing the binary data sequence according to an applicable length to obtain a disk data sequence, and compressing all data in the disk data sequence according to the sequence to obtain a compression result of the disk index sequence, wherein the method comprises the following steps: and recording any one data as current data, recording the previous data of the current data in the disk data sequence as front neighbor data, judging whether the current data can be compressed by using a Huffman code sub-table corresponding to the front neighbor data, if so, compressing the current data according to the Huffman code sub-table corresponding to the front neighbor data, and adding an identifier before the obtained coding result, and if not, compressing the current data according to the Huffman code summary table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310785754.1A CN116505955B (en) | 2023-06-30 | 2023-06-30 | Method for monitoring and managing health state of disk use |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310785754.1A CN116505955B (en) | 2023-06-30 | 2023-06-30 | Method for monitoring and managing health state of disk use |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116505955A CN116505955A (en) | 2023-07-28 |
| CN116505955B true CN116505955B (en) | 2023-12-05 |
Family
ID=87330620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310785754.1A Active CN116505955B (en) | 2023-06-30 | 2023-06-30 | Method for monitoring and managing health state of disk use |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116505955B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117394866B (en) * | 2023-10-07 | 2024-04-02 | 广东图为信息技术有限公司 | Intelligent flap valve system based on environment self-adaption |
| CN117294397B (en) * | 2023-11-27 | 2024-02-20 | 深圳市正东兴通讯设备有限公司 | Wireless communication data storage method and system |
| CN118713680A (en) * | 2024-08-27 | 2024-09-27 | 湖南师范大学 | Trusted metering data storage method based on blockchain technology |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1478255A (en) * | 2000-09-28 | 2004-02-25 | 罗克马诺尔研究有限公司 | Improved Huffman data compression method |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| US7353233B1 (en) * | 2004-04-16 | 2008-04-01 | Majesco Entertainment Company | Apparatus and method for real-time decompression of data streams on limited-resource embedded devices |
| KR20100009032A (en) * | 2008-07-17 | 2010-01-27 | 고려대학교 산학협력단 | Lossless data compression method |
| CN105592313A (en) * | 2014-10-21 | 2016-05-18 | 广东中星电子有限公司 | Grouped adaptive entropy coding compression method |
| CN114885035A (en) * | 2022-06-30 | 2022-08-09 | 北京城建设计发展集团股份有限公司 | Lossless compression method and device, and lossless decompression method and device |
| CN115312129A (en) * | 2022-08-24 | 2022-11-08 | 深圳华大医学检验实验室 | Gene data compression method and device in high-throughput sequencing background and related equipment |
| CN115865099A (en) * | 2022-12-01 | 2023-03-28 | 河南大学 | Multi-type data segmentation compression method and system based on Huffman coding |
| CN116318174A (en) * | 2023-05-15 | 2023-06-23 | 青岛国源中创电气自动化工程有限公司 | Data management method of garbage transportation management system of sewage treatment plant |
-
2023
- 2023-06-30 CN CN202310785754.1A patent/CN116505955B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1478255A (en) * | 2000-09-28 | 2004-02-25 | 罗克马诺尔研究有限公司 | Improved Huffman data compression method |
| US7353233B1 (en) * | 2004-04-16 | 2008-04-01 | Majesco Entertainment Company | Apparatus and method for real-time decompression of data streams on limited-resource embedded devices |
| CN101060337A (en) * | 2007-05-22 | 2007-10-24 | 北京中星微电子有限公司 | An optimized Huffman decoding method and device |
| KR20100009032A (en) * | 2008-07-17 | 2010-01-27 | 고려대학교 산학협력단 | Lossless data compression method |
| CN105592313A (en) * | 2014-10-21 | 2016-05-18 | 广东中星电子有限公司 | Grouped adaptive entropy coding compression method |
| CN114885035A (en) * | 2022-06-30 | 2022-08-09 | 北京城建设计发展集团股份有限公司 | Lossless compression method and device, and lossless decompression method and device |
| CN115312129A (en) * | 2022-08-24 | 2022-11-08 | 深圳华大医学检验实验室 | Gene data compression method and device in high-throughput sequencing background and related equipment |
| CN115865099A (en) * | 2022-12-01 | 2023-03-28 | 河南大学 | Multi-type data segmentation compression method and system based on Huffman coding |
| CN116318174A (en) * | 2023-05-15 | 2023-06-23 | 青岛国源中创电气自动化工程有限公司 | Data management method of garbage transportation management system of sewage treatment plant |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116505955A (en) | 2023-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116505955B (en) | Method for monitoring and managing health state of disk use | |
| CN116192971B (en) | Intelligent cloud energy operation and maintenance service platform data management method | |
| Hoffer et al. | The use of cluster analysis in physical data base design | |
| CN116303374B (en) | Multi-dimensional report data optimization compression method based on SQL database | |
| CN116073838B (en) | Intelligent data management system for fire rescue equipment | |
| CN116681036B (en) | Industrial data storage method based on digital twinning | |
| CN116346289B (en) | Data processing method for computer network center | |
| Adoul | Error intervals and cluster density in channel modeling (corresp.) | |
| CN115511013B (en) | Large-scale energy storage power station abnormal battery identification method, device and storage medium | |
| CN116153453B (en) | Intelligent ring information management method and system based on cloud edge cooperation | |
| CN107590157B (en) | Data storage method, data query method and related equipment | |
| CN116016606B (en) | Sewage treatment operation and maintenance data efficient management system based on intelligent cloud | |
| CN112905125B (en) | Data storage and reading method based on high-precision calculation of computer | |
| CN106067142B (en) | Electric energy quality data representation method | |
| CN115658628B (en) | Production data intelligent management method for MES system | |
| CN104991741B (en) | A kind of situation adaptation power network big data storage method based on key-value model | |
| CN117235013B (en) | Intelligent archive management method based on artificial intelligence | |
| CN118018032B (en) | Remote control data transmission method of intelligent switch cabinet | |
| CN116827354B (en) | File data distributed storage management system | |
| JP4684883B2 (en) | Attribute information collecting apparatus, attribute information collecting method, and attribute information collecting program | |
| CN110389875B (en) | Method, apparatus and storage medium for monitoring the operating state of a computer system | |
| CN114860160B (en) | Capacity expansion resource prediction method and system for Hadoop data platform | |
| CN116208667A (en) | Variable-length high-compression bit message coding and decoding method | |
| CN115913248A (en) | Live broadcast software development data intelligent management system | |
| CN111242673A (en) | Intelligent commission calculation method based on building element matching |
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 |