1007 search results - page 14 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
The wide availability of commodity multi-core systems presents an opportunity to address the latency issues that have plaqued XML query processing. However, simply executing multi...
105
Voted
DCOSS
2009
Springer
15 years 6 months ago
2009
Springer
Wireless sensor networks (WSNs) have been proposed for a large variety of applications. As the number of applications of sensor networks continue to grow, the number of users in se...
ICCCN
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
174
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
99
Voted
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...