Skip to search formSkip to main contentSkip to account menu

Range searching

Known as: Range search 
In its most general form, the range searching problem consists of preprocessing a set S of objects, in order to determine which objects from S… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
ACM Computing SurveysAll nearest smaller valuesCartesian treeComputational geometry

Broader (1)

Database theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Space-efficient representations of rectangle datasets supporting orthogonal range querying
2011
2011
High performance hardware architecture for constrained one-bit transform based motion estimation
Motion estimation (ME) processes is considered as the most computationally intensive part of the conventional video compression… 
2010
2010
Bichromatic Reverse Nearest-Neighbor Search in Mobile Systems
In traditional reverse nearest-neighbor (RNN) search, the goal is to find the set of interest objects taking the query object as… 
2007
2007
Terminating Spatial Hierarchies by A Priori Bounding Memory
We consider the efficient top-down construction of spatial hierarchies for accelerating ray tracing and present a new termination… 
2005
2005
Online B-tree merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous… 
2001
2001
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
In this work we present the average-case analysis of orthogonal range search for several multidimensional data structures. We… 
1996
1996
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
k-RP*s is a new data structure for scalable multicomputer files with multi-attribute (k-d) keys. We discuss the k-RP*s file… 
1992
1992
Evaluation of software
AC 228 1 5.33 0.86 0.83 FP LB AC 228 2 5.61 0.96 0.83 FP LB BA 140 3 10.00 ND LB BE 7 2 5.26 0.66 0.90 5.10 1.03 A LB CE 141 3 1… 
1986
1986
Halfspace range search: An algorithmic application ofk-sets
Given a fixed setS ofn points inE3 and a query planeπ, the halfspace range search problem asks for the retrieval of all points… 
Review
1985
Review
1985
Multikey retrieval from K-d trees and QUAD-trees
Associative file structures are potentiallv valuable for many database and artificial lntelllgence applications, but very 11tt1e… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)