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.
2015
2015
A Secure Collusion-Aware and Probability-Aware Range Query Processing in Tiered Sensor Networks
With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an… 
2015
2015
SFB: a scalable method for handling range queries on Skip Graphs
Skip Graph is a promising candidate algorithm for large scale distributed systems. The principal feature is range query… 
2012
2012
Key Formulation Schemes for Spatial Index in Cloud Data Managements
Due to the flexibility and scalability in cloud computing, cloud computing nowadays plays an important role to handle a large… 
2006
2006
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the… 
2006
2006
A cubic-wise balance approach for privacy preservation in data cubes
2003
2003
Categorical Range Queries in Large Databases
In this paper, we introduce the categorical (a.k.a. chromatic) range queries (CRQs) in the context of large, disk-resident data… 
2001
2001
Indexing Techniques for Power Management in Multi-Attribute Data Broadcast
In this paper, we discuss the power conservative indexing techniques for managing multi-attribute data broadcast on wireless… 
1996
1996
Parallelizing a GIS on a Shared Address Space Architecture
We are developing a high-performance GIS (our term for a parallel GIS) on an SGI Challenge, a 16-processor machine with a shared… 
1992
1992
Applications of the fusion tree method to computational geometry and searching
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting… 
1982
1982
Computing the relative neighborhood graph in the L1 and Linfinity metrics
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)