Linked from

The 11 pages that link to Database index, each with the reason it gives.

• DatabaseRelated: Indexes help this database retrieve selected records without scanning every row.

• Relational databaseRelated: Indexes accelerate common lookups without changing the logical table structure.

• Data structureRelated: Database indexes organize keys to avoid scanning every stored record.

• Hash tableCompared with: Hash indexes support equality lookups, unlike ordered indexes designed for range queries.

• B-treeRelated: B-trees support ordered lookups and updates in database indexes.

• Database management systemBroader topic: Indexes let the DBMS find records without scanning an entire table.

• Sorting algorithmRelated: Sorting and ordered data structures support efficient index construction and range queries.

• Associative arrayRelated: Indexes also connect lookup keys to data, but operate over database records.

• MySQLRelated: Indexes can make MySQL queries faster, at the cost of storage and write work.

• Set (abstract data type)Related: Indexes often enforce uniqueness or quickly test whether a key is present.

• Table (database)Related: An index can make searches on table columns faster.