The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the actual time required. Distribution-sensitive data structures attempt to take advantage of underlying patterns in a sequence of operations in order to reduce time complexity, since access patterns are non-random in many applications. Unfortunately, many of the distribution- sensitive structures in the literature require a great deal of space overhead in the form of pointers. We present a dictionary data structure that makes use of both randomization and existing space-efficient data structures to yield very low space overhead while maintaining distribution sensitivity in the expected sense.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-642-03367-4_10
Citation
Bose, P, Howat, J. (John), & Morin, P. (2009). A distribution-sensitive dictionary with low space overhead. doi:10.1007/978-3-642-03367-4_10