Browsing Faculty of Graduate Studies Online Theses by Subject "path queries"

Now showing items 1-2 of 2

  • Data Structures for Colored Counting in Grids and Trees 

    Gao, Younan (2023-08-31)
    In this thesis, we design data structures for colored counting queries. First, we consider the colored 2D orthogonal range counting problem and present four different time-space tradeoffs. Second, we consider the batched ...

  • DATA STRUCTURES FOR GEOMETRIC RETRIEVAL IN TREE-LIKE TOPOLOGIES 

    Kazi, Serikzhan (2020-12-21)
    This thesis studies the generalizations of orthogonal range searching to the case in which one of the dimensions is replaced with a tree topology. We design data structures for efficient support of path queries, which ...