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.
Highly Cited
2018
Highly Cited
2018
vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases
Blockchains have recently been under the spotlight due to the boom of cryptocurrencies and decentralized applications. There is… 
Highly Cited
2011
Highly Cited
2011
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
We further the study of order-preserving symmetric encryption (OPE), a primitive for allowing efficient range queries on… 
Highly Cited
2009
Highly Cited
2009
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our… 
Highly Cited
2007
Highly Cited
2007
Using a distributed quadtree index in peer-to-peer networks
Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these… 
Highly Cited
2003
Highly Cited
2003
Flexible information discovery in decentralized distributed systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important… 
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
2002
Highly Cited
2002
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
Many recent database applications need to deal with similarity queries. For such applications, it is important to measure the… 
Highly Cited
1999
Highly Cited
1999
An efficient bitmap encoding scheme for selection queries
Bitmap indexes are useful in processing complex queries in decision support systems, and they have been implemented in several… 
Highly Cited
1995
Highly Cited
1995
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier… 
Highly Cited
1978
Highly Cited
1978
A data structure for orthogonal range queries
  • G. S. Lueker
  • 19th Annual Symposium on Foundations of Computer…
  • 1978
  • Corpus ID: 14970942
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… 
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)