Concepts inA relational model of data for large shared data banks

Relational model

The relational model for database management is a database model based on first-order predicate logic, first formulated and proposed in 1969 by Edgar F. Codd.  more from Wikipedia

Database

A database is an organized collection of data, today typically in digital form. The data are typically organized to model relevant aspects of reality (for example, the availability of rooms in hotels), in a way that supports processes requiring this information (for example, finding a hotel with vacancies). The term database is correctly applied to the data and their supporting data structures, and not to the database management system (DBMS).  more from Wikipedia

Data (computing)

In computer science, data is information in a form suitable for use with a computer. Data is often distinguished from programs. A program is a sequence of instructions that detail a task for the computer to perform. In this sense, data is thus everything in a software that is not program code. Physical computer memory elements consist of an address and a byte/word of data storage. Digital data can be reduced to key/value pair combinations .  more from Wikipedia

File format

A file format is a particular way that information is encoded for storage in a computer file, as files need a way to be represented as bits when stored on a disc drive or other digital storage medium. File formats can be divided into two types: proprietary and open formats.  more from Wikipedia

Knowledge representation and reasoning

Knowledge representation (KR) is an area of artificial intelligence research aimed at representing knowledge in symbols to facilitate inferencing from those knowledge elements, creating new elements of knowledge. The KR can be made to be independent of the underlying knowledge model or knowledge base system (KBS) such as a semantic network.  more from Wikipedia

Tree structure

A tree structure is a way of representing the hierarchical nature of a structure in a graphical form. It is named a "tree structure" because the classic representation resembles a tree, even though the chart is generally upside down compared to an actual tree, with the "root" at the top and the "leaves" at the bottom. A tree structure is conceptual, and appears in several forms.  more from Wikipedia

Arity

In logic, mathematics, and computer science, the arity Listen/¿ær¿ti/ of a function or operation is the number of arguments or operands that the function takes. The arity of a relation is the dimension of the domain in the corresponding Cartesian product. The term springs from such words as unary, binary, ternary, etc. The term "arity" is primarily used with reference to functions of the form f : V ¿ S, where V ¿ S, and S is some set.  more from Wikipedia