1007 search results - page 71 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
170
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
235
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
125
click to vote
SIGMOD
2008
ACM
15 years 3 months ago
2008
ACM
Automated physical design tuning for database systems has recently become an active area of research and development. Existing tuning tools explore the space of feasible solutions...
138
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
128
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...