From the course: Advanced SQL for Application Development

Unlock the full course today

Join today to access over 24,800 courses taught by industry experts.

Challenge: Define a B-tree and a hash index

Challenge: Define a B-tree and a hash index

From the course: Advanced SQL for Application Development

Start my 1-month free trial Buy for my team

Challenge: Define a B-tree and a hash index

“

(chill music) - [Instructor] Now that concludes our discussion of indexes, so it's time for a challenge. This is a two-parter. First, create a b-tree index on the last and first names in the customers table. And then also create a hash index on the product name in the products table. Now we haven't seen an example of how to create a hash index, but you can either use the postgres documentation, or take a guess, based on the structure of how you create a b-tree index. We'll have the solution in the next video.

Contents