Sciweavers

149 search results - page 12 / 30
» Optimization of Multi-Way Join Queries for Parallel Executio...
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
EUROPAR
1999
Springer
15 years 1 months ago
On Disk Allocation of Intermediate Query Results in Parallel Database Systems
For complex queries in parallel database systems, substantial amounts of data must be redistributed between operators executed on different processing nodes. Frequently, such inter...
Holger Märtens
VLDB
2005
ACM
117views Database» more  VLDB 2005»
15 years 3 months ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang
ICDE
2008
IEEE
116views Database» more  ICDE 2008»
15 years 11 months ago
Network-Aware Join Processing in Global-Scale Database Federations
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....
Xiaodan Wang, Randal C. Burns, Andreas Terzis, Amo...
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
15 years 11 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
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...
Manivasakan Sabesan, Tore Risch