Tag: Index

9 articles

MySQL Index and Sorting: Filesort and Index Sort

filesort sorting, index sorting, two-pass sorting, single-pass sorting, clustered index and secondary index sorting. This article provides in-depth analysis of principles and practical applications.

MySQL Index Optimization: Table Lookup, Covering Index, L...

Table lookup queries, covering index, leftmost prefix principle, LIKE queries, NULL value handling. This article provides in-depth analysis of principles and practical applications.

MySQL Clustered vs Secondary Index: Structure and Perform...

Clustered index (secondary index, primary key index), secondary index, table lookup query, covering index. This article provides in-depth analysis of principles and practical applications.

MySQL Index Principles: B+Tree, Hash, Binary Search

Index principles: B+Tree, Hash index, binary search, InnoDB adaptive hash index. This article provides in-depth analysis of principles and practical applications.

MySQL Index Types: BTree, Hash, FULLTEXT, RTree Explained

Index types: BTree, Hash, FULLTEXT, RTree, regular index, unique index, primary key index, composite index, clustered index. This article provides in-depth analysis of principles and practical appl...

Neo4j Transaction, Index and Constraint Practice: Syntax,...

Neo4j transaction handling, index creation, constraint settings and concurrency issue troubleshooting. This article deeply analyzes principles and practical applications.

MongoDB Indexing: Types, Principles & Best Practices

MongoDB indexes are core mechanisms for improving query performance, including single field indexes, compound indexes, multi-key indexes, geospatial indexes, text indexes and hashed indexes.

MongoDB Index Management & explain Execution Plan Analysis

MongoDB index management includes createIndex, getIndexes, dropIndex operations. explain analysis supports queryPlanner, executionStats, allPlansExecution modes, analyzing query performance through...

MongoDB vs MySQL: B-Tree vs B+Tree Index Mechanisms

MongoDB uses B-tree indexes where nodes store both data and keys. MySQL uses B+tree indexes with all data concentrated in leaf nodes. B+tree is better for range queries, B-tree is better for random...