On k-d Range Search with Patricia Tries
type: Item
instance of: scholarly article
title: On k-d Range Search with Patricia Tries
zbMATH Open document ID: 1225.68083
DOI: 10.1137/060653780
author: Bradford G. Nickerson
author: Qingxiu Shi
published in: SIAM Journal on Computing
publication date: 2008-10-28T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 5358290
zbMATH Keywords: orthogonal range search
zbMATH Keywords: Patricia trie
zbMATH Keywords: approximate range search
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1137/060653780
OpenAlex ID: W2070759438
Recommended article: ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH
Recommended article: \(d\)-dimensional range search on multicomputers
Recommended article: Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Recommended article: On the difficulty of range searching
Recommended article: Analysis of range search for random \(k-d\) trees
Recommended article: Quasi-optimal range searching in spaces of finite VC-dimension
Recommended article: Lower Bounds on the Complexity of Polytope Range Searching
Recommended article: Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
Recommended article: Halfspace range search: An algorithmic application of k-sets
description: scientific article; zbMATH DE number 5358290