Abstract
In representing a subset of a large finite set, or an index for text search, one is faced with the need for both time and space efficiency. In this paper, we look at some approaches that have been applied to these problems to represent objects in near minimum space and still permit queries to be performed in constant time. It is hoped that this paper will draw attention to techniques for representing large (mostly static) structures.
Cite
CITATION STYLE
Munro, J. I. (1996). Tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 37–42). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
