Lower Bounds for External Memory Integer Sorting via Network Coding

by   Alireza Farhadi, et al.

Sorting extremely large datasets is a frequently occuring task in practice. These datasets are usually much larger than the computer's main memory; thus external memory sorting algorithms, first introduced by Aggarwal and Vitter (1988), are often used. The complexity of comparison based external memory sorting has been understood for decades by now, however the situation remains elusive if we assume the keys to be sorted are integers. In internal memory, one can sort a set of n integer keys of Θ( n) bits each in O(n) time using the classic Radix Sort algorithm, however in external memory, there are no faster integer sorting algorithms known than the simple comparison based ones. In this paper, we present a tight conditional lower bound on the complexity of external memory sorting of integers. Our lower bound is based on a famous conjecture in network coding by Li and Li, who conjectured that network coding cannot help anything beyond the standard multicommodity flow rate in undirected graphs. The only previous work connecting the Li and Li conjecture to lower bounds for algorithms is due to Adler et al. Adler et al. indeed obtain relatively simple lower bounds for oblivious algorithms (the memory access pattern is fixed and independent of the input data). Unfortunately obliviousness is a strong limitations, especially for integer sorting: we show that the Li and Li conjecture implies an Ω(n n) lower bound for internal memory oblivious sorting when the keys are Θ( n) bits. This is in sharp contrast to the classic (non-oblivious) Radix Sort algorithm. Indeed going beyond obliviousness is highly non-trivial; we need to introduce several new methods and involved techniques, which are of their own interest, to obtain our tight lower bound for external memory integer sorting.


page 1

page 2

page 3

page 4


Batched Predecessor and Sorting with Size-Priced Information in External Memory

In the unit-cost comparison model, a black box takes an input two items ...

Optimal Sorting Circuits for Short Keys

A long-standing open question in the algorithms and complexity literatur...

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

The famous dynamic optimality conjecture of Sleator and Tarjan from 1985...

Nearly Optimal Time Bounds for kPath in Hypergraphs

In the kPath problem the input is a graph G and an integer k, and the go...

Stronger Lower Bounds for Online ORAM

Oblivious RAM (ORAM), introduced in the context of software protection b...

External memory priority queues with decrease-key and applications to graph algorithms

We present priority queues in the external memory model with block size ...

Implementing the Comparison-Based External Sort

In the age of big data, sorting is an indispensable operation for DBMSes...

Please sign up or login with your details

Forgot password? Click here to reset