Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
学ぶ Challenge: Creating B-tree Index | Query optimization.Indexes
SQL Optimization and Query Features
セクション 2.  3
single

single

Challenge: Creating B-tree Index

メニューを表示するにはスワイプしてください

You have learned that indexes, especially B-tree indexes, can significantly improve the performance of queries that filter or search for values in large tables. In this challenge, your goal is to identify a query on the products table that would benefit from a B-tree index.

Consider a scenario where you frequently need to retrieve all products in a specific category, such as all "Electronics" items. Without an index, the database must scan every row in the products table to find matching categories. By creating a B-tree index on the category column, you help the database quickly locate all products in a given category, making these queries much more efficient.

To optimize this kind of query, you should:

  • Look for queries that use a WHERE clause to filter on the category column of the products table;
  • Recognize that a B-tree index is ideal for columns with many repeated values (like product categories), especially when you often search or filter by that column.
タスク

スワイプしてコーディングを開始

Create a B-tree index on the category column of the products table and write a query that uses this index to efficiently retrieve all products in a specific category.

  • Create a B-tree index on the category column of the products table.
  • Write a query that retrieves all columns from the products table where the category is 'Electronics'.

解答

Switch to desktop実践的な練習のためにデスクトップに切り替える下記のオプションのいずれかを利用して、現在の場所から続行する
すべて明確でしたか?

どのように改善できますか?

フィードバックありがとうございます!

セクション 2.  3
single

single

AIに質問する

expand

AIに質問する

ChatGPT

何でも質問するか、提案された質問の1つを試してチャットを始めてください

some-alt