External memory algorithms and data structures: dealing with massive data
By Jeffrey Scott Vitter. CSUR, 2001
732 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing
View Paper: https://www.semanticscholar.org/paper/287ce96d149142c1f93e25df1d87df7ad5a6f7bf
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Carlos Castillo
- Naga K. Govindaraju
- Aristides Gionis
- Luca Becchetti
- Dinesh Manocha
- Erik D. Demaine
- Amol Deshpande
- Peter Lindstrom
In Computer Networks and Communications
- Steven S. Skiena
- Naga K. Govindaraju
- Dinesh Manocha
- Carlos Castillo
- Aristides Gionis
- Luca Becchetti
- Erik D. Demaine
- Amol Deshpande
In Signal Processing
- Steven S. Skiena
- Naga K. Govindaraju
- Ritesh Kumar
- Jim Gray
- Dinesh Manocha
- Martín Farach-Colton
- Amol Deshpande
- Peter Lindstrom
Citations in the corpus
- Visualization of large terrains made easy (2001, background): “External memory algorithms [26], also known as out-of-core algorithms, address issues related to the hierarchical nature of the memory structure of modern computers (fast cache, main memory, hard disk, etc.”
- GPUTeraSort: high performance graphics co-processor sorting for large database management (2006, background): “External memory sorting algorithms can be classified into two broad categories [42]:”
- GPU-based out-of-core many-lights rendering (2013, unknown): “A variety of out-of-core algorithms [Vitter 2001] have been developed to handle general computational problems by minimizing the I/O overhead.”
- Representing and Querying Correlated Tuples in Probabilistic Databases (2007, methodology): “As part of our future work we aim to use external memory graph algorithms [36] for these tasks.”
- Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension (2019, background): “For a thorough study of external memory algorithms, including motivation for the row-order model and for multiple passes, see (Gib-bons and Matias, 1999; Vitter, 2001; Liberty, 2013).”
- Cache-oblivious B-trees (2000, background): “One body of work explores multilevel memory hierarchies [2, 3, 5, 7, 43, 44, 49 , 51], though the proliferation of parameters in these models makes them cumbersome for algorithm design.”
- Efficient semi-streaming algorithms for local triangle counting in massive graphs (2008, background): “This implies a semi-external memory constraint [ 31 ] and thus reects many signican t limitations arising in practice.”
- The Algorithm Design Manual (2020, background): “The complexity of fundamental algorithm and data structure problems on such an external memory model has been extensively studied [Vit01].”
- Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization (2002, background): “External memory algorithms [16], also known as out-of-core algorithms, address issues related to the hierarchical nature of the memory structure of modern computers (fast cache, main memory, hard disk, etc.”
- Data streams: algorithms and applications (2005, unknown): “We in Computer Science community have traditionally focused on scaling wrt to size: how to efficiently manipulate large disk-bound data via suitable data structures [15], how to scale to databases of petabytes [106], synthesize massive datasets [7], etc.”