Abstract | ||
---|---|---|
Traditional compression algorithms appear to be largely unsuccessful with regards to short strings. In developing countries without connectivity to the web and data infrastructure, SMS remains one of the few ways of handling text-based information. With SMS service providers typically charging for SMS messages on a per-message basis, there exists a need to provide some form of short string compression, specifically with regards to highly structured data. This paper seeks to answer whether or not dictionary structures produce better results of compression than traditional algorithms with respect to highly structured data. To determine whether or not this approach would work, we developed a configurable parser that, when properly configured, accepts the various forms of structured data as provided by the client. We then compare the results to traditional compression mechanisms and measure the success. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1145/3001913.3006636 | ACM DEV |
Field | DocType | Citations |
Short Message Service,Data mining,Existential quantification,Computer science,Service provider,Parsing,Data compression,Data model,Multimedia,Concatenated SMS | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roshan Ramankutty | 1 | 0 | 0.34 |
Silvia M. Figueira | 2 | 320 | 75.28 |