Sciweavers

55 search results - page 1 / 11
» Reducing Order Enforcement Cost in Complex Query Plans
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 6 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICDE
2001
IEEE
121views Database» more  ICDE 2001»
14 years 6 months ago
Integrating Semi-Join-Reducers into State of the Art Query Processors
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
13 years 9 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
DEXAW
1999
IEEE
202views Database» more  DEXAW 1999»
13 years 9 months ago
Optimizing Global Query Processing Plans in Heterogeneous and Distributed Multidatabase Systems
This work addresses a problem of optimal query processing in heterogeneous and distributed multidatabase systems. The objective is to nd a method for opimization of global query p...
Janusz R. Getta, Seyed M. Sedighi
VLDB
1998
ACM
138views Database» more  VLDB 1998»
13 years 9 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang