| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. César A. Galindo-Legaria 11 César A. Galindo-Legaria, Milind Joshi : Orthogonal Optimization of Subqueries and Aggregation. SIGMOD 2001 10 Florian Waas , César A. Galindo-Legaria: Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer. SIGMOD Conference 2000 : 499-509 9 Arjan Pellenkoft , César A. Galindo-Legaria, Martin L. Kersten : Duplicate-Free Generation of Alternatives in Transformation-Based Optimizers. DASFAA 1997 : 117-124 8 Arjan Pellenkoft , César A. Galindo-Legaria, Martin L. Kersten : The Complexity of Transformation-Based Join Enumeration. VLDB 1997 : 306-315 7 César A. Galindo-Legaria, Arnon Rosenthal : Outerjoin Simplification and Reordering for Query Optimization. TODS 22 (1): 43-73 (1997) 6 César A. Galindo-Legaria, Arjan Pellenkoft , Martin L. Kersten : Uniformly-Distributed Random Generation of Join Orders. ICDT 1995 : 280-293 5 Tor Didriksen , César A. Galindo-Legaria, Eirik Dahle : Database De-Centralization - A Practical Approach. VLDB 1995 : 654-665 4 César A. Galindo-Legaria: Outerjoins as Disjunctions. SIGMOD Conference 1994 : 348-358 3 César A. Galindo-Legaria, Arjan Pellenkoft , Martin L. Kersten : Fast, Randomized Join-Order Selection - Why Use Transformations? VLDB 1994 : 85-95 2 César A. Galindo-Legaria, Arnon Rosenthal : How to Extend a Conventional Optimizer to Handle One- and Two-Sided Outerjoin. ICDE 1992 : 402-409 1 Arnon Rosenthal , César A. Galindo-Legaria: Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins. SIGMOD Conference 1990 : 291-299 DiSC'01 Copyright ©2002 ACM Inc. |
