22 search results - page 1 / 5 » Lower bounds for external memory dictionaries |
71
Voted
SODA
2003
ACM
15 years 2 months ago
2003
ACM
120
Voted
WADS
2009
Springer
15 years 7 months ago
2009
Springer
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 ...
131
Voted
PODS
2005
ACM
16 years 1 months ago
2005
ACM
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...
111
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
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...
117
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
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(...