Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,047,701 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.
2015
2015
A Secure Collusion-Aware and Probability-Aware Range Query Processing in Tiered Sensor Networks
Lei Dong
,
Xuan Chen
,
Jianxiang Zhu
,
Hong Chen
,
Ke Wang
,
Cuiping Li
IEEE International Symposium on Reliable…
2015
Corpus ID: 6772157
With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an…
Expand
2012
2012
A query integrity assurance scheme for accessing outsourced spatial databases
Wei-Shinn Ku
,
Ling Hu
,
C. Shahabi
,
Haixun Wang
GeoInformatica
2012
Corpus ID: 14164456
With the trend of cloud computing, outsourcing databases to third party service providers is becoming a common practice for data…
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
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
2009
2009
One Size Does Not Fit All : Towards User & Query Dependent Ranking For Web Databases
Aditya Telang
,
Chengkai Li
,
Sharma Chakravarthy
2009
Corpus ID: 11929077
In this paper, we propose an automated solution for ranking q uery results of Web databases in an userand query-dependent…
Expand
2009
2009
Multi-dimensional Queries in DHT-Based Peer-to-Peer Systems
Xinpeng Shen
,
Zhanhuai Li
Fifth International Conference on Semantics…
2009
Corpus ID: 34124683
Supporting relational query processing in P2P data management systems needs multi-dimensional exact match queries processing and…
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
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
2001
2001
Bridging relational technology and xml
J. Shanmugasundaram
,
J. Naughton
2001
Corpus ID: 64400237
XML (extensible Markup Language) is fast emerging as the dominant standard for representing and exchanging information over the…
Expand
1999
1999
New GDM-based declustering methods for parallel range queries
S. Kuo
,
M. Winslett
,
Cho Yong
,
Jonghyun Lee
Proceedings. IDEAS'99. International Database…
1999
Corpus ID: 31417426
Declustering is a well known technique to achieve high performance for queries on parallel databases. We propose novel General…
Expand