The noisome weeds which without profit suck The soil's fertility from wholesome flowers. - William Shakespeare, The Tragedy of King Richard II.
Reducing Order Enforcement Cost in Complex Query Plans Ravindra Guravannavar and S. Sudarshan (To appear in ICDE 2007)
New Ad Smanual
Lecture Mb 1
Clustering: Introduction Adriano Joaquim de O Cruz ©2002 NCE/UFRJ [email protected].
BIRCH: Is It Good for Databases? A review of BIRCH: An And Efficient Data Clustering Method for Very Large Databases by Tian Zhang, Raghu Ramakrishnan.
Improving Database Performance on Simultaneous Multithreading Processors Jingren Zhou Microsoft Research [email protected] John Cieslewicz Columbia.
Sorting. How fast can we sort? All the sorting algorithms we have seen so far are comparison sorts: only use comparisons to determine the relative order.
Copyright 2004-2006 Curt Hill Tries An N-Way tree with unusual properties.
Discrete Math and Its Application to Computer Science
StaticCmos.pdf
Introduction to Algorithms
