Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,291 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
A distributed resource discovery algorithm for P2P grids
J. A. Torkestani
Journal of Network and Computer Applications
2012
Corpus ID: 25952292
Highly Cited
2008
Highly Cited
2008
Range queries on structured overlay networks
T. Schütt
,
F. Schintke
,
A. Reinefeld
Computer Communications
2008
Corpus ID: 28875271
2007
2007
LORM: Supporting low-overhead P2P-based range-query and multi-attribute resource management in grids
Haiying Shen
,
A. Apon
,
Chengzhong Xu
International Conference on Parallel and…
2007
Corpus ID: 13816022
Resource management is critical to the usability and accessibility of grid computing systems. Conventional approaches to grid…
Expand
2007
2007
Adaptive location constraint processing
Zhengdao Xu
,
H. Jacobsen
ACM SIGMOD Conference
2007
Corpus ID: 9319734
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving…
Expand
2006
2006
A cubic-wise balance approach for privacy preservation in data cubes
Yao Liu
,
S. Sung
,
Hui Xiong
Information Sciences
2006
Corpus ID: 1108185
2002
2002
Efficient similarity search for market basket data
A. Nanopoulos
,
Y. Manolopoulos
The VLDB journal
2002
Corpus ID: 6933907
Abstract. Several organizations have developed very large market basket databases for the maintenance of customer transactions…
Expand
Highly Cited
2001
Highly Cited
2001
Applying the golden rule of sampling for query estimation
Yi-Leh Wu
,
D. Agrawal
,
A. El Abbadi
ACM SIGMOD Conference
2001
Corpus ID: 22958498
Query size estimation is crucial for many database system components. In particular, query optimizers need efficient and accurate…
Expand
Highly Cited
2001
Highly Cited
2001
Database techniques for archival of solid models
David T. McWherter
,
Mitchell Peabody
,
A. Shokoufandeh
,
W. Regli
International Conference on Smart Media and…
2001
Corpus ID: 16417091
This paper presents techniques for managing solid models in modern relational database management systems. Our goal is to enable…
Expand
1999
1999
I/O complexity for range queries on region data stored using an R-tree
Guido Proietti
,
C. Faloutsos
Proceedings / International Conference on Data…
1999
Corpus ID: 14280032
We study the node distribution of an R-tree storing region data, like for instance islands, lakes or human-inhabited areas. We…
Expand
1996
1996
Query Processing Techniques for Multiversion Access Methods
Jochen Van den Bercken
,
B. Seeger
Very Large Data Bases Conference
1996
Corpus ID: 15905051
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where…
Expand
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)
ACCEPT & CONTINUE