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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2006

IP address lookup is an important function to meet such requirements as high speed, memory size and low power for the overall…

2006

We introduce two transformations T e x t 2 P o i n t s and P o i n t s 2 T e x t that, respectively, convert text to points in…

2005

In this paper a new clustering operator for evolutionary algorithms is proposed. The operator incorporates the unsupervised k…

2004

In this paper we present an algorithm for efficient personalized clustering. The algorithm combines the orthogonal range search…

2004

We use tries to represent combined text and spatial data, and present a range search algorithm for reporting all 2-d points and…

2004

, In: 9th Symposium on Discrete Algorithms (1998) 658–667 2. Alevizos, P.: An algorithm for orthogonal range search in d > 3…

2000

Primary B-tree, a variant of B-tree structure with row data in leaf blocks, is an ideal storage organization for queries…

1996

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

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…

1981

A simple property of number representations yields a unit cross section relation between points and interval representations…