Sciweavers

Share
24 search results - page 1 / 5
» Lower bounds for external memory dictionaries
Sort
View
SODA
2003
ACM
97views Algorithms» more  SODA 2003»
9 years 1 months ago
Lower bounds for external memory dictionaries
Gerth Stølting Brodal, Rolf Fagerberg
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
9 years 6 months ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...
PODS
2005
ACM
164views Database» more  PODS 2005»
10 years 4 days ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
ICALP
2005
Springer
9 years 5 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
7 years 2 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
books