3946 search results - page 159 / 790 » The computational complexity of choice sets |
179
click to vote
PODS
2005
ACM
16 years 3 days ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
174
click to vote
SSDBM
2003
IEEE
15 years 12 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
176
click to vote
APWEB
2010
Springer
15 years 10 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
153
click to vote
GIS
1999
ACM
15 years 10 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
185
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...