| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Ming-Ling Lo 9 Yuan-Chi Chang , Lawrence D. Bergman , Vittorio Castelli , Chung-Sheng Li , Ming-Ling Lo, John R. Smith : The Onion Technique: Indexing for Linear Optimization Queries. SIGMOD Conference 2000 : 391-402 8 Ming-Ling Lo, Chinya V. Ravishankar : The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins. TKDE 10 (1): 136-152 (1998) 7 Ming-Ling Lo, Chinya V. Ravishankar : Towards Eliminating Random I/O in Hash Joins. ICDE 1996 : 422-429 6 Ming-Ling Lo, Chinya V. Ravishankar : Spatial Hash-Joins. SIGMOD Conf. 1996 : 247-258 5 Ming-Ling Lo, Chinya V. Ravishankar : Generating Seeded Trees from Data Sets. SSD 1995 : 328-347 4 Ming-Syan Chen , Ming-Ling Lo, Philip S. Yu , Honesty C. Young : Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins. TKDE 7 (4): 656-668 (1995) 3 Ming-Ling Lo, Chinya V. Ravishankar : Spatial Joins Using Seeded Trees. SIGMOD Conference 1994 : 209-220 2 Ming-Ling Lo, Ming-Syan Chen , Chinya V. Ravishankar , Philip S. Yu : On Optimal Processor Allocation to Support Pipelined Hash Joins. SIGMOD Conference 1993 : 69-78 1 Ming-Syan Chen , Ming-Ling Lo, Philip S. Yu , Honesty C. Young : Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins. VLDB 1992 : 15-26 DiSC'01 Copyright ©2002 ACM Inc. |
