Lower bounds for sorting with few random accesses to external memory

@inproceedings{Grohe2005LowerBF,
  title={Lower bounds for sorting with few random accesses to external memory},
  author={Martin Grohe and Nicole Schweikardt},
  booktitle={PODS},
  year={2005}
}
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 situation are the size of the main memory and the number of random accesses to external memory. We note that sequentially streaming data from external memory through main memory is much less prohibitive.We propose an abstract model of this scenario in which we restrict the size of the main memory and the number of random… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

Tradeoff lower lounds for stack machines

  • computational complexity
  • 2012
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

On the Value of Multiple Read/Write Streams for Approximating Frequency Moments

  • Electronic Colloquium on Computational Complexity
  • 2008
VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Lower bounds for randomized read/write stream algorithms

VIEW 15 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Randomized computations on large data sets: tight lower bounds

VIEW 10 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

On the Value of Multiple Read/Write Streams for Data Compression

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On the Value of Multiple Read/Write Streams for Approximating Frequency Moments

  • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Cryptography with Streaming Algorithms

VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

Similar Papers

Loading similar papers…