In addition to that link, if you know some programming/python, you might want to check the Qiskit textbook entry for Grover's algorithm. Also not that a database is an organized collection of structured information. So when we say "search in database" we're not necessarily saying search in some oracle/mysql database, but if needed, the algorithm can be implemented to search in a database with some key-value association.
could you use Grover's algorithm to search for a match (let's say x='quantumc')?
Yes you can. It's done at the oracle step, the oracle will simply answer "yes it's the element we want" or "no it's not".
Then my follow up question is would you need 64 logical qubits to make this calculation? (8 binary bits x 8 characters)
The reasoning is not accurate... to answer your question I will give an example. Given an array that has 42 elements, how many bits do I need in order to express the index when I find the value I am looking for? to express the indices up to 42 you need 6 bits. So you need 6 qubits.
You can convince yourself with an example.
watch this video, or simply copy the implementation from the qiskit textbook
Try to run the code on a real quantum machine from IBM with a limited number of qubits or even using the simulator
Or you can use this notebook (from Qiskit summer school lab2):