This article is part of our series describing the basic concepts for databases.
A cryptographic hash is a short, fixed length sequence of numbers which is easily calculated from a much larger input sequence such as a file downloaded from the internet. By recalculating the cryptographic hash of such a file and comparing it with an advertised cryptographic hash, one can check that the file has not changed. This allows the integrity of a file to be checked and any malicious or accidental changes to be spotted.
Here’s my second article on database design basics. I’m hoping to tackle other database design topics in future articles – let me know if there’s anything you’d like me to cover.
In part 1, I covered “CRUD’ – Creating, Reading, Updating and Deleting records.
I’m going to cover the basic building block for data storage in a database – the table. A database usually has more than one table. Tables can have relationships with other tables – and this is what makes a ‘relational database’.