1007 search results - page 33 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
224
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
101
click to vote
ICDT
2005
ACM
15 years 7 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
153
click to vote
JIDM
2010
14 years 9 months ago
2010
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
104
click to vote
DATE
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—High computational effort in modern image processing applications like medical imaging or high-resolution video processing often demands for massively parallel special p...
127
click to vote
EMO
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...