Tagged articles
cost-based optimizer
13 articles · Page 1 of 1
Even though the phone and email columns each have a single‑column index, an OR condition forces MySQL's cost‑based optimizer to choose a full table scan because the estimated cost of index merge (random I/O and possible sort‑union) exceeds the cost of a sequential scan, and the article explains the underlying mechanics and practical workarounds.
MySQLOR querySQL
0 likes · 10 min read

ByteHouse, a cloud‑native data warehouse built on ClickHouse, redesigns storage‑compute separation, introduces a new MPP architecture, rule‑based and cost‑based optimizers, exchange runtime filters, and parallelism techniques, delivering 10‑200× faster query performance on TPC‑DS, TPC‑H and SSB benchmarks and boosting point‑lookup QPS to 32,000.
ByteHouseOLAPQuery Engine
0 likes · 19 min read


ITPUBAug 11, 2023 · Databases
The article examines why PostgreSQL still falls short of being a core enterprise database by analyzing eight technical gaps—such as XID64 support, LWLOCK efficiency, shared buffer performance, recovery, high availability, zero data loss, resource management, and CBO optimizer maturity—while reflecting on industry trends and Oracle's dominance.
Database PerformanceEnterprise DatabasesOracle Comparison
0 likes · 10 min read

This article explains how Meituan tackles MySQL slow‑query problems by leveraging the database cost‑based optimizer to generate index suggestions, evaluate their quality, and operate a full‑stack governance workflow that includes data collection, statistical modeling, validation, and continuous improvement.
Database PerformanceIndex RecommendationMySQL
0 likes · 23 min read


ITPUBMar 7, 2022 · Databases
The article examines Oracle’s unexpected predicate‑pushdown rewrite observed in trace files, shows how it alters execution plans through a virtual column index, and draws lessons for Chinese database vendors on product depth, architecture design, and after‑sales support to close the gap with global leaders.
OraclePredicate Pushdowncost-based optimizer
0 likes · 8 min read

This article explains how MySQL's cost‑based optimizer decides between using an index and performing a full table scan, demonstrates the behavior with a large test table, shows optimizer trace details, and clarifies why index access can sometimes be more expensive than scanning the whole table.
IndexMySQLcost-based optimizer
0 likes · 8 min read

This article explains how cloud databases use cost‑based parallel query engines to overcome I/O bottlenecks, select tables for parallel scans, implement parallel joins and aggregations, and achieve linear speedups on TPCH benchmarks, highlighting the key techniques and architectural components.
Cloud DatabaseParallel QuerySQL Performance
0 likes · 13 min read

This article explains MySQL's logical architecture, query execution steps, client‑server protocol, query cache behavior, cost‑based optimizer mechanics, and practical index design strategies—including B+Tree fundamentals, covering indexes, and common pitfalls—to help developers achieve measurable performance improvements.
Database PerformanceMySQLcost-based optimizer
0 likes · 32 min read

This article summarizes a MySQL webinar covering cost‑based query optimization, monitoring and analysis tools, data‑access methods and index selection, join optimization techniques, and ways to influence the optimizer through hints and configuration, providing a concise technical reference for database practitioners.
Index SelectionMySQLOptimizer Hints
0 likes · 11 min read

This article explains MySQL's logical architecture, query processing steps, and the inner workings of the optimizer, then provides practical performance‑tuning advice covering data types, index design, cache usage, and specific query patterns such as COUNT, JOIN, LIMIT pagination and UNION.
MySQLPerformance TuningQuery Cache
0 likes · 37 min read

This article explains how relational optimizers validate, analyze, and transform SQL statements into executable code, detailing the four-step optimization process, query‑analysis factors, cost‑based access‑path selection, table scans, index lookups, and the role of data prefetching in improving performance.
Access PathDatabase PerformanceIndex Scan
0 likes · 12 min read

This article examines typical problems encountered when using Cost‑Based Optimizer (CBO) in Inceptor, offers step‑by‑step troubleshooting methods, and demonstrates a real‑world case where statistical information is collected with Preanalyze, CBO is enabled, and query plans are refined for large‑scale JOIN operations.
CBOInceptorPreanalyze
0 likes · 11 min read


ITPUBSep 12, 2016 · Databases
This article explains how Oracle’s Cost‑Based Optimizer can produce incorrect row estimates for queries with multiple column predicates, demonstrates the problem with a test table, and shows that gathering multi‑column statistics resolves the misestimation, improving execution plans.
Multi-Column StatisticsOracleSQL
0 likes · 8 min read
