CN104682965A - GPS data compression method - Google Patents
GPS data compression method Download PDFInfo
- Publication number
- CN104682965A CN104682965A CN201510126188.9A CN201510126188A CN104682965A CN 104682965 A CN104682965 A CN 104682965A CN 201510126188 A CN201510126188 A CN 201510126188A CN 104682965 A CN104682965 A CN 104682965A
- Authority
- CN
- China
- Prior art keywords
- data
- group
- joint
- character
- compression method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of database processing, in particular to a GPS data compression method which comprises the following steps: S1: rearranging and recombining GPS data to form several data sets, wherein each data set contains M data; S2: in each data set, searching for the longest matched character in a current node of the data in order of a first node to an Nth node of M data; if the longest matched character is found, performing S3 once; or else, performing S4 once; S3: outputting a binary dictionary set (L, V), then sliding L+1 characters backward, repeating S2 once until the current nodes of all data are searched; performing S2 in the next node of the data; S4: outputting a character set (M, K) by taking the current nodes of M data as one unit, sliding one node backward, repeating S2 once, wherein V is the content of a character, L is the length of a character, K is the content of all characters of a node. The GPS data compression method can effectively improve the compression rate of the data, and has a strong practical value.
Description
Technical field
The present invention relates to database processing technical field, especially a kind of compression method of gps data.
Background technology
Along with the development of science and technology, GPS is extensively more next in the application of every field, embedded devices such as such as vehicle, mobile phone, aviation, Internet of Things, car networking or have in the field of embedded device; But the amount of GPS data of standard is very huge, and it needs jumbo hardware device to support, so just drastically increases the cost of embedded device; Simultaneously, existing gps data generally all adopts relation data library storage, when the memory space running into signal disturbing, underfed, network failure or gps data storehouse server acquires a certain degree, the operation of relational database will become slowly, cause the utilization ratio of database server seriously to reduce, thus have impact on the storage of further data.
Therefore, it is very necessary for compressing the embedded device in every field or industry gps data.
Summary of the invention
For the deficiency that above-mentioned prior art exists, the object of the present invention is to provide that a kind of step is simple, data compression rate is high, what gps data can be made to be more prone to be embedded in embedded device and to be beneficial to the compression method of the gps data of the cost reducing embedded device.
To achieve these goals, the present invention adopts following technical scheme:
A compression method for gps data, it comprises the following steps:
S1: permutation and combination is re-started to gps data, to form several data groups, each described data group all comprises M data; S2: in each described data group, with the head of M data save to N joint for sequence open find between each data when coupling character the longest in prosthomere; If found, then perform a S3; Otherwise, perform a S4;
S3: after exporting binary dictionary group (L, V), then slide backward L+1 character, repeat a S2, until the prosthomere of working as between each data is found complete; S2 is performed in next joint again between each data;
S4: with M data when prosthomere be that a unit exports a binary symbols group (M, K), slide backward a joint, repeat a S2;
Wherein, V is the content of a certain character, and L is the length of a certain character, and K is the content of the alphabet of a certain joint.
Preferably, in described S1, by M the data permutation combination to have identical characters in head joint to N joint, to form a data group.
Preferably, in described S1, M=9.
Preferably, in described S3, if there is individual identical binary dictionary group (M, V) of continuous print X, then export binary dictionary group (X*M, V) after X binary dictionary group (M, V) being merged.
Preferably, in described S4, if there is continuous print Y binary symbols group (M, K), then export after Y binary symbols group (M, K) being merged a Y+1 unit dictionary group (Y*M, K, K ', K 〞 ... K
n); Wherein, content, the K 〞 of the alphabet of K ' next joint that is a certain joint ... K
nthe like.
Owing to have employed such scheme, after the data of storage are carried out rearranging combination by the present invention, then each data cell (i.e. data group) is encoded (namely forming dictionary table), the compression ratio of data can be improved with this; Empirical tests, for the gps data of the national traffic lights of 50M, utilizes said method to compress, within being compressible to 3M, thus gps data can be embedded in embedded device easily, be conducive to the cost saving embedded device, and drastically increase the reading speed of gps data.
Embodiment
Below embodiments of the invention are described in detail, but the multitude of different ways that the present invention can be defined by the claims and cover is implemented.
The compression method of the gps data of the present embodiment, it comprises the following steps:
Step S1: permutation and combination is re-started to gps data, to form several data groups, each data group all comprises M data;
Step S2: in each data group, with the head of M data save to N joint for sequence open find between each data when coupling character the longest in prosthomere; If found, then perform a step S3; Otherwise, perform a step S4;
Step S3: after exporting binary dictionary group (L, V), then slide backward L+1 character, repeat a step S2, until the prosthomere of working as between each data is found complete; In next joint again between each data, step performs S2;
Step S4: with M data when prosthomere be that a unit exports a binary symbols group (M, K), slide backward a joint, repeat a step S2;
In above-mentioned steps, V is the content of a certain character, and L is the length (or number) of a certain character, and K is the content of the alphabet of a certain joint.
Based on above-mentioned steps, after the data of storage are carried out rearranging combination by the present invention, then each data cell (i.e. data group) is encoded (namely forming dictionary table), the compression ratio of data can be improved with this; Empirical tests, for the gps data of the national traffic lights of 50M, utilizes said method to compress, within being compressible to 3M, thus gps data can be embedded in embedded device easily, be conducive to the cost saving embedded device, and drastically increase the reading speed of gps data.
Owing to there is a lot of general character (the former joint characters in such as each data are identical) in many gps datas, therefore for improving efficiency in subsequent step, in step sl, adopt and carry out rearranging combination to form a data group with the data (amount to M) in head joint to N joint with identical characters; If raw GPS data is following data:
A1B1C1，D1E1F1，G1H1I 1………AnBnCn，DnEnFn，GnHnIn；
Carry out combination with following formation to distribute:
A1B1C1，A2B2C2………A9B9C9………AnBnCn；
D1E1F1，D2E2F2………D9E9F9………DnEnFn；
G1H1I1,G2H2I2………G9H9I9………GnHnIn；
Thus the following data group of final generation:
A1…A9…An B1…B9…Bn C1…C9…Cn；
D1…D9…Dn E1…E9…En F1…F9…Fn；
G1…G9…Gn H1…H9…Hn I1…I9…In。
For improving data compression rate further, in step sl, M=9, namely forms a data group with 9 data.
Further, for strengthening the integration of data, be convenient to encode to each data group, in step s3, if there is individual identical binary dictionary group (M, V) of continuous print X, then by X binary dictionary group (M, V) binary dictionary group (X*M, V) is exported after merging.
In like manner, in step s 4 which, if there is continuous print Y binary symbols group (M, K), then export after Y binary symbols group (M, K) being merged a Y+1 unit dictionary group (Y*M, K, K ', K 〞 ... K
n); Wherein, content, the K 〞 of the alphabet of K ' next joint that is a certain joint ... K
nthe like.
For superiority of the present invention is described more intuitively, for the data group of shown in table one,
Known by table one, the character of former joints of each data is identical, therefore in step sl, data is carried out rearranging combination, forms a data group, as follows:
111111111 111111111 666666666 444444444 000000000
777777888 456789012 12345567；
After execution of step S2, can according to find character string: 111,111,111 111111111, in step s3 export a binary dictionary group (18,1), then slide backward 19 characters, search out character string: 666666666, then export a binary dictionary group (9,6), by that analogy can according to character string: 000000000 and 77777888 export three binary dictionary groups, namely corresponding (9,0), (6,7) and (3,8).Until, search out character string 456789012 and 12345567, find not find identical character in corresponding joint, therefore perform step S4, export a binary symbols group (18,456789012,12345567).With this, the compression of data can be completed, and form the data storage method shown in table two, as follows:
The foregoing is only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every utilize specification of the present invention and content to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in other relevant technical fields, be all in like manner included in scope of patent protection of the present invention.
Claims (5)
1. a compression method for gps data, is characterized in that, it comprises the following steps:
S1: permutation and combination is re-started to gps data, to form several data groups, each described data group all comprises M data;
S2: in each described data group, with the head of M data save to N joint for sequence open find between each data when coupling character the longest in prosthomere; If found, then perform a S3; Otherwise, perform a S4;
S3: after exporting binary dictionary group (L, V), then slide backward L+1 character, repeat a S2, until the prosthomere of working as between each data is found complete; S2 is performed in next joint again between each data;
S4: with M data when prosthomere be that a unit exports a binary symbols group (M, K), slide backward a joint, repeat a S2;
Wherein, V is the content of a certain character, and L is the length of a certain character, and K is the content of the alphabet of a certain joint.
2. the compression method of a kind of gps data as claimed in claim 1, is characterized in that: in described S1, by M the data permutation combination to have identical characters in head joint to N joint, to form a data group.
3. the compression method of a kind of gps data as claimed in claim 2, is characterized in that: in described S1, M=9.
4. the compression method of a kind of gps data according to any one of claim 1-3, it is characterized in that: in described S3, if there is the individual identical binary dictionary group (M of continuous print X, V), then by X binary dictionary group (M, V) binary dictionary group (X*M, V) is exported after merging.
5. the compression method of a kind of gps data as claimed in claim 4, it is characterized in that: in described S4, if there is continuous print Y binary symbols group (M, K), Y+1 unit dictionary group (Y*M, a K is exported after then Y binary symbols group (M, K) being merged, K ', K 〞 ... K
n); Wherein, content, the K 〞 of the alphabet of K ' next joint that is a certain joint ... K
nthe like.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510126188.9A CN104682965A (en) | 2015-03-20 | 2015-03-20 | GPS data compression method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510126188.9A CN104682965A (en) | 2015-03-20 | 2015-03-20 | GPS data compression method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104682965A true CN104682965A (en) | 2015-06-03 |
Family
ID=53317620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510126188.9A Pending CN104682965A (en) | 2015-03-20 | 2015-03-20 | GPS data compression method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104682965A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847174A (en) * | 2016-04-25 | 2016-08-10 | 哈尔滨理工大学 | Data compression transmission method based on air-ground integration car networking system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1737791A (en) * | 2005-09-08 | 2006-02-22 | 无敌科技(西安)有限公司 | Data compression method by finite exhaustive optimization |
| CN101241508A (en) * | 2007-08-01 | 2008-08-13 | 金立 | Structured data sequence compression method |
| CN102521363A (en) * | 2011-12-15 | 2012-06-27 | 武汉达梦数据库有限公司 | Column partition based numerical data compression method for column storage database |
-
2015
- 2015-03-20 CN CN201510126188.9A patent/CN104682965A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1737791A (en) * | 2005-09-08 | 2006-02-22 | 无敌科技(西安)有限公司 | Data compression method by finite exhaustive optimization |
| CN101241508A (en) * | 2007-08-01 | 2008-08-13 | 金立 | Structured data sequence compression method |
| CN102521363A (en) * | 2011-12-15 | 2012-06-27 | 武汉达梦数据库有限公司 | Column partition based numerical data compression method for column storage database |
Non-Patent Citations (1)
| Title |
|---|
| 周桂宇 等: ""改进的混合压缩算法在GPS数据压缩中的应用"", 《计算机应用与软件》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847174A (en) * | 2016-04-25 | 2016-08-10 | 哈尔滨理工大学 | Data compression transmission method based on air-ground integration car networking system |
| CN105847174B (en) * | 2016-04-25 | 2018-09-11 | 哈尔滨理工大学 | A kind of data compression transmission method based on the empty integrated car networking system in land |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103236847A (en) | Multilayer Hash structure and run coding-based lossless compression method for data | |
| CN106407201A (en) | Data processing method and apparatus | |
| CN104317966A (en) | Dynamic indexing method applied to quick combined querying of big electric power data | |
| CN106067824A (en) | A kind of sequencing data compression method based on bigeminy codon | |
| CN103678550A (en) | Mass data real-time query method based on dynamic index structure | |
| CN101751416A (en) | Method for ordering and seeking character strings | |
| CN105302915B (en) | The high-performance data processing system calculated based on memory | |
| CN105589908A (en) | Association rule computing method for transaction set | |
| CN102023978B (en) | Mass data processing method and system | |
| Li et al. | Building fast and compact sketches for approximately multi-set multi-membership querying | |
| CN104102680A (en) | Coding indexing mode for time sequences | |
| CN104682965A (en) | GPS data compression method | |
| CN106844445A (en) | Based on semantic resource description framework RDF graph division methods | |
| CN103699646B (en) | Tagging reversible compression method for binary data | |
| CN103345536B (en) | A kind of semantic association indexing means | |
| CN105049064A (en) | Pipeline polar code encoder | |
| CN105373846A (en) | Oil gas gathering and transferring pipe network topological structure intelligent optimization method based on grading strategy | |
| CN110389953B (en) | Data storage method, storage medium, storage device and server based on compression map | |
| US20200142897A1 (en) | High-dimensional data nearest-neighbor query method based on variable-length hash codes | |
| CN103761298A (en) | Distributed-architecture-based entity matching method | |
| CN109213751B (en) | Spark platform based Oracle database parallel migration method | |
| CN103744899A (en) | Distributed environment based mass data rapid classification method | |
| CN104581734A (en) | Network community dividing method and device | |
| Viola et al. | How to store a random walk | |
| CN115982436A (en) | Efficient retrieval and compression system and compression method for stream data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150603 |