Compressed dictionaries: Space measures, data sets, and experiments
Document Type
Article
Publication Date
January 2006
DOI
http://dx.doi.org/10.1007/11764298_14
Abstract
In this paper, we present an experimental study of the spacetime tradeoffs for the dictionary problem, where we design a data structure to represent set data, which consist of a subset S of n items out of a universe U = {0, 1,...,u − 1} supporting various queries on S. Our primary goal is to reduce the space required for such a dictionary data structure. Many compression schemes have been developed for dictionaries, which fall generally in the categories of combinatorial encodings and data-aware methods and still support queries efficiently. We show that for many (real-world) datasets, data-aware methods lead to a worthwhile compression over combinatorial methods. Additionally, we design a new data-aware building block structure called BSGAP that presents improvements over other data-aware methods.
Recommended Citation
"Compressed dictionaries: Space measures, data sets, and experiments" / (2006): -.
Available at https://digitalcommons.butler.edu/facsch_papers/1113