Now showing items 1-2 of 2
(University of Waterloo, 2008-02-14)
This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the information-theoretic lower ...
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
(University of Waterloo, 2008-01-23)
The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices ...