A database schema (pronounced skee-ma, /ˈski.mə/) of a database system is its structure described in a formal language supported by the database management system (DBMS) and refers to the organization of data to create a blueprint of how a database will be constructed (divided into database tables). The formal definition of database schema is a set of formulas (sentences) that specify integrity constraints imposed on the database. All constraints are expressible in the same language. A database can be seen in terms of logic as a structure in a realization of the database language. The states of a created conceptual schema are transformed into an explicit mapping, the database schema. This describes how real world entities are modeled in the database.
"A database schema specifies, based on the database administrator's knowledge of possible applications, the facts that can enter the database, or those of interest to the possible end-users." The notion of a database schema plays the same role as the notion of theory in predicate calculus. A model of this “theory” closely corresponds to a database, which can be seen at any instant of time as a mathematical object. Thus a schema can contain formulas representing integrity constraints specifically for an application and the constraints specifically for a type of database, all expressed in the same database language. In a relational database, the schema defines the tables, fields, relationships, views, indexes, packages, procedures, functions, queues, triggers, types, sequences, materialized views, synonyms, database links, directories, Java, XML schemas, and other elements.
Schemata are generally stored in a data dictionary. Although a schema is defined in text database language, the term is often used to refer to a graphical depiction of the database structure. In other words, schema is the structure of the database that defines the objects in the database.
Levels of database schema
- Conceptual schema, a map of concepts and their relationships.
- Logical schema, a map of entities and their attributes and relations
- Physical schema, a particular implementation of a logical schema
- Schema object, Oracle database object
Ideal requirements for schema integration
All information in the source data should be included in the database schema.
Each of the overlapping elements specified in the input mapping is also in a database schema relation.
Extended overlap preservation
Source-specific elements that are associated with a source’s overlapping elements are passed through to the database schema.
Independent entities and relationships in the source data should not be grouped together in the same relation in the database schema. In particular, source specific schema elements should not be grouped with overlapping schema elements, if the grouping co-locates independent entities or relationships.
If any elements of the database schema are dropped then the database schema is not ideal.
These requirements influence the detailed structure of schemas that are produced. Certain applications will not require that all of these conditions are met, but these five requirements are the most ideal.
Example of two schema integrations
Example: Suppose we want a mediated (database) schema to integrate two travel databases, Go-travel and Ok-travel.
Go-travel has three relations:
Go-flight(f-num, time, meal)
Go-price(f-num, date, price)
The attribute f-num is the flight number and meal is a boolean. The other attributes are self-explanatory.
Ok-travel has just one relation:
Ok-flight(f-num, date, time, price, nonstop)
'nonstop' is a boolean.
The overlapping information in Ok-travel’s and Go-travel’s schemas could be represented in a mediated schema:
Flight(f-num, date, time, price)
- Core Architecture Data Model
- Data Definition Language
- Data Design
- Data dictionary
- Data model
- Data modeling
- Data mapping
- Database integrity
- entity-relationship model
- Knowledge Representation
- Object-Role Modeling
- Relational algebra
- Schema Matching
- Three schema approach
- ^ a b Rybinski, H. (1987). On First-Order-Logic Databases. ACM Transactions on Database Systems, 12( 3), 325-349.
- ^ Imielinski T., & Lipski W.(1982). A systematic approach to relational database theory. In Proceedings of the 1982 ACM SIGMOD international conference on Management of data (SIGMOD '82). ACM, New York, NY, USA, 8-14. DOI=10.1145/582353.582356 http://doi.acm.org/10.1145/582353.582356
- ^ a b c d e f Pottinger P., & Berstein P.(2008). Schema merging and mapping creation for relational sources. In Proceedings of the 11th international conference on Extending database technology: Advances in database technology (EDBT '08). ACM, New York, NY, USA, 73-84. DOI=10.1145/1353343.1353357 http://doi.acm.org/10.1145/1353343.1353357
Wikimedia Foundation. 2010.
Look at other dictionaries:
database schema — duomenų bazės schema statusas T sritis informatika apibrėžtis ↑Duomenų bazės lentelių ir ↑rodinių struktūros aprašas. Schema nusakomi kiekvienos lentelės ↑stulpeliai ir kiekvieno stulpelio ↑duomenų tipas. atitikmenys: angl. database schema ryšiai … Enciklopedinis kompiuterijos žodynas
Schema matching — The terms schema matching and mapping are often used interchangeably. For this article, we differentiate the two as follows: Schema matching is the process of identifying that two objects are semantically related (scope of this article) while… … Wikipedia
Database refactoring — A database refactoring is a simple change to a database schema that improves its design while retaining both its behavioral and informational semantics. A database refactoring is conceptually more difficult than a code refactoring; code… … Wikipedia
Database model — A database model is the theoretical foundation of a database and fundamentally determines in which manner data can be stored, organized, and manipulated in a database system. It thereby defines the infrastructure offered by a particular database… … Wikipedia
Schema evolution — In computer science, Schema Evolution refers to the problem of evolving a database schema to adapt it to a change in the modeled reality.The problem is not limited to the modification of the schema. It, in fact, affects the data stored under the… … Wikipedia
Schema — The word schema comes from the Greek word σχήμα (skhēma), which means shape, or more generally, plan . The Greek plural is σχήματα (skhēmata). In English, both schemas and schemata are used as plural forms, although the latter is the standard… … Wikipedia
Schema crosswalk — A crosswalk is a table that shows equivalent elements (or fields ) in more than one database schema. It maps the elements in one schema to the equivalent elements in another schema. For example, this is a metadata crosswalk from MARC to Dublin… … Wikipedia
Database design — is the process of producing a detailed data model of a database. This logical data model contains all the needed logical and physical design choices and physical storage parameters needed to generate a design in a Data Definition Language, which… … Wikipedia
Schéma d'URI — En informatique, un schéma d’URI est le premier niveau de la structure de nommage des identifiants uniformes de ressources (URI). Toutes les URIs sont construites à partir d’un nom de schéma, suivi de deux points (« : ») puis du reste… … Wikipédia en Français
Database trigger — A database trigger is procedural code that is automatically executed in response to certain events on a particular table or view in a database. The trigger is mostly used for keeping the integrity of the information on the database. For example,… … Wikipedia