1007 search results - page 24 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
206
click to vote
ICDE
1996
IEEE
16 years 1 months ago
1996
IEEE
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...
167
click to vote
DEBS
2011
ACM
2011
ACM
DejaVu: a complex event processing system for pattern matching over live and historical data streams
14 years 3 months ago
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
108
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distribu...
169
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
108
click to vote
TVLSI
2008
14 years 11 months ago
2008
Abstract--Technology scaling in the nanometer era has increased the transistor's susceptibility to process variations. The effects of such variations are having a huge impact ...