DigiNews

Tech Watch by Johan Denoyer

← Back to articles

Orasort - Common prefix skipping, adaptive sort

Quality: 8/10 Relevance: 9/10

Summary

A retrospective post describing an in-memory sort algorithm with common prefix skipping, adaptive quicksort/MSD radix behavior, and key-byte caching. The author discusses development at Oracle, early proofs-of-concept across multiple architectures, and real-world performance claims (~5x faster than prior Oracle sort) along with naming notes (Orasort).

🚀 Service construit par Johan Denoyer