1007 search results - page 50 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
152
Voted
DMSN
2006
ACM
15 years 8 months ago
2006
ACM
In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multiquery optimization at the base station level to minimize the numb...
114
click to vote
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
106
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
114
Voted
ICPADS
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
214
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...