Snip!t channels - Alan Dix

A versatile variant of Heapsort, adapted for external di... presented. On a single processor RAM with internal memor... Θ(m + kbw) words, it sorts a file of n records of ... stored in m physical blocks, each consisting of b record... using O(m l

AVL tree
(data structure)
Definition: A balanced binary search tree where the heig ...

AVL tree
From Wikipedia, the free encyclopedia

Greed Sort: An Optimal External Sorting Algorithm for Mu...
Mark H. Nodine and Jeffrey Scott Vitter
March 1991
Abstract:
We present an optimal deterministic algorithm for extern ...

M. L�ng, K. Sattler, K. Schmidt, E. Schallehn:
Autonomous Tuning with Soft Indexes
ICDE Workshop on Self-Managing Database Systerms (SMDB07 ...

External memory algorithms and data structures: dealing ...
Full text pdf formatPdf (828 KB)
Source ACM Computing Surveys (CSUR) archive
Volume 33 , Issue 2 (June 2001) table of contents
... ACM Press

FastSort: a distributed single-input single-output exter...
Full text pdf formatPdf (928 KB)
Source International Conference on Management of Data a ...
Proceedings of the 1990 ACM SIGMOD international confere ...
... ACM Press New York, NY, USA

We show that, in order to achieve efficient maintenance ... binary search tree, no shape restriction other than a lo... is required. The obtained class of trees, general balanc... maintained at a logarithmic amortized cost with no balan... stored in t

Abstract: Most texts describing data structures give imp... implementations. These are either difficult or tedious t... functional (non sideeffecting) form. This technical repo... implementation of sets in the functional subset of Stand... implementat

AVL Trees
An AVL tree is another balanced binary search tree. Name ...

Optimal disk I/O with parallel block transfer
Full text pdf formatPdf (1.04 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-second annual ACM symposium on ...
... ACM Press New York, NY, USA

Performance comparison of distributive and mergesort as ...
Source Journal of Systems and Software archive
Volume 10 , Issue 3 (October 1989) table of contents
Pages: 187 - 200
... Elsevier Science Inc. New York, NY, USA

Abstract: Two in-place variants of the classical mergeso... analysed in detail. The first, straightforward variant p... log 2 N + O(N ) comparisons and 3N log 2 N + O(N ) moves... elements. The second, more advanced variant requires at ... O(N ) compa

Selecting k smallest or largest elements
Another fundamental selection problem is that of selecti ...

External mergesort is normally implemented so that each ... contiguously on disk and blocks of data are read exactly... are needed during merging. We investigate two ideas for ... performance of external mergesort: interleaved layout an... strategy. I

Sorting is a significant activity for which better metho... sought. In many computing scenarios, sorting must be don... majority of data items remaining on an auxiliary storage... paper introduces a new data structure, the *M-ary tree, ... external so

Heapsort is an internal sorting method which sorts an ar... place in O(n log n) time. Heapsort is generally consider... external random-access sorting. By replacing key compari... operations on pages, it is shown how to obtain an in-pla... which requi

The memory model assumed for this discussion is a paged ...
The heapsort algorithms seen so far are not very well su ...
NOTE: Be aware that the words 'page access' does not nec ...
One may wonder if the d-heaps described in chapter 5 can ...
The drawbac

We provide tight upper and lower bounds, up to a constan... number of inputs and outputs (I/OS) between internal mem... storage required for five sorting-related problems: sort... Fourier transform (FFT), permutation networks, permuting... transpositi