277 search results - page 1 / 56 » Opportunistic Data Structures for Range Queries |
79
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
68
Voted
CCCG
2008
15 years 1 months ago
2008
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
PODS
1993
ACM
15 years 3 months ago
1993
ACM
In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatia...