The values of the other tags change ery slowly, and Brother Cell Phone List users can allow accuracy of data loss within a certain range. Data compression in process real-time/historical databases is a very important technology since it can save massive Brother Cell Phone List amounts of space and can aid in query speed. The CHANGE (0) Compression Algorithm is available for any type of variable compression. It only detects the time-out of compression and verifes the same value detection. It stores the value when a variable has changed. It does Brother Cell Phone List not store a variale if nothing has changed.
For any kind of compression algorithm, the first step Brother Cell Phone List is to check the time and the quality stamp. The principle of dead banding compression algorithm is very simple. It stores the data when the change in value change reaches a certain threshold. For many variables that change slowly in the actual production process, it can Brother Cell Phone List dramatically reduce the amount of data stored. The swinging door compression algorithm was first proposed by OSI Soft PI. The algorithm s relatively simple and PI opened the Brother Cell Phone List entire algorithm to the public.
Now, almost all process historian databases have Brother Cell Phone List adopted this compression algorithm, and have added new technologies in with it to make it more optimal. The principle of the swinging door algorithm judges whether a data point Brother Cell Phone List needs to be saved. It draws a straight line between data from a previous saved point P to the next data point N. It checks the absolute bias of those data points (including A) between Brother Cell Phone List two points (P, N) and the data points on that line corresponding to the time stamp.