1007 search results - page 19 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
220
Voted
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
VLDB
1992
ACM
15 years 3 months ago
1992
ACM
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
111
click to vote
PVLDB
2008
14 years 11 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
90
Voted
ITSL
2008
15 years 1 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
99
Voted
COMAD
1994
15 years 1 months ago
1994
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...