1038 search results - page 30 / 208 » Space-Bounded Query Approximation |
92
Voted
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
108
Voted
SIGMOD
1999
ACM
15 years 4 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
124
click to vote
TCC
2012
Springer
13 years 7 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
212
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
167
Voted
VLDB
2009
ACM
15 years 12 months ago
2009
ACM
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...