Interesting thought! This is the way I would try it.
A database is like the shelf you put your toys on.
Now imagine you want to get all your green toys out at the same time.
Or all the toys that are horses.
Or all the toys that are made of wood.
Or all the toys granny got you since she was in hospital last summer.
Now imagine a veeeery long shelf, so long that you'd need your bicycle to get to the other end, with many many toys on it.
A database has like a list lying next to the shelf.
The list says where in the shelf all your green toys are.
And where all the toys that are horses are.
And where all the toys that are made of wood are.
And where all the toys granny got you since she was in hospital last summer are.
Even with this list, you still have to drive along the shelf to get the toys, but you don't have to search anymore, you can drive quickly and stop exactly where you know the toy is. That way, you can get all the green toys from the huge shelf in, say, half an hour instead of a day of searching, because the green toys are not all in a row, no, they are all over the shelf because you wouldn't sort them by colour, but by animal, or by how big they are.
There are also special lists to find which toy was the first, which is the biggest, and so on.
Whenever somebody puts a new toy onto the shelf, they have to enter it to the list. If it's green and made out of wood, they have to enter it into a number of lists so they are all correct.
There is an equally intereseting question that is bound to follow:
"But why do you need all the green toys, and all the toys made out of wood, and all the toys that are horses? When I play, that doesn't matter!"