Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Range query (data structures)

Known as: Range Queries 
In data structures, a range query consists of preprocessing some input data into a data structure to efficiently answer any number of queries on any… Expand
Wikipedia

Related topics

Related topics

12 relations
Ackermann functionArray data structureBinary search algorithmCartesian tree
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Fractional cascading: I. A data structuring technique
In computational geometry many search problems and range queries can be solved by performing an iterative search for the same key… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
Mercury: supporting scalable multi-attribute range queries
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2003
Highly Cited
2003
Multi-dimensional range queries in sensor networks
In many sensor networks, data or events are named by attributes. Many of these attributes have scalar values, so one natural way… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2003
Highly Cited
2003
A General Model for Authenticated Data Structures
Abstract Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1997
Highly Cited
1997
Range queries in OLAP data cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is specified by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Highly Cited
1995
Highly Cited
1995
Nearest neighbor queries
A frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given… Expand
  • figure 5
Highly Cited
1987
Highly Cited
1987
ɛ-nets and simplex range queries
AbstractWe demonstrate the existence of data structures for half-space and simplex range queries on finite point sets ind… Expand
  • figure 1
Highly Cited
1985
Highly Cited
1985
New Data Structures for Orthogonal Range Queries
Consider a set of N records corresponding to points in k-dimensional space ($k \geqq 2$). This article introduces one new data… Expand
Highly Cited
1984
Highly Cited
1984
A class of data structures for associative searching
By interleaving the bits of the binary representations of the attribute values in a tuple, an integer corresponding to the tuple… Expand
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1978
Highly Cited
1978
A data structure for orthogonal range queries
  • G. S. Lueker
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
    • Corpus ID: 14970942
Given a set of points in a d-dimensional space, an orthogonal range query is a request for the number of points in a specified d… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE