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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In this paper, we study the problem of supporting multidimensional range queries on encrypted data. The problem is motivated by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Among the open problems in P2P systems, support for nontrivial search predicates, standardized query languages, distributed query… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Database outsourcing is an emerging data management paradigm which has the potential to transform the IT operations of… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is specified by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A database is said to allow range restrictions if one may request that only records with some specified field in a specified… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
1978
Highly Cited
1978
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… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queries… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.4
  • figure 3.5
  • figure 5.1
Is this relevant?