Sciweavers

Share
PROPERTYTESTING
2010
8 years 11 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
IPPS
2010
IEEE
8 years 11 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
PVLDB
2008
90views more  PVLDB 2008»
9 years 22 days ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
9 years 26 days ago
Optimality in External Memory Hashing
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
Morten Skaarup Jensen, Rasmus Pagh
CORR
2004
Springer
121views Education» more  CORR 2004»
9 years 1 months ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman
JDA
2008
100views more  JDA 2008»
9 years 1 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
FTTCS
2006
132views more  FTTCS 2006»
9 years 1 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CORR
2006
Springer
98views Education» more  CORR 2006»
9 years 1 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
FUIN
2008
80views more  FUIN 2008»
9 years 1 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
9 years 2 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
books