Sciweavers

109 search results - page 1 / 22
» Optimality in External Memory Hashing
Sort
View
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
13 years 4 months ago
Optimality in External Memory Hashing
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
Morten Skaarup Jensen, Rasmus Pagh
PODS
2010
ACM
206views Database» more  PODS 2010»
13 years 9 months ago
Cache-oblivious hashing
The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that i...
Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 7 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SPAA
2009
ACM
14 years 5 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang