Skip to search formSkip to main contentSkip to account menu

Range query (database)

Known as: Range query 
A range query is a common database operation that retrieves all records where some value is between an upper and lower boundary. For example, list… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Column-oriented DBMSDatabaseRow (database)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
ServeDB: Secure, Verifiable, and Efficient Range Queries on Outsourced Database
Data outsourcing to cloud has been a common IT practice nowadays due to its significant benefits. Meanwhile, security and privacy… 
Highly Cited
2017
Highly Cited
2017
Two-Cloud Secure Database for Numeric-Related SQL Range Queries With Privacy Preserving
Industries and individuals outsource database to realize convenient and low-cost applications and services. In order to provide… 
Highly Cited
2008
Highly Cited
2008
The optimal sequenced route query
Real-world road-planning applications often result in the formulation of new variations of the nearest neighbor (NN) problem… 
Highly Cited
2004
Highly Cited
2004
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
Highly Cited
2004
Highly Cited
2004
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be… 
Highly Cited
2002
Highly Cited
2002
Scalable, efficient range queries for grid information services
Recent peer-to-peer (P2P) systems such as Tapestry, Chord or CAN act primarily as a distributed hash table (DHT). A DHT is a data… 
Highly Cited
1999
Highly Cited
1999
The string B-tree: a new data structure for string search in external memory and its applications
We introduce a new text-indexing data structure, the String B-Tree, that can be seen as a link between some traditional external… 
Highly Cited
1998
Highly Cited
1998
The pyramid-technique: towards breaking the curse of dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The Pyramid-Technique is… 
Highly Cited
1986
Highly Cited
1986
Epsilon-nets and simplex range queries
We present a new technique for half-space and simplex range query using <italic>&Ogr;</italic>(<italic>n</italic>) space and… 
Highly Cited
1983
Highly Cited
1983
Filtering search: A new approach to query-answering
  • B. Chazelle
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
  • Corpus ID: 10622624
We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a… 
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)