CN117195005B - Information data management system based on wisdom carwash - Google Patents
Information data management system based on wisdom carwash Download PDFInfo
- Publication number
- CN117195005B CN117195005B CN202311451971.3A CN202311451971A CN117195005B CN 117195005 B CN117195005 B CN 117195005B CN 202311451971 A CN202311451971 A CN 202311451971A CN 117195005 B CN117195005 B CN 117195005B
- Authority
- CN
- China
- Prior art keywords
- data
- unit
- compressed
- compression unit
- compression
- 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
- 238000013523 data management Methods 0.000 title claims abstract description 37
- 238000007906 compression Methods 0.000 claims abstract description 207
- 230000006835 compression Effects 0.000 claims abstract description 207
- 238000005406 washing Methods 0.000 claims abstract description 38
- 230000011218 segmentation Effects 0.000 claims abstract description 6
- 230000006837 decompression Effects 0.000 claims description 17
- 238000003491 array Methods 0.000 claims description 5
- 238000000034 method Methods 0.000 abstract description 9
- 238000013144 data compression Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 14
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 230000005611 electricity Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses an information data management system based on intelligent car washing, which belongs to the technical field of data compression, and comprises: the information data acquisition module is used for acquiring information data acquired in the car washing process of the car washer; the segmentation module is used for obtaining data to be compressed; the data identical characteristic table obtaining module is used for obtaining the data identical characteristic table; the data similar feature table obtaining module is used for obtaining a data similar feature table; the compressed data table obtaining module is used for obtaining a compressed data table; and the compressed data obtaining module is used for converting the compressed data into a binary array to obtain compressed data. Traversing the data to be compressed obtained based on the segmentation information data, sequentially obtaining a data identical characteristic table, a data similar characteristic table and a compressed data table, obtaining a compressed combination unit based on the identical non-0 value in the compressed data table, and finally taking the binary array of the compressed combination unit as the compressed data. The method realizes the maximum compression of the carwash information data, improves the compression efficiency and saves the storage space.
Description
Technical Field
The invention relates to the technical field of data compression, in particular to an information data management system based on intelligent car washing.
Background
Automobiles are a common riding-instead-of-walking tool in life, and car washing is one of the basic maintenance requirements of automobiles. Along with the development of science and technology, car washing machines are popular in automatic car washing, and replace traditional manual car washing. The car washer has the advantages of water and electricity saving, high car washing speed and the like. With the continuous development of information technology, people try to control the car washer by using a computer terminal, and the fault monitoring, unmanned supervision and automatic car washing of the car washer are realized by depending on a large amount of data, and the car washer is improved.
In the process of improving the car washer by using the data, a great amount of man-machine interaction data is inevitably generated. This means that a lot of memory space is needed to store the data, but the data is rarely called, most of the time in idle state. In this case, the data may be highly compressed using a compression algorithm to save storage space. The car washer information data has the characteristics of low use frequency and long prediction storage time, so that an information data management system suitable for compressing the car washer data is needed.
Disclosure of Invention
The invention provides an information data management system based on intelligent car washing, which aims to improve the compression efficiency of car washing data and save storage space.
To achieve the above object, the present invention provides an information data management system based on intelligent car washing, the system comprising:
the system comprises an information data acquisition module, a compression unit and a control module, wherein the information data acquisition module is used for acquiring information data acquired in the car washing process of a car washer, the data form of the information data is binary, and the size of the compression unit is 4bit long;
the segmentation module is used for segmenting the information data according to the compression unit to obtain data to be compressed;
the data identical characteristic table obtaining module is used for traversing the data to be compressed based on the span of the compression unit to find the identical compression unit, and storing the traversing result as the data identical characteristic table;
the data similar feature table obtaining module is used for traversing the data same feature table and calculating the similar distance of each character in the compression unit to obtain the data similar feature table;
the compressed data table obtaining module is used for obtaining a compressed unit combination based on the same non-0 value in the similar characteristic table and obtaining a compressed data table based on all compressed unit combinations;
and the compressed data obtaining module is used for converting the data to be compressed into a binary array based on the compressed data table to obtain compressed data.
Optionally, the data identical feature table obtaining module includes:
a first marking unit for marking the traversed current compression unit as a first compression unit;
the second marking unit is used for traversing other compression units in the data to be compressed forwards and marking the compression unit which is the same as the first compression unit as a second compression unit;
a first nearest identical character distance determining unit configured to calculate the number of compression units of an interval between the first compression unit and the second compression unit, and determine a nearest identical character distance of the first compression unit based on the number of compression units of the interval;
and the recording unit is used for traversing each compression unit in the data to be compressed in sequence, recording the obtained nearest identical character distance on the right side of the corresponding first compression unit, and obtaining the data identical characteristic table.
Optionally, the data identical feature table obtaining module further includes:
and the second nearest identical character distance determining unit is used for determining the nearest identical character distance of the first compressing unit as 0 if the second compressing unit is not traversed forward or the edge of the data to be compressed is touched.
Optionally, the data similarity feature table obtaining module includes:
a first determining unit configured to determine an element of a most recent identical character distance in the data identical feature table as a value of a first column similarity distance of a data similar feature table;
the second determining unit is used for traversing the first column of similar distances from top to bottom and determining the first column of similar distance values as basic distance values;
a third determining unit configured to determine, as associated line data, one line of data having a distance value with a currently traversed line as a base distance value;
an adding unit, configured to add each column of similar distances in the associated row data to the base distance value, respectively, to obtain a new similar distance;
the arrangement unit is used for sequentially arranging the obtained one or more new similar distances on the right side of the first column of similar distances to obtain element values of other columns in the data similar feature table;
the data similar feature table obtaining unit is used for obtaining the data similar feature table corresponding to the data same feature table after traversing.
Optionally, the compressed data table obtaining module includes:
a compression unit combination seed obtaining unit for traversing the similar feature table and determining a compression unit combination seed based on the same non-0 value of the adjacent rows;
the comparison unit is used for comparing the next line element value with the numerical value of the compression unit combination seed after the compression unit combination seed is obtained, and determining the compression unit combination based on the comparison result;
and the compressed data table obtaining unit is used for storing the obtained plurality of compressed unit combinations into a compressed data table after the similar characteristic table is traversed.
Optionally, the comparing unit includes:
the comparison unit is used for comparing the element value of each column in the next row with the numerical value of each column in the combined seed of the compression unit one by one;
the adding unit is used for adding the next row into the compression unit combination seed if the next row has the element value which is the same as the column number value corresponding to the compression unit combination seed;
and the ending unit is used for ending the compression of the current compression unit combination seed to obtain the compression unit combination if the next row does not have the element value which is the same as the column number value corresponding to the compression unit combination seed.
Optionally, the compressed data obtaining module includes:
the first traversing unit is used for traversing the compressed data table from top to bottom, generating a binary array { compression unit, 0} when traversing to 0, and continuing traversing the next row of data;
a second traversing unit, configured to form a binary array { DIS, LANG }, when traversing to a non-0 value, where LANG represents a length of duration of the non-0 value in the compressed data table, DIS represents a span, and continue traversing the compressed data table from a position of a next row different from the non-0 value;
and the compressed data obtaining unit is used for obtaining all binary arrays which are compressed data corresponding to the data to be compressed after the traversal is completed.
Optionally, the system further comprises a decompression module for decompressing the compressed data to obtain decompressed car washer information data;
wherein, the decompression module includes:
the type judging unit is used for traversing the binary array corresponding to the compressed data in sequence and judging the type of the binary array through the second number of bits in the binary array;
and the decompression unit is used for restoring the binary array according to the preset operation based on the type of the binary data to obtain decompressed car washer information data.
Optionally, the type judging unit includes:
a first judging unit for determining the type of the binary array as { compression unit, 0}, when the second bit number is 0;
a second judging unit for determining the type of the binary array as { when the second bit number is not 0,/>}。
Optionally, the decompression unit includes:
the first determining unit is used for determining the compression unit corresponding to the binary array as restored data and arranging the restored data after the restored data if the type of the binary array is { compression unit, 0}, and the restored data exists;
the second determining unit is used for determining the compression unit corresponding to the binary array as the beginning of the decompressed car washer information data if the type of the binary array is { compression unit, 0}, and the restored data does not exist;
a copy unit for if the binary array is of the type {,/>The DIS data are taken forward, the obtained data are used as compression units, the obtained data are copied and arranged behind the restored data, then one bit is moved down, and the operation is repeated;
and the completion unit is used for obtaining decompressed car washer information data after decompression of all the binary data.
Compared with the prior art, the information data management system based on intelligent car washing provided by the invention comprises the following components: the system comprises an information data acquisition module, a compression unit and a control module, wherein the information data acquisition module is used for acquiring information data acquired in the car washing process of a car washer, the data form of the information data is binary, and the size of the compression unit is 4bit long; the segmentation module is used for segmenting the information data according to the compression unit to obtain data to be compressed; the data identical characteristic table obtaining module is used for traversing the data to be compressed based on the span of the compression unit to find the identical compression unit, and storing the traversing result as the data identical characteristic table; the data similar feature table obtaining module is used for traversing the data same feature table and calculating the similar distance of each character in the compression unit to obtain the data similar feature table; the compressed data table obtaining module is used for obtaining a compressed unit combination based on the same non-0 value in the similar characteristic table and obtaining a compressed data table based on all compressed unit combinations; and the compressed data obtaining module is used for converting the data to be compressed into a binary array based on the compressed data table to obtain compressed data. And then obtaining a compression combination unit based on the same non-0 value in the compression data table, and finally taking the binary array of the compression combination unit as the compression data. The method realizes the maximum compression of the carwash information data, improves the compression efficiency and saves the storage space.
Drawings
FIG. 1 is a schematic diagram showing the composition of an embodiment of an intelligent car washing based information data management system according to the present invention;
FIG. 2 is a schematic diagram of a first refinement of an embodiment of an intelligent car wash based information data management system according to the present invention;
FIG. 3 is a diagram of the intent of representing the same features of data as are involved in one embodiment of the intelligent car wash based information data management system of the present invention;
FIG. 4 is a diagram of a data similarity feature representative of an intent of an embodiment of an intelligent car wash based information data management system of the present invention;
FIG. 5 is a schematic diagram showing a second refinement of an embodiment of an intelligent car wash based information data management system according to the present invention;
FIG. 6 is a table of consolidated data similarity features relating to one embodiment of the intelligent car wash based information data management system of the present invention;
FIG. 7 is a diagram of compressed data representing intent in accordance with one embodiment of the intelligent car wash based information data management system of the present invention;
FIG. 8 is a third detailed component schematic diagram of an embodiment of an intelligent car wash based information data management system according to the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Noun terms and explanations related to the present embodiment:
distance: the number of compression units spaced between two compression units is increased by one.
Compression unit combination: the plurality of adjacent compression units maintain the order in the data to be compressed, and are arranged to form a combination.
Span DIS: in the decompression process, when the compression unit combines the restored data, the basic distance value needs to be traversed forward.
Length LANG: the number of compression units of the compression unit combination. In the compressed data, the data at the same position as the span DIS includes a task of storing the type of the compression unit, so that the minimum value of the span should be equal to or greater than the type number of the compression unit minus one. Thus in this embodiment, the empirical value of span DIS max maxDIS is 15.
Referring to fig. 1, fig. 1 is a schematic structural diagram of an information data management system based on intelligent car washing according to an embodiment of the invention. As shown in fig. 1, the intelligent car washing based information data management system provided by the invention comprises:
the information data acquisition module 10 is used for acquiring information data acquired in the car washing process of the car washing machine, wherein the data form of the information data is binary, and the size of the compression unit is 4 bits long;
the specific scenario of this embodiment is that in the information data management system of the car washer, data which is low in use frequency but needs to be stored for a long period of time is highly compressed. The method comprises the steps of obtaining a similar part in the data through jump type dictionary matching, and carrying out data compression on the similar part.
The information data related to the implementation comprises various sensor data in the car washing process of the car washer, information data such as license plate numbers of users, car types, car washing frequency, car washing duration and the like, and the information data is stored in a hard disk in a traditional binary format. Taking a nibble as an example, i.e. a binary digit of length 4 as the basis for a compression unit. The size of the compression unit in actual operation can be adjusted at will according to actual conditions without limitation.
The dividing module 20 is configured to divide the information data according to a compression unit to obtain data to be compressed;
dividing the original data according to a compression unit with a preset size, wherein the divided data are to-be-compressed data. Each of the most basic compression units obtained after data division has a length of 4 bits, so there are 16 kinds of compression units in total.
The data identical feature table obtaining module 30 is configured to traverse the data to be compressed based on the span of the compression units to find the identical compression units, and store the traversing result as a data identical feature table;
referring to fig. 2, fig. 2 is a schematic diagram showing a first detailed composition of an embodiment of the intelligent car washing based information data management system according to the present invention, as shown in fig. 2, the data identical feature table obtaining module 30 includes:
a first marking unit 301, configured to mark the traversed current compression unit as a first compression unit; each traversal marks the compression unit being traversed as the first compression unit.
A second marking unit 302, configured to traverse forward through other compression units in the data to be compressed, and mark the compression unit identical to the first compression unit as a second compression unit; the remaining compression units are traversed forward with the first compression unit as a starting position until a second compression unit identical to the first compression unit is encountered.
A first nearest identical character distance determining unit 303 for calculating the number of compression units of the interval between the first compression unit and the second compression unit, and determining the nearest identical character distance of the first compression unit based on the number of compression units of the interval; the distance (the number of compression units spaced) between the first compression unit and the second compression unit is noted, the distance is referred to as the nearest identical character distance, and the nearest identical character distance is recorded on the right side of the first compression unit.
In addition, the data identical characteristic table obtaining module further includes:
and the second nearest identical character distance determining unit is used for determining the nearest identical character distance of the first compressing unit as 0 if the second compressing unit is not traversed forward or the edge of the data to be compressed is touched. The longest distance traversed forward in this embodiment does not exceed the maximum span maxDIS, and if the forward traversal does not obtain the second compression unit, or touches the edge of the data to be compressed, the first compression unit has the nearest same character distance of 0.
And a recording unit 304, configured to sequentially traverse each compression unit in the data to be compressed, record the obtained most recent identical character distance on the right side of the corresponding first compression unit, and obtain the data identical feature table.
And traversing the data to be compressed, and obtaining the data identical characteristic table based on the obtained nearest identical character distance. Referring to fig. 3, fig. 3 is a diagram showing the intention of the same features of data according to an embodiment of the intelligent car washing based information data management system of the present invention.
The data similarity feature table obtaining module 40 is configured to traverse the data similarity feature table, calculate a similarity distance between each character in the compression unit, and obtain a data similarity feature table;
the data similarity feature table obtaining module 40 includes:
a first determining unit configured to determine an element of a most recent identical character distance in the data identical feature table as a value of a first column similarity distance of a data similar feature table; each row in the data similar feature table corresponds to each compression unit in the data identical feature table in sequence, and the first column similar distance is equal to the nearest identical character distance in the data identical feature table.
The second determining unit is used for traversing the first column of similar distances from top to bottom and determining the first column of similar distance values as basic distance values; traversing the first column of similar distances from top to bottom, and recording the similar distances as basic distance values when the first column of similar distances is not 0.
A third determining unit configured to determine, as associated line data, one line of data having a distance value with a currently traversed line as a base distance value; a line of data of a distance of the front base distance value is acquired, which is called associated line data.
An adding unit, configured to add each column of similar distances in the associated row data to the base distance value, respectively, to obtain a new similar distance; that is, all similar distances in the associated line data are added to the base distance value. The present embodiment needs to delete the associated data corresponding to the new similarity distance greater than the span maximum maxDIS or equal to the base distance value.
The arrangement unit is used for sequentially arranging the obtained one or more new similar distances on the right side of the first column of similar distances to obtain element values of other columns in the data similar feature table; the new similar distances of the associated rows that are not deleted are arranged behind the traversed base distance (first similar distance).
For example: when traversing to the 14 th first column of similar distance in fig. 3, the similar distance is a basic distance value 8, 8 distances are upwards to obtain associated line data as {2,4}, the associated line data is added with the basic distance value 8 to obtain new similar distances {10,12} of the data, the new similar distances {10,12} are arranged behind the traversed basic distance value 8, and finally the data of the line elements are {8,10,12}.
The data similar feature table obtaining unit is used for obtaining the data similar feature table corresponding to the data same feature table after traversing. Traversing the first column of similar distances according to the method to obtain a data similar feature table. Referring to fig. 4, fig. 4 is a diagram showing the intention of data similar features according to an embodiment of the information data management system based on intelligent car washing of the present invention.
In the data similarity feature table, a non-0 value represents how far from the current row there is the same compression unit as the compression unit represented by the present row. Adjacent rows have the same non-0 value, representing the compression units corresponding to the rows, and the compression unit combination is repeated with the compression unit combination in front, so that data compression can be completed by the same non-0 value of the adjacent rows.
A compressed data table obtaining module 50, configured to obtain a compressed unit combination based on the same non-0 value in the similar feature table, and obtain a compressed data table based on all compressed unit combinations;
in the data similarity feature table, the same non-0 value of the adjacent line represents that character repetition occurs, and thus a series of compression units in which the same non-0 value occurs in the adjacent line are constituted as a compression unit combination.
The compression scheme of the embodiment is similar to classical LZ77 dictionary compression, and the LZ77 dictionary compression algorithm can only compress the adjacent repeated compression unit combination, but the compression scheme of the embodiment can also compress the non-adjacent repeated compression unit combination, so that the compression amount of the compression scheme of the embodiment is larger than that of the classical LZ77 dictionary compression algorithm, and more storage space can be saved.
Referring to fig. 5, fig. 5 is a second detailed composition diagram of an embodiment of the intelligent car washing based information data management system of the present invention, as shown in fig. 5, the compressed data table obtaining module 50 includes:
a compression unit combination seed obtaining unit 501, configured to traverse the similar feature table, and determine a compression unit combination seed based on the same non-0 value of the adjacent rows;
a comparing unit 502, configured to compare the element value of the next row with the value of the seed combined with the compressing unit after obtaining the seed combined with the compressing unit, and determine the compressing unit combination based on the comparison result;
the comparison unit is used for comparing the element value of each column in the next row with the numerical value of each column in the combined seed of the compression unit one by one;
the adding unit is used for adding the next row into the compression unit combination seed if the next row has the element value which is the same as the column number value corresponding to the compression unit combination seed;
and the ending unit is used for ending the compression of the current compression unit combination seed to obtain the compression unit combination if the next row does not have the element value which is the same as the column number value corresponding to the compression unit combination seed.
Traversing all data similar characteristic tables from top to bottom, and when no compression unit combination seeds exist, forming the two rows into a compression unit combination seed when the same non-0 numerical value of the two adjacent rows appears. If a plurality of same non-0 values appear in the two rows of data at the same time, constructing a compression unit combination seed according to the largest same non-0 value.
And a compressed data table obtaining unit 503, configured to store the obtained combination of the plurality of compression units as a compressed data table after the similar feature table is traversed.
Continuing to traverse, when the compression unit combination seed exists, if the next row has the same value as the compression unit combination seed, adding the row into the compression unit combination seed. The seed of the next row without the compression unit combination has the same value, and the current compression unit seed is ended to form a compression unit combination.
The similar feature table shown in fig. 4 is processed to obtain a compressed data table shown in fig. 6, and fig. 6 is a data similar feature table after finishing according to an embodiment of the information data management system based on intelligent car washing. The compressed data table obtained by the method furthest divides a plurality of compression unit combinations, and no conflict of compression unit allocation occurs.
The compressed data obtaining module 60 is configured to convert the data to be compressed into a binary array based on the compressed data table, and obtain compressed data.
The first traversing unit is used for traversing the compressed data table from top to bottom, generating a binary array { compression unit, 0} when traversing to 0, and continuing traversing the next row of data;
a second traversing unit, configured to form a binary array { DIS, LANG }, when traversing to a non-0 value, where LANG represents a length of duration of the non-0 value in the compressed data table, DIS represents a span, and continue traversing the compressed data table from a position of a next row different from the non-0 value;
and the compressed data obtaining unit is used for obtaining all binary arrays which are compressed data corresponding to the data to be compressed after the traversal is completed.
The compressed data table is traversed from top to bottom, and when the compressed data table is traversed to 0, a binary array { compressed unit, 0} is generated, and then the next row of the compressed data table is traversed continuously. In the binary array, the compression unit of the first bit is the compression unit code of the corresponding row of the compression data table, and the 0 of the second bit is a sign symbol.
When traversing to a non-0 value, marking the continuous length of the non-0 value in the statistical table as LANG; the non-0 value at this time is noted as the span DIS, forming a binary array { DIS, LANG }, and then traversing the compressed data table from the next row at a location different from the non-0 value.
Referring to fig. 7, fig. 7 is a diagram showing the compressed data according to an embodiment of the intelligent car washing-based information data management system according to the present invention, and as shown in fig. 7, the data similarity feature table in fig. 6 is compressed, and the binary array (compressed data) generated finally is { compression element, 0}, {12,7}, {14,3}.
Thus, data compression of the data to be compressed is completed, and compressed data is obtained. Compared with the classical LZ77 dictionary compression algorithm, the array of the embodiment is changed from ternary to binary, and the array of the embodiment is less than one array, and the embodiment can carry out matched compression on non-adjacent repeated compression unit combinations, wherein the data volume after compression is two thirds or less of that of the LZ77 compression algorithm.
After the data to be compressed is compressed, if the data needs to be called, decompression is needed, and then how to decompress the compressed data is explained.
Referring to fig. 8, fig. 8 is a schematic diagram of a third refinement of an embodiment of an information data management system based on intelligent car washing according to the present invention, as shown in fig. 8, the system further includes a decompression module 70 for decompressing the compressed data to obtain decompressed car washer information data;
specifically, the decompression module 70 includes:
a type determining unit 701, configured to traverse the binary arrays corresponding to the compressed data in sequence, and determine the type of the binary array through the second number of bits in the binary array; wherein the types of the binary array include { compression unit, 0} and {,}。
Based on this, the type judgment unit 701 includes:
a first judging unit for determining the type of the binary array as { compression unit, 0}, when the second bit number is 0;
a second judging unit for determining the type of the binary array as { when the second bit number is not 0,/>}。
The decompression unit 702 is configured to restore the binary array according to a preset operation based on the type of the binary data, and obtain decompressed car washer information data.
The first determining unit is used for determining the compression unit corresponding to the binary array as restored data and arranging the restored data after the restored data if the type of the binary array is { compression unit, 0}, and the restored data exists;
the second determining unit is used for determining the compression unit corresponding to the binary array as the beginning of the decompressed car washer information data if the type of the binary array is { compression unit, 0}, and the restored data does not exist;
a copy unit for if the binary array is of the type {,/>The DIS data are taken forward, the obtained data are used as compression units, the obtained data are copied and arranged behind the restored data, then one bit is moved down, and the operation is repeated;
and the completion unit is used for obtaining decompressed car washer information data after decompression of all the binary data.
When the second bit number is 0, the binary array is { compression unit, 0}, and the compression unit is used as restored data and arranged behind the restored data to finish decompression; if there is no data that has been restored, the compression unit is set as the head of the decompressed data.
When the second bit number is not 0, the binary array is of the type {,/>}: at this time will get +.>The restored data is copied and arranged behind the restored data as a compression unit, and then shifted down by one bit, repeating the operation +.>And twice.
And operating all binary arrays according to the steps, and thus, decompressing the compressed data.
Compared with the prior art, this embodiment provides an information data management system based on wisdom carwash, information data management system based on wisdom carwash includes: the system comprises an information data acquisition module, a compression unit and a control module, wherein the information data acquisition module is used for acquiring information data acquired in the car washing process of a car washer, the data form of the information data is binary, and the size of the compression unit is 4bit long; the segmentation module is used for segmenting the information data according to the compression unit to obtain data to be compressed; the data identical characteristic table obtaining module is used for traversing the data to be compressed based on the span of the compression unit to find the identical compression unit, and storing the traversing result as the data identical characteristic table; the data similar feature table obtaining module is used for traversing the data same feature table and calculating the similar distance of each character in the compression unit to obtain the data similar feature table; the compressed data table obtaining module is used for obtaining a compressed unit combination based on the same non-0 value in the similar characteristic table and obtaining a compressed data table based on all compressed unit combinations; and the compressed data obtaining module is used for converting the data to be compressed into a binary array based on the compressed data table to obtain compressed data. And then obtaining a compression combination unit based on the same non-0 value in the compression data table, and finally taking the binary array of the compression combination unit as the compression data. The method realizes the maximum compression of the carwash information data, improves the compression efficiency and saves the storage space.
The foregoing description is only of the preferred embodiments of the present invention and is not intended to limit the scope of the present invention, and all equivalent structures or modifications in the process, or direct or indirect application in other related technical fields are included in the scope of the present invention.
Claims (8)
1. An information data management system based on wisdom carwash, characterized in that, the information data management system based on wisdom carwash includes:
the system comprises an information data acquisition module, a compression unit and a control module, wherein the information data acquisition module is used for acquiring information data acquired in the car washing process of a car washer, the data form of the information data is binary, and the size of the compression unit is 4bit long;
the segmentation module is used for segmenting the information data according to the compression unit to obtain data to be compressed;
the data identical characteristic table obtaining module is used for traversing the data to be compressed based on the span of the compression unit to find the identical compression unit, and storing the traversing result as the data identical characteristic table;
the data similar feature table obtaining module is used for traversing the data same feature table and calculating the similar distance of each character in the compression unit to obtain the data similar feature table;
the data similarity characteristic table obtaining module comprises:
a first determining unit configured to determine an element of a most recent identical character distance in the data identical feature table as a value of a first column similarity distance of a data similar feature table;
the second determining unit is used for traversing the first column of similar distances from top to bottom and determining the first column of similar distance values as basic distance values;
a third determining unit configured to determine, as associated line data, one line of data having a distance value with a currently traversed line as a base distance value;
an adding unit, configured to add each column of similar distances in the associated row data to the base distance value, respectively, to obtain a new similar distance;
the arrangement unit is used for sequentially arranging the obtained one or more new similar distances on the right side of the first column of similar distances to obtain element values of other columns in the data similar feature table;
the data similar feature table obtaining unit is used for obtaining the data similar feature table corresponding to the data same feature table after traversing;
the compressed data table obtaining module is used for obtaining a compressed unit combination based on the same non-0 value in the similar characteristic table and obtaining a compressed data table based on all compressed unit combinations;
wherein, the compressed data table obtaining module includes:
a compression unit combination seed obtaining unit for traversing the similar feature table and determining a compression unit combination seed based on the same non-0 value of the adjacent rows;
the comparison unit is used for comparing the next line element value with the numerical value of the compression unit combination seed after the compression unit combination seed is obtained, and determining the compression unit combination based on the comparison result;
the compressed data table obtaining unit is used for storing the obtained plurality of compressed unit combinations into a compressed data table after the similar characteristic table is traversed;
and the compressed data obtaining module is used for converting the data to be compressed into a binary array based on the compressed data table to obtain compressed data.
2. The intelligent car washing based information data management system according to claim 1, wherein the data identical feature table obtaining module comprises:
a first marking unit for marking the traversed current compression unit as a first compression unit;
the second marking unit is used for traversing other compression units in the data to be compressed forwards and marking the compression unit which is the same as the first compression unit as a second compression unit;
a first nearest identical character distance determining unit configured to calculate the number of compression units of an interval between the first compression unit and the second compression unit, and determine a nearest identical character distance of the first compression unit based on the number of compression units of the interval;
and the recording unit is used for traversing each compression unit in the data to be compressed in sequence, recording the obtained nearest identical character distance on the right side of the corresponding first compression unit, and obtaining the data identical characteristic table.
3. The intelligent car washing based information data management system according to claim 2, wherein the data identical feature table obtaining module further comprises:
and the second nearest identical character distance determining unit is used for determining the nearest identical character distance of the first compressing unit as 0 if the second compressing unit is not traversed forward or the edge of the data to be compressed is touched.
4. The intelligent car washing based information data management system according to claim 1, wherein the comparison unit includes:
the comparison unit is used for comparing the element value of each column in the next row with the numerical value of each column in the combined seed of the compression unit one by one;
the adding unit is used for adding the next row into the compression unit combination seed if the next row has the element value which is the same as the column number value corresponding to the compression unit combination seed;
and the ending unit is used for ending the compression of the current compression unit combination seed to obtain the compression unit combination if the next row does not have the element value which is the same as the column number value corresponding to the compression unit combination seed.
5. The intelligent car wash based information data management system of claim 1, wherein the compressed data acquisition module comprises:
the first traversing unit is used for traversing the compressed data table from top to bottom, generating a binary array { compression unit, 0} when traversing to 0, and continuing traversing the next row of data;
a second traversing unit, configured to form a binary array { DIS, LANG }, when traversing to a non-0 value, where LANG represents a length of duration of the non-0 value in the compressed data table, DIS represents a span, and continue traversing the compressed data table from a position of a next row different from the non-0 value;
and the compressed data obtaining unit is used for obtaining all binary arrays which are compressed data corresponding to the data to be compressed after the traversal is completed.
6. The intelligent car washing based information data management system according to claim 1, further comprising a decompression module for decompressing the compressed data to obtain decompressed car washing information data;
wherein, the decompression module includes:
the type judging unit is used for traversing the binary array corresponding to the compressed data in sequence and judging the type of the binary array through the second number of bits in the binary array;
and the decompression unit is used for restoring the binary array according to the preset operation based on the type of the binary data to obtain decompressed car washer information data.
7. The intelligent car washing based information data management system according to claim 6, wherein the type judgment unit includes:
a first judging unit for determining the type of the binary array as { compression unit, 0}, when the second bit number is 0;
a second judging unit for determining the type of the binary array as { when the second bit number is not 0,/>}。
8. The intelligent car wash based information data management system of claim 6, wherein the decompression unit comprises:
the first determining unit is used for determining the compression unit corresponding to the binary array as restored data and arranging the restored data after the restored data if the type of the binary array is { compression unit, 0}, and the restored data exists;
the second determining unit is used for determining the compression unit corresponding to the binary array as the beginning of the decompressed car washer information data if the type of the binary array is { compression unit, 0}, and the restored data does not exist;
a copy unit for if the binary array is of the type {,/>Then the DIS data is fetched forward, the fetched data is used as compression unit, and the data is copiedThe acquired data are arranged behind the restored data, then one bit is moved downwards, and the operation is repeated;
and the completion unit is used for obtaining decompressed car washer information data after decompression of all the binary data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311451971.3A CN117195005B (en) | 2023-11-03 | 2023-11-03 | Information data management system based on wisdom carwash |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311451971.3A CN117195005B (en) | 2023-11-03 | 2023-11-03 | Information data management system based on wisdom carwash |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117195005A CN117195005A (en) | 2023-12-08 |
| CN117195005B true CN117195005B (en) | 2024-01-26 |
Family
ID=89003720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311451971.3A Active CN117195005B (en) | 2023-11-03 | 2023-11-03 | Information data management system based on wisdom carwash |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117195005B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1251449A (en) * | 1998-10-18 | 2000-04-26 | 华强 | Combined use with reference of two category dictionary compress algorithm in data compaction |
| JP2008219264A (en) * | 2007-03-01 | 2008-09-18 | Ntt Communications Kk | Data compression and transfer device, data compression and transfer system, data compressing and transferring method, and data compression and transfer program |
| CN105743509A (en) * | 2016-01-26 | 2016-07-06 | 华为技术有限公司 | Data compression device and method |
| CN112905551A (en) * | 2019-12-04 | 2021-06-04 | 阿里巴巴集团控股有限公司 | Data compression method and device, electronic equipment and computer readable storage medium |
| WO2022198483A1 (en) * | 2021-03-24 | 2022-09-29 | 深圳市大疆创新科技有限公司 | Data compression method and apparatus, movable platform, and storage medium |
| CN115173866A (en) * | 2022-07-14 | 2022-10-11 | 郑州朗灵电子科技有限公司 | Efficient storage method of applet data |
| CN115189696A (en) * | 2022-08-01 | 2022-10-14 | 杭州电子科技大学 | Hardware compression and decompression method based on Huffman decoding table |
| CN115361026A (en) * | 2022-08-24 | 2022-11-18 | 郑州航空工业管理学院 | Adaptive optimization method for LZ series compression algorithm |
| CN115483935A (en) * | 2021-05-31 | 2022-12-16 | 华为技术有限公司 | Data processing method and device |
| CN116542971A (en) * | 2023-07-04 | 2023-08-04 | 山东四季车网络科技有限公司 | Vehicle wheel axle defect identification method |
| CN116722876A (en) * | 2023-08-08 | 2023-09-08 | 北京点聚信息技术有限公司 | Intelligent storage method for user data for format light reading |
| CN116932493A (en) * | 2022-03-30 | 2023-10-24 | 华为技术有限公司 | Data compression method and related device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150356272A1 (en) * | 2014-06-10 | 2015-12-10 | Taipei Medical University | Prescription analysis system and method for applying probabilistic model based on medical big data |
-
2023
- 2023-11-03 CN CN202311451971.3A patent/CN117195005B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1251449A (en) * | 1998-10-18 | 2000-04-26 | 华强 | Combined use with reference of two category dictionary compress algorithm in data compaction |
| JP2008219264A (en) * | 2007-03-01 | 2008-09-18 | Ntt Communications Kk | Data compression and transfer device, data compression and transfer system, data compressing and transferring method, and data compression and transfer program |
| CN105743509A (en) * | 2016-01-26 | 2016-07-06 | 华为技术有限公司 | Data compression device and method |
| CN112905551A (en) * | 2019-12-04 | 2021-06-04 | 阿里巴巴集团控股有限公司 | Data compression method and device, electronic equipment and computer readable storage medium |
| WO2022198483A1 (en) * | 2021-03-24 | 2022-09-29 | 深圳市大疆创新科技有限公司 | Data compression method and apparatus, movable platform, and storage medium |
| CN115483935A (en) * | 2021-05-31 | 2022-12-16 | 华为技术有限公司 | Data processing method and device |
| CN116932493A (en) * | 2022-03-30 | 2023-10-24 | 华为技术有限公司 | Data compression method and related device |
| CN115173866A (en) * | 2022-07-14 | 2022-10-11 | 郑州朗灵电子科技有限公司 | Efficient storage method of applet data |
| CN115189696A (en) * | 2022-08-01 | 2022-10-14 | 杭州电子科技大学 | Hardware compression and decompression method based on Huffman decoding table |
| CN115361026A (en) * | 2022-08-24 | 2022-11-18 | 郑州航空工业管理学院 | Adaptive optimization method for LZ series compression algorithm |
| CN116542971A (en) * | 2023-07-04 | 2023-08-04 | 山东四季车网络科技有限公司 | Vehicle wheel axle defect identification method |
| CN116722876A (en) * | 2023-08-08 | 2023-09-08 | 北京点聚信息技术有限公司 | Intelligent storage method for user data for format light reading |
Non-Patent Citations (4)
| Title |
|---|
| Bidirectional text compression in external memory;Dinklage, P et.al;《arXiv》;第1-19页 * |
| 一种加入时间维的船舶轨迹高效离线压缩算法研究;徐凯;邱家瑜;李燕;;计算机科学(S2);第508-512页 * |
| 基于动态字典和差分编码的计量数据压缩研究;梁捷;蒋雯倩;李金瑾;;信息技术(10);第124-128页 * |
| 基于无损压缩技术的文件压缩与解压系统;郝雪燕;;数码世界(10);第273-274页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117195005A (en) | 2023-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112953550B (en) | Data compression method, electronic device and storage medium | |
| Williams et al. | Compressing integers for fast file access | |
| CN104380267B (en) | Data compression/decompression device | |
| CN103995887A (en) | Bitmap index compressing method and bitmap index decompressing method | |
| CN1183683C (en) | Position adaptive coding method using prefix prediction | |
| CN116303374B (en) | Multi-dimensional report data optimization compression method based on SQL database | |
| CN102122960A (en) | Multi-character combination lossless data compression method for binary data | |
| CN109840585B (en) | Sparse two-dimensional convolution-oriented operation method and system | |
| CN112152634B (en) | Block compression encoding method, device, computer equipment and readable storage medium | |
| CN100583649C (en) | Method and apparatus for encoding/decoding vector as well as flow medium player | |
| CN117195005B (en) | Information data management system based on wisdom carwash | |
| CN108287985A (en) | A kind of the DNA sequence dna compression method and system of GPU acceleration | |
| CN103401569A (en) | Method for blind identification of (n, k and m) system convolutional code | |
| CN115882867B (en) | Data compression storage method based on big data | |
| CN107147947B (en) | Key frame recognition methods and device | |
| CN117278058A (en) | Data acquisition and processing method for climate financing project | |
| CN112434085A (en) | Roaring Bitmap-based user data statistical method | |
| CN109698703B (en) | Gene sequencing data decompression method, system and computer readable medium | |
| CN100343851C (en) | Database compression and decompression method | |
| CN102932001B (en) | Motion capture data compression, decompression method | |
| CN110704408A (en) | Clustering-based time sequence data compression method and system | |
| CN105553483B (en) | A kind of method and device generating LZ77 | |
| CN115567058A (en) | Time sequence data lossy compression method combining prediction and coding | |
| CN112463837B (en) | Relational database data storage query method | |
| CN114996245A (en) | Data compression method applied to cement production big data |
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 |