Browsing Theses by Subject "Data Structures"
Now showing items 1-6 of 6
-
Efficient Evaluation of Set Expressions
(University of Waterloo, 2014-04-17)In this thesis, we study the problem of evaluating set expressions over sorted sets in the comparison model. The problem arises in the context of evaluating search queries in text database systems; most text search engines ... -
In-Memory Storage for Labeled Tree-Structured Data
(University of Waterloo, 2017-03-16)In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size ... -
Path Queries in Weighted Trees
(University of Waterloo, 2012-08-24)Trees are fundamental structures in computer science, being widely used in modeling and representing different types of data in numerous computer applications. In many cases, properties of objects being modeled are ... -
Solving Geometric Problems in Space-Conscious Models
(University of Waterloo, 2009-01-26)When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In particular, in-place algorithms, multi-pass algorithms, ... -
Space Efficient Data Structures and Algorithms in the Word-RAM Model
(University of Waterloo, 2018-04-30)In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement is an important research topic. One way ... -
Towards the Efficient Generation of Gray Codes in the Bitprobe Model
(University of Waterloo, 2016-05-13)We examine the problem of representing integers modulo L so that both increment and decrement operations can be performed efficiently. This problem is studied in the bitprobe model, where the complexity of the underlying ...