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.


Binary Tree Minimum Space Suffix Array Prefix Code Left Subtree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Brodnik and J. I. Munro, Membership in Constant Time and Minimum Space, Proc. Algorithms — ESA '94, LNCS 855 (1994) 72–81.Google Scholar
  2. 2.
    D. R. Clark, Compact Pat Trees, manuscript, University of Waterloo (1996).Google Scholar
  3. 3.
    D. R. Clark and J. I. Munro, Succinct Representation of Trees, in preparation, University of Waterloo (1996).Google Scholar
  4. 4.
    R. W. Floyd, Algorithm 245: Treesort 3, Communications of the ACM, 7 (1964) 701.Google Scholar
  5. 5.
    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).Google Scholar
  6. 6.
    G. Jacobson, Space Efficient Static Trees and Graphs, Proc. 30th IEEE Symp. on Foundations of Computer Science, (1989) 549–554.Google Scholar
  7. 7.
    G. Jacobson, Succinct Data Structures, Tech. Rpt. CMU-CS-89-112, Carnegie Mellon University (1989).Google Scholar
  8. 8.
    C. C. Lee, D. T. Lee and C. K. Wong, Generating Binary Trees of Bounded Height, Acta Informatica, 23 (1986) 529–544.Google Scholar
  9. 9.
    U. Manber and G. Myers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, 22(5) (1993) 935–948.Google Scholar
  10. 10.
    D. R. Morrison, Patricia — Practical Algorithm to Retrieve Information Coded in Alphnumeric, Journal of the ACM, 15(4) (1968) 514–534.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    J. I. Munro and H. Suwanda, Implicit Data Structures for Fast Search and Update, J. Computer and System Sciences, 21, (1980) 236–250.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    R. Schaffer and R. Sedgewick, The Analysis of Heapsort, Journal of Algorithms, 15(1), (1993) 76–100.Google Scholar
  15. 15.
    P. Weiner, Linear Pattern Match Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, (1973) 1–11.Google Scholar
  16. 16.
    J. W. J. Williams, Algorithm 232, Heapsort, Communications of the ACM, 7 (1964) 347–348.Google Scholar
  17. 17.
    S. Zaks, Lexicographic Generation of Ordered Trees, Theoretical Computer Science, 10(1), (1980) 63–82.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • J. Ian Munro
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations