dc.creatorGarcia, Vinicius Fulber
dc.creatorMergen, Sergio Luis Sardi
dc.date2016-10-11
dc.date.accessioned2023-09-27T19:45:49Z
dc.date.available2023-09-27T19:45:49Z
dc.identifierhttps://periodicos.ufsm.br/coming/article/view/22772
dc.identifier10.5902/2448190422772
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8941714
dc.descriptionColumn 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.formatapplication/pdf
dc.languageeng
dc.publisherUniversidade Federal de Santa Mariapt-BR
dc.relationhttps://periodicos.ufsm.br/coming/article/view/22772/pdf
dc.rightsCopyright (c) 2016 Revista ComInG - Communications and Innovations Gazettept-BR
dc.sourceRevista ComInG - Communications and Innovations Gazette; v. 1 n. 2 (2016): Segunda Edição; 61-73pt-BR
dc.source2448-1904
dc.source2448-1904
dc.subjectcompressionen-US
dc.subjectcolumn oriented databasesen-US
dc.titleCompression of Very Sparse Column Oriented Dataen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución