Sciweavers

193 search results - page 19 / 39
» Processing and Optimization of Complex Queries in Schema-Bas...
Sort
View
FGCS
2000
81views more  FGCS 2000»
14 years 11 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
VLDB
1998
ACM
138views Database» more  VLDB 1998»
15 years 3 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
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 3 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
VLDB
2007
ACM
103views Database» more  VLDB 2007»
15 years 12 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
SAC
2009
ACM
15 years 6 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke