Sciweavers

Share
PODS
2005
ACM

Lower bounds for sorting with few random accesses to external memory

9 years 12 months 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 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 accesses to external memory, but do not restrict sequential reads. A distinguishing feature of our model is that it admits the usage of unlimited external memory for storing intermediate results, such as several hard disks that can be accessed in parallel. In practice, such auxiliary external memory can be crucial. For example, in a first sequential pass the data can be annotated, and in a second pass this annotation can be used to answer the query. Koch's [9] ARB system for answering XPath qu...
Martin Grohe, Nicole Schweikardt
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2005
Where PODS
Authors Martin Grohe, Nicole Schweikardt
Comments (0)
books