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
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… 
2012
2012
HSQL: A Highly Scalable Cloud Database for Multi-user Query Processing
With the ever increasing size of data sets, traditional parallel relational database solution can be prohibitively expensive and… 
2008
2008
Efficient Maintenance of Continuous Queries for Trajectories
We address the problem of optimizing the maintenance of continuous queries in Moving Objects Databases, when a set of pending… 
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
Probabilistic range queries in moving objects databases with uncertainty
This work addresses the issue of answering spatio-temporal range queries when there is uncertainty associated with the model of… 
Highly Cited
2001
Highly Cited
2001
Applying the golden rule of sampling for query estimation
Query size estimation is crucial for many database system components. In particular, query optimizers need efficient and accurate… 
Highly Cited
2001
Highly Cited
2001
Database techniques for archival of solid models
This paper presents techniques for managing solid models in modern relational database management systems. Our goal is to enable… 
1996
1996
Query Processing Techniques for Multiversion Access Methods
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where… 
Review
1996
Review
1996
A uniform indexing scheme for object-oriented databases
  • E. Gudes
  • Proceedings of the Twelfth International…
  • 1996
  • Corpus ID: 8542138
The performance of object oriented databases (OODB) is a critical factor hindering their current use. Several indexing schemes… 
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)