In relational databases and SQL 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 the lay term for relation.

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 "header" information, such as constraints on the table or on the values within particular columns.

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.

Unlike a spreadsheet, the datatype of each field is strictly defined by the schema describing the table.

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.

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. Clearly, the table and graph representations are only equivalent if the ordering of rows is not significant, and the table has no duplicate rows.

SQL | Data modeling

Table (algèbre relationnelle) | Tabelas (banco de dados)