We obtain improved lower bounds for a class of static and dynamic data structure problems that includes several problems of searching sorted lists as special cases. These lower bounds nearly match the upper bounds given by recent striking improvements in searching algorithms given by Fredman andWillard's fusion trees [9] and Andersson's search data structure [5]. Thus they show sharp limitation...

We generalize Cuckoo Hashing 23] to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 +) n memory cells, for any constant > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln 1) probes and the expected amortized insertion time is constant. This is the rst dictionary that has worst case constant acce...

In this paper, we demonstrate the effectiveness of application directed explicit cache management. We define the generalized split temporal/spatial cache architecture as an abstraction of several advanced cache architectures. We analyze individual problems, identify the inefficiencies in the memory hierarchy and develop explicit cache management algorithms. In our algorithms, the application so...

The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to complete data sets. This is problematic in most data mining settings. We detail a family of sequential update rules for adding data to a “thin” SVD data model, revising or removing data already incorporated into the mo...