Lecture notes, cheat sheets
Database. Introduction (most important) Directory / Lecture notes, cheat sheets Table of contents (expand) Lecture No. 1. Introduction 1. Database management systems Database management systems (DBMS) are specialized software products that allow: 1) permanently store arbitrarily large (but not infinite) amounts of data; 2) extract and modify these stored data in one way or another, using so-called queries; 3) create new databases, i.e. describe logical data structures and set their structure, i.e. provide a programming interface; 4) access stored data by several users at the same time (i.e. provide access to the transaction management mechanism). Accordingly, the Database are datasets under the control of management systems. Now database management systems are the most complex software products on the market and form its basis. In the future, it is planned to conduct developments on a combination of conventional database management systems with object-oriented programming (OOP) and Internet technologies. Initially, DBMS were based on hierarchical и network data models, i.e. allowed to work only with tree and graph structures. In the process of development in 1970, there were database management systems proposed by Codd (Codd), based on relational data model. 2. Relational databases The term "relational" comes from the English word "relation" - "relationship". In the most general mathematical sense (as can be remembered from the classical set algebra course) respect - it's a set R = {(x1,..., xn) | x1 ∈ A1, ..., xn ∈ An}, where A1,...,An are the sets forming the Cartesian product. In this way, ratio R is a subset of the Cartesian product of sets: A1 x... x An : R ⊆ A 1 x... x An. For example, consider the binary relations of the strict order "greater than" and "less than" on the set of ordered pairs of numbers A 1 = A2 = {3, 4, 5}: R> = {(3, 4), (4, 5), (3, 5)} ⊂ A1 xA2; R< = {(5, 4), (4, 3), (5, 3)} ⊂ A1 xA2. These relationships can be presented in the form of tables. Ratio "greater than">: Ratio "less than" R<: Thus, we see that in relational databases, a wide variety of data is organized in the form of relationships and can be presented in the form of tables. It should be noted that these two relations R> and R< are not equivalent to each other, in other words, the tables corresponding to these relationships are not equal to each other. So, the forms of data representation in relational databases can be different. How does this possibility of different representation manifest itself in our case? Relations R> and R< - these are sets, and a set is an unordered structure, which means that in tables corresponding to these relationships, rows can be interchanged. But at the same time, the elements of these sets are ordered sets, in our case - ordered pairs of numbers 3, 4, 5, which means that the columns cannot be interchanged. Thus, we have shown that the representation of a relation (in the mathematical sense) as a table with an arbitrary order of rows and a fixed number of columns is an acceptable, correct form of representation of relations. But if we consider the relations R> and R< from the point of view of the information embedded in them, it is clear that they are equivalent. Therefore, in relational databases, the concept of "relationship" has a slightly different meaning than a relation in general mathematics. Namely, it is not related to the ordering by columns in a tabular form of presentation. Instead, so-called "row - column heading" relationship schemes are introduced, i.e., each column is given a heading, after which they can be freely swapped. This is what our R relationships will look like> and R< in a relational database. A strict order relation (instead of the relation R>): A strict order relation (instead of the relation R<): Both tables-relationships get a new one (in this case, the same, since by introducing additional headers we have erased the differences between the relations R> and R<) title. So, we see that with the help of such a simple trick as adding the necessary headers to the tables, we come to the fact that the relations R> and R< become equivalent to each other. Thus, we conclude that the concept of "relationship" in the general mathematical and relational sense does not completely coincide, they are not identical. Currently, relational database management systems form the basis of the information technology market. Further research is being carried out in the direction of combining varying degrees of the relational model. >> Forward: Missing data (Empty values. Null values. Null values and the general rule for evaluating expressions. Null values and logical operations. Null values and testing conditions) We recommend interesting articles Section Lecture notes, cheat sheets: ▪ Stocks and bods market. Crib ▪ Foreign literature of ancient eras, the Middle Ages and the Renaissance in brief. Crib See other articles Section Lecture notes, cheat sheets. Read and write useful comments on this article. Latest news of science and technology, new electronics: The existence of an entropy rule for quantum entanglement has been proven
09.05.2024 Mini air conditioner Sony Reon Pocket 5
09.05.2024 Energy from space for Starship
08.05.2024
Other interesting news: ▪ Motorola MOTOTRBO SL1600 digital portable radio ▪ Sweet lovers are prone to alcoholism News feed of science and technology, new electronics
Interesting materials of the Free Technical Library: ▪ site section Tone and volume controls. Article selection ▪ article Cross the Rubicon. Popular expression ▪ article What is curling? Detailed answer ▪ article The damaging effect of electric current on the human body ▪ article Wow prefix. Encyclopedia of radio electronics and electrical engineering
Leave your comment on this article: All languages of this page Home page | Library | Articles | Website map | Site Reviews www.diagram.com.ua |