Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,715 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Ackermann function
Array data structure
Binary search algorithm
Cartesian tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Key Formulation Schemes for Spatial Index in Cloud Data Managements
Ya-Ting Hsu
,
Yi-Chin Pan
,
Ling-Yin Wei
,
Wen-Chih Peng
,
Wang-Chien Lee
IEEE 13th International Conference on Mobile Data…
2012
Corpus ID: 18650210
Due to the flexibility and scalability in cloud computing, cloud computing nowadays plays an important role to handle a large…
Expand
2012
2012
One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for Web Databases
Aditya Telang
,
Chengkai Li
,
Sharma Chakravarthy
IEEE Transactions on Knowledge and Data…
2012
Corpus ID: 4651571
With the emergence of the deep web, searching web databases in domains such as vehicles, real estate, etc., has become a routine…
Expand
2008
2008
An Adequate Design for Large Data Warehouse Systems: Bitmap index versus B-tree index
Morteza Zaker
,
S. Phon-Amnuaisuk
,
S. Haw
2008
Corpus ID: 11876982
Although creating indexes on database is usually regarded as a common issue, it plays a key role in the query performance…
Expand
2007
2007
Adaptive Support of Range Queries via Push-Pull Algorithms
R. Minson
,
G. Theodoropoulos
Workshop on Parallel and Distributed Simulation
2007
Corpus ID: 5895611
In many real time interactive simulations the problem of interest management is that of filtering updates through application…
Expand
2006
2006
FLUX: Content and Structure Matching of XPath Queries with Range Predicates
Hua-Gang Li
,
S. Aghili
,
D. Agrawal
,
A. El Abbadi
International XML Database Symposium
2006
Corpus ID: 12479712
Range queries seek the objects residing in a constrained region of the data space. An XML range query may impose predicates on…
Expand
2006
2006
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Vebjorn Ljosa
,
Arnab Bhattacharya
,
Ambuj K. Singh
International Conference on Extending Database…
2006
Corpus ID: 16029720
Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive…
Expand
2003
2003
Indexing High Dimensional Rectangles for Fast Multimedia Identification
J. Goldstein
,
John C. Platt
,
C. Burges
2003
Corpus ID: 8537011
This paper addresses the problem of quickly performing point queries against high-dimensional regions. Such queries are useful in…
Expand
1998
1998
Near-Neighbor Query Performance in Search Trees
Shuanhu Wang
,
Joseph M Hellerstein
,
I. Lipkind
1998
Corpus ID: 7052768
Near-neighbor search is an increasingly important operation for queries over multimedia, text, and other non-standard datatypes…
Expand
1981
1981
Optimal Retrieval Algorithms for Small Region Queries
A. Bolour
SIAM journal on computing (Print)
1981
Corpus ID: 41217335
Hashing, or address calculation, has traditionally been associated with the scattering of close records, and therefore with…
Expand
Review
1978
Review
1978
A survey of algorithms and data structures for range searching
J. Bentley
,
J. Friedman
1978
Corpus ID: 34258564
An important problem in database systems is answering queries quickly. This paper surveys a number of algorithms for efficiently…
Expand