Understanding MySQL ORDER BY and LIMIT: Execution Principles, Sorting Algorithms, and Pagination Optimization

This article provides a comprehensive technical analysis of how MySQL processes ORDER BY and LIMIT clauses during pagination queries, detailing index utilization, filesort mechanisms, memory-based sorting algorithms, and practical optimization strategies for resolving deep pagination performance bottlenecks.

Database OptimizationFilesort AlgorithmMySQL

0 likes · 11 min read

Understanding MySQL ORDER BY and LIMIT: Execution Principles, Sorting Algorithms, and Pagination Optimization

OPPO Kernel Craftsman

Mar 19, 2021 · Databases

Learned Index Structures: Applying Machine Learning to Database Indexing

Learned Index Structures replace conventional B‑Tree and Bloom filter indexes with hierarchical machine‑learning models that predict key positions directly, reducing search overhead, but require careful model selection, training, and handling of updates, making them a promising yet still experimental alternative to traditional database indexing techniques.

Learned IndexStaged Modeldatabase

0 likes · 11 min read

Learned Index Structures: Applying Machine Learning to Database Indexing

Tencent Database Technology

Jan 28, 2021 · Databases

Tencent Cloud Database Kernel Research Accepted at SIGMOD and ICDE: Spitfire Buffer Manager and TLBtree Index

Tencent Cloud's native database team announced two breakthrough research papers—Spitfire, a three‑tier buffer manager for DRAM and NVM, and TLBtree, a read/write‑optimized tree index for non‑volatile memory—both accepted at top‑tier conferences SIGMOD and ICDE, highlighting novel memory‑aware storage techniques and collaborative achievements with leading universities.

ICDENon-volatile MemorySIGMOD

0 likes · 8 min read

Tencent Cloud Database Kernel Research Accepted at SIGMOD and ICDE: Spitfire Buffer Manager and TLBtree Index

StarRing Big Data Open Lab

Oct 14, 2020 · Databases

How In-Memory Databases Organize Data and Indexes: Techniques and System Comparisons

This article explains how modern in‑memory database systems structure data into fixed‑ and variable‑length blocks, choose partitioned or non‑partitioned architectures, handle row versus column storage, and implement cache‑aware index structures such as CSB+-Tree, PB+-Tree, Bw‑Tree, Adaptive Radix, OLFIT and Skiplists, illustrated with Hekaton, H‑Store/VoltDB, HyPer and SAP HANA examples.

Partitioningdata organizationdatabase systems

0 likes · 22 min read

How In-Memory Databases Organize Data and Indexes: Techniques and System Comparisons