Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,566,329 papers from all fields of science
Search
Sign In
Create Free Account
Range query (database)
Known as:
Range query
A range query is a common database operation that retrieves all records where some value is between an upper and lower boundary. For example, list…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Column-oriented DBMS
Database
Row (database)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Space-efficient representations of rectangle datasets supporting orthogonal range querying
N. Brisaboa
,
M. R. Luaces
,
G. Navarro
,
Diego Seco
Information Systems
2013
Corpus ID: 17425866
Highly Cited
2010
Highly Cited
2010
Authorized Private Keyword Search over Encrypted Personal Health Records in Cloud Computing
Ming Li
,
Shucheng Yu
,
N. Cao
,
Wenjing Lou
2010
Corpus ID: 15303192
Recently, personal health record (PHR) has emerged as a patient-centric model of health information exchange, which features…
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
2006
2006
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Hao-Ping Hung
,
Ming-Syan Chen
International Conference on Information and…
2006
Corpus ID: 7796702
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the…
Expand
2006
2006
Multi-Attribute Range Queries on Read-Only DHT
Verdi March
,
Y. M. Teo
Proceedings of 15th International Conference on…
2006
Corpus ID: 11178450
R-DHT is a class of DHT whereby each node supports "read-only" accesses to its key-value pairs, but does not allow key-value…
Expand
2005
2005
Incremental construction of Delaunay overlaid network for virtual collaborative space
M. Ohnishi
,
R. Nishide
,
S. Ueshima
Conference on Creating, Connecting and…
2005
Corpus ID: 10918997
This paper proposes an incremental algorithm for constructing the Delaunay overlaid network for virtual collaborative space. In…
Expand
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
2001
2001
Indexing Techniques for Power Management in Multi-Attribute Data Broadcast
Qinglong Hu
,
Wang-Chien Lee
,
Lee
Mob. Networks Appl.
2001
Corpus ID: 17539849
In this paper, we discuss the power conservative indexing techniques for managing multi-attribute data broadcast on wireless…
Expand
1996
1996
Parallelizing a GIS on a Shared Address Space Architecture
S. Shekhar
,
S. Ravada
,
Vipin Kumar
,
Douglas Chubb
,
Greg Turner
Computer
1996
Corpus ID: 33454661
We are developing a high-performance GIS (our term for a parallel GIS) on an SGI Challenge, a 16-processor machine with a shared…
Expand
1992
1992
Applications of the fusion tree method to computational geometry and searching
D. Willard
ACM-SIAM Symposium on Discrete Algorithms
1992
Corpus ID: 12260904
a related loglogN improvement of Chazelle’s O(N logd-lN / log log N) space data structure [C86a], that performs the reporting…
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