Abstract
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.
This research was partially supported by NSERC and MRI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adelson-Velskii, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet Math. Doklady 3, 1259–1263 (1962)
Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science 382(2), 86–96 (2007)
Bose, P., Douieb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106–1114 (2008)
Franceschini, G., Grossi, R.: Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. In: SODA 2003: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 670–678 (2003)
Franceschini, G., Grossi, R.: Optimal worst-case operations for implicit cache-oblivious search trees. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 114–126. Springer, Heidelberg (2003)
Franceschini, G., Munro, J.I.: Implicit dictionaries with O(1) modifications per update and fast search. In: SODA 2006: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 404–413 (2006)
Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS 1978: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pp. 8–21 (1978)
Iacono, J.: Alternatives to splay trees with O(log n) worst-case access times. In: SODA 2001: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 516–522 (2001)
Iacono, J., Langerman, S.: Queaps. Algorithmica 42(1), 49–56 (2005)
Ian Munro, J.: An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. J. Comput. Syst. Sci. 33(1), 66–74 (1986)
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bose, P., Howat, J., Morin, P. (2009). A Distribution-Sensitive Dictionary with Low Space Overhead. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)