Exploració per tema "K-dimensional search trees"
Ara es mostren els items 1-1 de 1
-
On the cost of fixed partial match queries in K-d trees
(2016-08-01)
Article
Accés obertPartial 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 ...