Optimizing Java using D

[Wanderer via Digitalmars-d]

On Thursday, 3 July 2014 at 10:13:20 UTC, ed wrote:
> What if you're sorting a large database with large records?

Databases don't sort their records physically. The main reason 
for that is that each record has many columns so there are many 
various possible sort orders.

Instead, databases maintain indices which allow you to retrieve 
the data in sorted order. That's a different story, not much in 
common with sorting an array/collection in memory.


On Thursday, 3 July 2014 at 11:30:57 UTC, Alix Pexton wrote:
> and how it is stored (all in a single page of memory vs across 
> multiple networked disks vs in immutable memory such that each 
> swap actually duplicate the whole dataset).

And how much of that wide area is actually covered by D's sort 
that was discussed here?