65 relations: Abstraction layer, ACID, Application programming interface, Attribute (computing), B+ tree, Bitmap index, Boolean data type, Business logic, Business rule, Candidate key, Cartesian product, Check constraint, Codd's 12 rules, Column (database), Communications of the ACM, Complement (set theory), Compound key, Data verification, Database, Declarative programming, Distributed Data Management Architecture, Domain of a function, DRDA, Edgar F. Codd, Foreign key, Hierarchical database model, IBM Research - Almaden, Index (publishing), Intersection (set theory), Join (SQL), Many-to-many (data model), Morgan Kaufmann Publishers, Natural key, Network model, One-to-many (data model), One-to-one (data model), Primary key, Procedural programming, Projection (relational algebra), Query language, R-tree, Record (computer science), Relation (database), Relational algebra, Relational calculus, Relational database management system, Relational model, Relvar, Result set, Row (database), ..., Select (SQL), Set operations (SQL), Set theory, SQL, Stored procedure, Subset, Superkey, Surrogate key, Table (database), Tandem Computers, Tuple, Union (set theory), Universally unique identifier, View (SQL), Where (SQL). Expand index (15 more) » « Shrink index
In computing, an abstraction layer or abstraction level is a way of hiding the implementation details of a particular set of functionality, allowing the separation of concerns to facilitate interoperability and platform independence.
In computer science, ACID (Atomicity, Consistency, Isolation, Durability) is a set of properties of database transactions intended to guarantee validity even in the event of errors, power failures, etc.
In computer programming, an application programming interface (API) is a set of subroutine definitions, protocols, and tools for building software.
In computing, an attribute is a specification that defines a property of an object, element, or file.
A B+ tree is an N-ary tree with a variable but often large number of children per node.
A bitmap index is a special kind of database index that uses bitmaps.
In computer science, the Boolean data type is a data type that has one of two possible values (usually denoted true and false), intended to represent the two truth values of logic and Boolean algebra.
In computer software, business logic or domain logic is the part of the program that encodes the real-world business rules that determine how data can be created, stored, and changed.
A business rule is a rule that defines or constrains some aspect of business and always resolves to either true or false.
In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that.
In set theory (and, usually, in other parts of mathematics), a Cartesian product is a mathematical operation that returns a set (or product set or simply product) from multiple sets.
A check constraint is a type of integrity constraint in SQL which specifies a requirement that must be met by each row in a database table.
Codd's twelve rules are a set of thirteen rules (numbered zero to twelve) proposed by Edgar F. Codd, a pioneer of the relational model for databases, designed to define what is required from a database management system in order for it to be considered relational, i.e., a relational database management system (RDBMS).
In a relational database, a column is a set of data values of a particular simple type, one value for each row of the database.
Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).
In set theory, the complement of a set refers to elements not in.
In database design, a composite key is a candidate key that consists of two or more attributes (table columns) that uniquely identify an entity occurrence (table row).
Data verification is a process in which different types of data are checked for accuracy and inconsistencies after data migration is done.
A database is an organized collection of data, stored and accessed electronically.
In computer science, declarative programming is a programming paradigm—a style of building the structure and elements of computer programs—that expresses the logic of a computation without describing its control flow.
Distributed Data Management Architecture (DDM) is IBM's open, published software architecture for creating, managing and accessing data on a remote computer.
In mathematics, and more specifically in naive set theory, the domain of definition (or simply the domain) of a function is the set of "input" or argument values for which the function is defined.
Distributed Relational Database Architecture (DRDA) is a database interoperability standard from The Open Group.
Edgar Frank "Ted" Codd (19 August 1923 – 18 April 2003) was an English computer scientist who, while working for IBM, invented the relational model for database management, the theoretical basis for relational databases and relational database management systems.
In the context of relational databases, a foreign key is a field (or collection of fields) in one table that uniquely identifies a row of another table or the same table.
A hierarchical database model is a data model in which the data is organized into a tree-like structure.
IBM Research - Almaden is in Almaden Valley, San Jose, California, and is one of IBM's twelve worldwide research labs that form IBM Research.
An index (plural: usually indexes, more rarely indices; see below) is a list of words or phrases ('headings') and associated pointers ('locators') to where useful material relating to that heading can be found in a document or collection of documents.
In mathematics, the intersection A ∩ B of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other elements.
An SQL join clause combines columns from one or more tables in a relational database.
In systems analysis, a many-to-many relationship is a type of cardinality that refers to the relationship between two entities A and B in which A may contain a parent instance for which there are many children in B and vice versa.
Morgan Kaufmann Publishers is a Burlington, Massachusetts (San Francisco, California until 2008) based publisher specializing in computer science and engineering content.
A natural key (also known as business key) is a type of unique key, found in relational model database design, that is formed of attributes that already exist in the real world.
The network model is a database model conceived as a flexible way of representing objects and their relationships.
In systems analysis, a one-to-many relationship is a type of cardinality that refers to the relationship between two entities (see also entity–relationship model) A and B in which an element of A may be linked to many elements of B, but a member of B is linked to only one element of A. For instance, think of A as books, and B as pages.
In systems analysis, a one-to-one relationship is a type of cardinality that refers to the relationship between two entities (see also entity–relationship model) A and B in which one element of A may only be linked to one element of B, and vice versa.
In the relational model of databases, a primary key is a specific choice of a minimal set of attributes (columns) that uniquely specify a tuple (row) in a relation (table).
Procedural programming is a programming paradigm, derived from structured programming, based upon the concept of the procedure call.
In relational algebra, a projection is a unary operation written as \Pi_(R) where a_1,...,a_n is a set of attribute names.
Query languages or data query languages (DQLs) are computer languages used to make queries in databases and information systems.
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons.
In computer science, a record (also called a structure, struct, or compound data) is a basic data structure.
In relational database theory, a relation, as originally defined by E. F. Codd, is a set of tuples (d1, d2,..., dn), where each element dj is a member of Dj, a data domain.
Relational algebra, first created by Edgar F. Codd while at IBM, is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.
Relational calculus consists of two calculi, the tuple relational calculus and the domain relational calculus, that are part of the relational model for databases and provide a declarative way to specify database queries.
A relational database management system (RDBMS) is a database management system (DBMS) based on the relational model invented by Edgar F. Codd at IBM's San Jose Research Laboratory.
The relational model (RM) for database management is an approach to managing data using a structure and language consistent with first-order predicate logic, first described in 1969 by Edgar F. Codd, where all data is represented in terms of tuples, grouped into relations.
In relational databases, relvar is a term introduced by C. J. Date and Hugh Darwen as an abbreviation for relation variable in their 1995 paper The Third Manifesto, to avoid the confusion sometimes arising from the use of the term relation, by the inventor of the relational model, E. F. Codd, for a variable to which a relation is assigned as well as for the relation itself.
A SQL result set is a set of rows from a database, as well as metadata about the query such as the column names, and the types and sizes of each column.
In the context of a relational database, a row—also called a tuple—represents a single, implicitly structured data item in a table.
The SQL SELECT statement returns a result set of records from one or more tables.
Set operations allow the results of multiple queries to be combined into a single result set.
Set theory is a branch of mathematical logic that studies sets, which informally are collections of objects.
SQL (S-Q-L, "sequel"; Structured Query Language) is a domain-specific language used in programming and designed for managing data held in a relational database management system (RDBMS), or for stream processing in a relational data stream management system (RDSMS).
A stored procedure (also termed proc, storp, sproc, StoPro, StoredProc, StoreProc, sp, or SP) is a subroutine available to applications that access a relational database management system (RDBMS).
In mathematics, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B. A and B may coincide.
A superkey or super-key is defined in the relational model of database organization as a set of attributes of a relation variable for which it holds that in all relations assigned to that variable, there are no two distinct tuples (rows) that have the same values for the attributes in this set.
A surrogate key (or synthetic key, entity identifier, system-generated key, database sequence number, factless key, technical key, or arbitrary unique identifier) in a database is a unique identifier for either an entity in the modeled world or an object in the database.
A table is a collection of related data held in a structured format within a database.
Tandem Computers, Inc. was the dominant manufacturer of fault-tolerant computer systems for ATM networks, banks, stock exchanges, telephone switching centers, and other similar commercial transaction processing applications requiring maximum uptime and zero data loss.
In mathematics, a tuple is a finite ordered list (sequence) of elements.
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection.
A universally unique identifier (UUID) is a 128-bit number used to identify information in computer systems.
In a database, a view is the result set of a stored query on the data, which the database users can query just as they would in a persistent database collection object.
A WHERE clause in SQL specifies that a SQL Data Manipulation Language (DML) statement should only affect rows that meet specified criteria.
Constraint (database), Database constraint, Database constraints, Database relational, Relational DB, Relational Database, Relational Databases, Relational databases, Relational instance, Relational query.