This article explains MySQL's file‑sort mechanism in depth, covering the sort buffer, handling of long sort keys, three sort modes, priority‑queue and read‑rnd‑buffer optimizations, internal vs. external sorting, descending sort implementation, and how to inspect details with optimizer trace.
This article presents ten big‑data interview problems, each describing a scenario such as finding the most frequent IP, top‑K queries, word frequency counting under memory limits, and techniques like hashing, bitmap, trie, heap, and external sorting to solve them efficiently.
This article explores practical techniques for sorting a massive 4.6 GB file containing 500 million random integers, comparing internal quick‑sort and merge‑sort implementations, a bitmap‑based approach, and a full external‑sorting pipeline, while analyzing performance bottlenecks and memory constraints.
The article outlines a multi‑pass bucket‑sorting strategy to locate the median of a 10 GB unordered integer file using only 2 GB of RAM, detailing how to partition data into byte‑wise buckets, compute the median’s bucket, and finalize the result with in‑memory sorting.
This article explores practical algorithms for sorting, de‑duplicating, and extracting top‑K records from massive data sets, covering bitmap techniques, external sorting, hash‑based counting, min‑heap selection, divide‑and‑conquer, Bloom filters, and distributed processing strategies.
An interview question about checking whether a new integer belongs to a set of 4 billion numbers leads to a discussion of distributed loading across eight machines, bitmap representation using 500 MB of memory, and interval‑based external sorting, illustrating practical big‑data algorithm design.
This article introduces internal and external sorting concepts, then walks through Python implementations of bubble sort and selection sort, detailing basic algorithms, optimization techniques such as early‑exit flags and binary selection, and analyzes their time complexities and trade‑offs.
This article comprehensively explains MySQL's sorting mechanisms, including various sorting modes, index-based optimizations, external sorting algorithms, trace analysis, and configuration parameters, providing practical guidance for developers to diagnose and improve query performance.
