Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Ackermann functionArray data structureBinary search algorithmCartesian tree

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… 
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… 
2012
2012
A query integrity assurance scheme for accessing outsourced spatial databases
With the trend of cloud computing, outsourcing databases to third party service providers is becoming a common practice for data… 
2012
2012
One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for Web Databases
With the emergence of the deep web, searching web databases in domains such as vehicles, real estate, etc., has become a routine… 
2007
2007
Adaptive Support of Range Queries via Push-Pull Algorithms
In many real time interactive simulations the problem of interest management is that of filtering updates through application… 
2006
2006
FLUX: Content and Structure Matching of XPath Queries with Range Predicates
Range queries seek the objects residing in a constrained region of the data space. An XML range query may impose predicates on… 
2006
2006
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive… 
2003
2003
Indexing High Dimensional Rectangles for Fast Multimedia Identification
This paper addresses the problem of quickly performing point queries against high-dimensional regions. Such queries are useful in… 
Highly Cited
1998
Highly Cited
1998
The R/sub a/*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-data
OLAP applications make use of fast indexes and materialization of data. Most research treats just one topic. Either the… 
1998
1998
Near-Neighbor Query Performance in Search Trees
Near-neighbor search is an increasingly important operation for queries over multimedia, text, and other non-standard datatypes… 
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)