Sciweavers

277 search results - page 7 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
ADC
2000
Springer
182views Database» more  ADC 2000»
14 years 11 days ago
Efficient Range Query Retrieval for Non-Uniform Data Distributions
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into a...
Salahadin Mohammed, Evan P. Harris, Kotagiri Ramam...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 9 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
14 years 28 days ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
CHI
2009
ACM
14 years 9 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...