This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |
| articles:keystomusic [2026/02/26 14:18] – hjr | articles:keystomusic [2026/02/26 14:18] (current) – [1.0 Introduction] hjr |
|---|
| ====== Primary Keys to Classical Music ====== | ====== Primary Keys to Classical Music ====== |
| ===== 1.0 Introduction ===== | ===== 1.0 Introduction ===== |
| {{:articles:key.jpg?nolink&200 |}}In any data-based application, the key to flexibility, speed and extensibility is to be able to identify, with the fewest possible pieces of information, an utterly unique way to find a single piece of data in which we're interested. The combination of attributes which uniquely identify a data item is then called the 'primary key' of that particular data set. | {{:articles:key.jpg?nolink&220 |}}In any data-based application, the key to flexibility, speed and extensibility is to be able to identify, with the fewest possible pieces of information, an utterly unique way to find a single piece of data in which we're interested. The combination of attributes which uniquely identify a data item is then called the 'primary key' of that particular data set. |
| |
| Technically, the problem of how to find the minimal primary key to retrieve needed data is a branch of "information theory" -but this detail needn't detain us unduly and I promise to try to make the discussion as un-technical as possible. So long as you remember that "primary key" means "least information needed to retrieve the full set of data", you're doing fine! | Technically, the problem of how to find the minimal primary key to retrieve needed data is a branch of "information theory" -but this detail needn't detain us unduly and I promise to try to make the discussion as un-technical as possible. So long as you remember that "primary key" means "least information needed to retrieve the full set of data", you're doing fine! |