dc.creator | Garcia, Vinicius Fulber | |
dc.creator | Mergen, Sergio Luis Sardi | |
dc.date | 2016-10-11 | |
dc.date.accessioned | 2023-09-27T19:45:49Z | |
dc.date.available | 2023-09-27T19:45:49Z | |
dc.identifier | https://periodicos.ufsm.br/coming/article/view/22772 | |
dc.identifier | 10.5902/2448190422772 | |
dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8941714 | |
dc.description | Column oriented databases store columns contiguously on disk. The adjacency of values from the same domain leads to a reduced information entropy. Consequently, compression algorithms are able to achieve better results. Columns whose values have a high cardinality are usually compressed using variations of the LZ method. In this paper, we consider the usage of simpler methods based on run-length and symbols probability in scenarios where datasets are very sparse. Our experiments show in which cases the simple methods evaluated provide promising results. | en-US |
dc.format | application/pdf | |
dc.language | eng | |
dc.publisher | Universidade Federal de Santa Maria | pt-BR |
dc.relation | https://periodicos.ufsm.br/coming/article/view/22772/pdf | |
dc.rights | Copyright (c) 2016 Revista ComInG - Communications and Innovations Gazette | pt-BR |
dc.source | Revista ComInG - Communications and Innovations Gazette; v. 1 n. 2 (2016): Segunda Edição; 61-73 | pt-BR |
dc.source | 2448-1904 | |
dc.source | 2448-1904 | |
dc.subject | compression | en-US |
dc.subject | column oriented databases | en-US |
dc.title | Compression of Very Sparse Column Oriented Data | en-US |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |