1007 search results - page 79 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
148
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
In spite of the omnipresence of parallel (multi-core) systems, the predominant strategy to evaluate window-based stream joins is still strictly sequential, mostly just straightfor...
149
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
122
click to vote
PDP
2008
IEEE
15 years 9 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
143
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...
129
click to vote
MDM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile s...