Publication | Closed Access
Dictionary-based order-preserving string compression for main memory column stores
142
Citations
23
References
2009
Year
Unknown Venue
Lightweight Compression SchemeRelational DatabaseEngineeringComputer ArchitectureString-searching AlgorithmInformation RetrievalData ScienceDatabase SystemManagementData IntegrationParallel ComputingBig DataData ManagementLossless CompressionBusiness Intelligence ApplicationsComputer EngineeringComputer ScienceColumn-oriented Database SystemsDatabase TechnologyData CompressionDatabase TheoryQuery OptimizationRelational QueriesParallel ProgrammingData Modeling
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and business intelligence applications. Moreover, recent work [1, 24] has shown that lightweight compression schemes significantly improve the query processing performance of these systems. One such a lightweight compression scheme is to use a dictionary in order to replace long (variable-length) values of a certain domain with shorter (fixedlength) integer codes. In order to further improve expensive query operations such as sorting and searching, column-stores often use order-preserving compression schemes.
| Year | Citations | |
|---|---|---|
Page 1
Page 1