Now showing items 1-1 of 1

    • On the cost of fixed partial match queries in K-d trees 

      Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado (2016-08-01)
      Open Access
      Partial match queries constitute the most basic type of associative queries in multidimensional data structures such as K-d trees or quadtrees. Given a query q=(q0,…,qK-1) where s of the coordinates are specified and K-s ...