|
In relational databases, SQL databases, and flat file databases, a table is a set of data elements (values) that is organized using a model of horizontal rows and vertical columns. The columns are identified by name, and the rows are identified by the values appearing in a particular column subset which has been identified as a candidate key. Table is another term for relations; although there is the difference that a table is usually a multi-set (bag) of rows whereas a relation is a set and does not allow duplicates. A table has a specified number of columns but can have any number of rows. Besides the actual data rows, tables generally have associated with them some meta-information, such as constraints on the table or on the values within particular columns. A relational database is a database that conforms to the relational model, and refers to a databases data and schema (the databases structure of how that data is arranged). ...
SQL is the most popular computer language used to create, modify and retrieve data from relational database management systems. ...
A simple diagram depicting conversion of a CSV-format flat file database table into a relational database table. ...
In the context of a relational database, a row, also called a record or tuple, represents a single, implicitly structured data item in a table. ...
In the context of a relational database, a column of a table is a set of data values of a particular simple type, one for each row of the table. ...
In the relational model a candidate key of a relation variable (relvar) is a set of attributes of that relvar such that (1) at all times it holds in the relation assigned to that variable that there are no two distinct tuples with the same values for these attributes and...
The relational model for database management is a database model based on predicate logic and set theory. ...
Metadata (Greek meta after and Latin data information) are data that describe other data. ...
A check constraint is a rule that defines valid data when adding or updating an entry in a database. ...
The data in a table does not have to be physically stored in the database. Views are also relational tables, but their data is calculated at query time. Another example are nicknames, which represent a pointer to a table in another database. In database theory, a view is a virtual or logical table composed of the result set of a query. ...
Comparisons with other data structures
In non-relational systems, such as hierarchical databases, the distant counterpart of a table is a structured file, representing the rows of a table in each record of the file and each column in a field of the record. In a hierarchical data model, data are organized into a tree-like structure. ...
A computer file is a collection of information that is stored in a computer system and can be identified by its full path name. ...
Unlike a spreadsheet, the datatype of each field is ordinarily defined by the schema describing the table. Some relational systems are less strict field datatype definitions. Screenshot of a spreadsheet made with OpenOffice. ...
In computer science, a datatype or data type (often simply a type) is a name or label for a set of values and some operations which one can perform on that set of values. ...
A Logical schema is a data model of a specific problem domain that has more detail than a conceptual schema, but does not include the design considerations and physical storage parameters found in a physical schema. ...
Tables versus relations In terms of the relational model of databases, a table can be considered a convenient representation of a relation, but the two are not strictly equivalent. For instance, an SQL table can potentially contain duplicate rows, whereas a true relation cannot contain duplicate tuples. Similarly, representation as a table implies a particular ordering to the rows and columns, whereas a relation is explicitly unordered. However, the database system does not guarantee any ordering of the rows unless an ORDER BY clause is specified in the SELECT statement that queries the table. The relational model for database management is a database model based on predicate logic and set theory. ...
In mathematics, a finitary relation is defined by one of the formal definitions given below. ...
SQL (commonly expanded to Structured Query Language â see History for the terms derivation) is the most popular computer language used to create, retrieve, update and delete (see also: CRUD) data from relational database management systems. ...
In mathematics, a tuple is a finite sequence (also known as an ordered list) of objects, each of a specified type. ...
An ORDER BY clause in SQL specifies that a SQL SELECT statement returns a result set with the rows being sorted by the values of one or more columns. ...
A SELECT statement in SQL returns a result set of records from one or more tables. ...
An equally valid representation of a relation is as an n-dimensional graph, where n is the number of attributes (a table's columns). For example, a relation with two attributes and three values can be represented as a table with two columns and three rows, or as a two-dimensional graph with three points. The table and graph representations are only equivalent if the ordering of rows is not significant, and the table has no duplicate rows.
See also | Topics in database management systems (DBMS) ( view • talk • edit ) | | Concepts Database • Database model • Relational database • Relational model • Relational algebra • Primary key, Foreign key, Surrogate key, Superkey, Candidate key • Database normalization • Referential integrity • Relational DBMS • Distributed DBMS • ACID A table is a mode of visual communication that maps the logical structure of a set of data into a hierarchical matrix. ...
A database management system (DBMS) is a system or software designed to manage a database, and run operations on the data requested by numerous clients. ...
In computing, a database can be defined as a structured collection of records or data that is stored in a computer so that a program can consult it to answer queries. ...
A database model is a theory or specification describing how a database is structured and used. ...
A relational database is a database that conforms to the relational model, and refers to a databases data and schema (the databases structure of how that data is arranged). ...
The relational model for database management is a database model based on predicate logic and set theory. ...
Relational algebra, an offshoot of first-order logic, is a set of relations closed under operators. ...
In database design, a primary key is a value that can be used to identify a unique row in a table. ...
In the context of a relational database, a foreign key (FK) is a field or group of fields in a database record that points to a key field or group of fields forming a key of another database record in some (usually different) table. ...
A surrogate key is a unique primary key generated by the relational database management system that is not derived from any data in the database and whose only significance is to act as the primary key. ...
A superkey is defined in the relational model as a set of attributes of a relation variable (relvar) 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. ...
In the relational model a candidate key of a relation variable (relvar) is a set of attributes of that relvar such that (1) at all times it holds in the relation assigned to that variable that there are no two distinct tuples with the same values for these attributes and...
Database normalization is a design technique by which relational database tables are structured in such a way as to make them invulnerable to certain types of logical inconsistencies and anomalies. ...
An example of a database that has not enforced referential integrity. ...
A relational database management system (RDBMS) is a database management system (DBMS) that is based on the relational model as introduced by Edgar F. Codd. ...
According to Elmasri and Navathe (2004, p. ...
Acidity redirects here. ...
| | Objects Trigger • View • Table • Cursor • Log • Transaction • Index • Stored procedure • Partition A database trigger is procedural code that is automatically executed in response to certain events on a particular table in a database. ...
In database theory, a view is a virtual or logical table composed of the result set of a query. ...
In database packages, the term cursor refers to a control structure for the successive traversal (and potential processing) of records in a result set as returned by a query. ...
In in the field of databases in computer science, a transaction log (also database log or binary log) is a history of actions executed by a database management system to guarantee ACID properties over crashes or hardware failures. ...
A database transaction is a unit of interaction with a database management system or similar system that is treated in a coherent and reliable way independent of other transactions that must be either entirely completed or aborted. ...
It has been suggested that Bitmap index be merged into this article or section. ...
A stored procedure is a subroutine available to applications accessing a relational database system. ...
A partition is a division of a logical database or its constituting elements into distinct independent parts. ...
| Topics in SQL Select • Insert • Update • Merge • Delete • Join • Union • Create • Drop SQL (commonly expanded to Structured Query Language â see History for the terms derivation) is the most popular computer language used to create, retrieve, update and delete (see also: CRUD) data from relational database management systems. ...
A SELECT statement in SQL returns a result set of records from one or more tables. ...
An SQL INSERT statement adds one or more records to a table in a relational database. ...
An UPDATE statement in SQL changes data in one or more records in a relational database management system. ...
Wikipedia does not have an article with this exact name. ...
A DELETE statement in SQL removes records in a relational database management system. ...
A join combines records from two or more tables in a relational database. ...
In SQL the UNION operator combines the results of two SQL queries into a single table of all matching rows. ...
A CREATE statement in SQL creates an object inside of a relational database management system (RDBMS). ...
A DROP statement in SQL removes an object from a relational database management system (RDBMS). ...
| | Implementations of database management systems | | Types of implementations Relational • Flat file • Deductive • Dimensional • Hierarchical • Object oriented • Temporal • XML data stores A relational database is a database that conforms to the relational model, and refers to a databases data and schema (the databases structure of how that data is arranged). ...
A simple diagram depicting conversion of a CSV-format flat file database table into a relational database table. ...
A deductive database system is a database system which can make deductions (ie: infer additional rules or facts) based on rules and facts stored in the (deductive) database. ...
A dimensional database is one which, rather than storing data in multiple two dimensional tables (as a relational databases does), represents key data entities as different dimensions. ...
In a hierarchical data model, data are organized into a tree-like structure. ...
In an object oriented database, information is represented in the form of objects like in object oriented programming. ...
A temporal database is a database management system with built-in time aspects, e. ...
In Software engineering, an XML database is a data persistence software system that allows data to be imported, accessed and exported in the XML format. ...
| Components Query language • Query optimizer • Query plan • ODBC • JDBC Query languages are computer languages used to make queries into databases and information systems. ...
The query optimizer is a component of database management system that is used to analyzes queries submitted to database server for execution, and then determines the optimal way to execute the query. ...
A query plan (or query execution plan) is an set of steps used to access information in a SQL relational database management system. ...
In computing, Open Database Connectivity (ODBC) provides a standard software API method for using database management systems (DBMS). ...
Java Database Connectivity, or JDBC, is an API for the Java programming language that defines how a client may access a database. ...
| | Database products | | Apache Derby • Berkeley DB • Caché • DB2 • db4o • DBase • eXtremeDB • Filemaker Pro • Firebird • Greenplum • H2 • Helix • Informix • Ingres • InterBase • Linter • Microsoft Access • Microsoft SQL Server • Mimer SQL • MonetDB • MySQL • Objectivity/DB • OpenLink Virtuoso • OpenOffice.org Base • Oracle • Oracle Rdb • Paradox • Perst • PostgreSQL • SQLite • Sybase IQ • Sybase • Teradata • UniVerse • Visual FoxPro Apache Derby is a Java-based Relational Database Management System that can be embedded in Java programs and used for online transaction processing (OLTP). ...
Berkeley DB (DB) is a high-performance, embedded database library with bindings in C, C++, Java, Perl, Python, Tcl and many other programming languages. ...
Caché is a proprietary M technology-based database management system from InterSystems. ...
DB2 is IBMs line of RDBMS (or, as IBM now calls it, data server) software products within IBMs broader Information Management software line. ...
There are very few or no other articles that link to this one. ...
dBASE III The correct title of this article is dBASE. The initial letter is capitalized because of technical restrictions. ...
eXtremeDB is an ACID-compliant embedded database management system (DBMS) designed for embedded systems and applications with real-time performance requirements. ...
FileMaker Pro is a cross-platform database application from FileMaker Inc. ...
Firebird (sometimes called FirebirdSQL) is a relational database management system offering many ANSI SQL-2003 features. ...
Founded in June 2003, Greenplum is headquartered in San Mateo, California and has offices in the United States, Europe, and Asia. ...
H2 is a relational database management system written in Java. ...
Helix is a pioneering database management system for the Apple Macintosh platform. ...
Informix is a family of relational database management system (RDBMS) products from IBM, acquired in 2001 from a company (also called Informix or Informix Software) which dates its origins back to 1980. ...
Ingres (pronounced ingress) is a commercially supported, open-source relational database management system. ...
InterBase is a relational database management system (RDBMS) currently developed and marketed by Borland Software Corporation. ...
Linter SQL RDBMS is the main product of Relex. ...
Microsoft Access (current full name Microsoft Office Access) is a relational database management system from Microsoft, packaged with Microsoft Office Professional, and as a standalone product, which combines the relational Microsoft Jet Database Engine with a graphical user interface. ...
Microsoft SQL Server is a relational database management system (RDBMS) produced by Microsoft. ...
Mimer SQL is an SQL-based relational database management system from the Swedish company Mimer Information Technology AB (formerly: Upright Database Technology AB), which has been developed and produced since the 1970s. ...
MonetDB is an open source high-performance database management system developed at the National Research Institute for Mathematics and Computer Science (CWI; Centrum voor Wiskunde en Informatica) in the Netherlands. ...
MySQL (pronounced ) is a multithreaded, multi-user, SQL Database Management System (DBMS) with more than six million installations. ...
Objectivity/DB is a commercial object oriented database management system ODBMS produced by Objectivity, Inc. ...
The current version of the article or section reads like an advertisement. ...
OpenOffices Access equivalent ...
An Oracle database consists of a collection of data managed by an Oracle database management system. ...
Rdb/VMS is a relational database management system (RDBMS) for the Hewlett-Packard OpenVMS operating system. ...
Paradox is a relational database management system currently published by Corel Corporation. ...
Perst is an open source, dual license, object-oriented embedded database management system (ODBMS), available in two implementations: one that is developed entirely in the Java programming language, and another developed in the C# language (for applications that will run within the Microsoft . ...
PostgreSQL is a Free object-relational database server (database management system), released under a flexible BSD-style license. ...
SQLite is an ACID-compliant relational database management system contained in a relatively small C library. ...
Sybase IQ, formally Sybase Adaptive Server IQ, is a relational database software system used for data warehousing, produced by the Sybase corporation. ...
Adaptive Server Enterprise (ASE) is Sybase Corporations flagship relational database management system product. ...
Teradata Teradata is a software company, founded in 1979, that develps and sells a relational database management system with the same name. ...
UniVerse is an example of dimensional database also known as a multi-value database system which runs on Windows and most major Unix and Linux releases. ...
Visual FoxPro is a data-centric object-oriented and procedural programming language produced by Microsoft. ...
Other: Object-oriented (comparison) • relational (comparison) The following is a list of object-oriented database management systems. ...
This article or section is not written in the formal tone expected of an encyclopedia article. ...
It has been suggested that List of truly relational database management systems be merged into this article or section. ...
The following tables compare general and technical information for a number of relational database management systems. ...
| |