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.
This work was supported by the Natural Science and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Brodnik and J. I. Munro, Membership in Constant Time and Minimum Space, Proc. Algorithms — ESA '94, LNCS 855 (1994) 72–81.
D. R. Clark, Compact Pat Trees, manuscript, University of Waterloo (1996).
D. R. Clark and J. I. Munro, Succinct Representation of Trees, in preparation, University of Waterloo (1996).
R. W. Floyd, Algorithm 245: Treesort 3, Communications of the ACM, 7 (1964) 701.
G. H. Gonnet, R. A. Baeza-Yates and T. Snider, Lexicographic Indices for Text: Inverted Files vs. Pat Trees, Tech. Rpt. OED-91-01, Centre for the New OED, University of Waterloo (1991).
G. Jacobson, Space Efficient Static Trees and Graphs, Proc. 30th IEEE Symp. on Foundations of Computer Science, (1989) 549–554.
G. Jacobson, Succinct Data Structures, Tech. Rpt. CMU-CS-89-112, Carnegie Mellon University (1989).
C. C. Lee, D. T. Lee and C. K. Wong, Generating Binary Trees of Bounded Height, Acta Informatica, 23 (1986) 529–544.
U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, 22(5) (1993) 935–948.
D. R. Morrison, Patricia — Practical Algorithm to Retrieve Information Coded in Alphnumeric, Journal of the ACM, 15(4) (1968) 514–534.
J. I. Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log 2n) Time, J. Computer and System Sciences, 33, (1986) 66–74.
J. I. Munro and H. Suwanda, Implicit Data Structures for Fast Search and Update, J. Computer and System Sciences, 21, (1980) 236–250.
R. C. Read, The Coding of Various Kinds of Unlabelled Trees, In R. C. Read (ed.) Graph Theory and Computing, Academic Press, (1972) 153–182.
R. Schaffer and R. Sedgewick, The Analysis of Heapsort, Journal of Algorithms, 15(1), (1993) 76–100.
P. Weiner, Linear Pattern Match Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, (1973) 1–11.
J. W. J. Williams, Algorithm 232, Heapsort, Communications of the ACM, 7 (1964) 347–348.
S. Zaks, Lexicographic Generation of Ordered Trees, Theoretical Computer Science, 10(1), (1980) 63–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munro, J.I. (1996). Tables. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_35
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive