958 search results - page 28 / 192 » Efficient data structures for range-aggregate queries on tre... |
143
click to vote
JACM
2010
15 years 1 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
238
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
105
click to vote
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
107
Voted
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
131
click to vote
DOLAP
2000
ACM
15 years 7 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...