|
Natural Key
A natural key (also known as business key or domain key) is a type of unique key in a database formed of attributes that exist and are used in the external world outside the database (i.e. in the business domain or domain of discourse). In the relational model of data, a natural key is a superkey and is therefore a functional determinant for all attributes in a relation. A natural key serves two complementary purposes: it provides a means of identification for data and it imposes a rule, specifically a ''uniqueness constraint'', to ensure that data remains unique within an information system. The uniqueness constraint assures uniqueness of data within a certain technical context (e.g. a set of values in a table, file or relation variable) by rejecting input of any data that would otherwise violate the constraint. This means that the user can rely on a guaranteed correspondence between facts identified by key values recorded in a system and the external domain of discourse (a single ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unique Key
In relational database management systems, a unique key is a candidate key that is not the primary key of the relation. All the candidate keys of a relation can uniquely identify the records of the relation, but only one of them is used as the primary key of the relation. The remaining candidate keys are called unique keys because they can uniquely identify a record in a relation. Unique keys can consist of multiple columns. Unique keys are also called alternate keys. Unique keys are an alternative to the primary key of the relation. Generally, the unique keys have a UNIQUE constraint assigned to it in order to prevent duplicates (a duplicate entry is not valid in a unique column). Alternate keys may be used like the primary key when doing a single-table select or when filtering in a ''where'' clause, but are not typically used to join multiple tables. Summary Keys provide the means for database users and application software to identify, access and update information in a databas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Database
In computing, a database is an organized collection of data stored and accessed electronically. Small databases can be stored on a file system, while large databases are hosted on computer clusters or cloud storage. The design of databases spans formal techniques and practical considerations, including data modeling, efficient data representation and storage, query languages, security and privacy of sensitive data, and distributed computing issues, including supporting concurrent access and fault tolerance. A database management system (DBMS) is the software that interacts with end users, applications, and the database itself to capture and analyze the data. The DBMS software additionally encompasses the core facilities provided to administer the database. The sum total of the database, the DBMS and the associated applications can be referred to as a database system. Often the term "database" is also used loosely to refer to any of the DBMS, the database system or an appli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domain Of Discourse
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range. Overview The domain of discourse is usually identified in the preliminaries, so that there is no need in the further treatment to specify each time the range of the relevant variables. Many logicians distinguish, sometimes only tacitly, between the ''domain of a science'' and the ''universe of discourse of a formalization of the science''.José Miguel Sagüillo, Domains of sciences, universe of discourse, and omega arguments, History and philosophy of logic, vol. 20 (1999), pp. 267–280. Examples For example, in an interpretation of first-order logic, the domain of discourse is the set of individuals over which the quantifiers range. A proposition such as is ambiguous, if no domain of discourse has been identified. In one interpretation, the domain of di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Relational Model
The relational model (RM) is an approach to managing data using a Structure (mathematical logic), structure and language consistent with first-order logic, first-order predicate logic, first described in 1969 by English computer scientist Edgar F. Codd, where all data is represented in terms of tuples, grouped into relation (database), relations. A database organized in terms of the relational model is a relational database. The purpose of the relational model is to provide a Declarative programming, declarative method for specifying data and queries: users directly state what information the database contains and what information they want from it, and let the database management system software take care of describing data structures for storing the data and retrieval procedures for answering queries. Most relational databases use the SQL data definition and query language; these systems implement what can be regarded as an engineering approximation to the relational model. A ''t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Superkey
In the relational data model a superkey is a set of attributes that uniquely identifies each tuple of a relation. Because superkey values are unique, tuples with the same superkey value must also have the same non-key attribute values. That is, non-key attributes are '' functionally dependent'' on the superkey. The set of all attributes is always a superkey (the ''trivial superkey''). Tuples in a relation are by definition unique, with duplicates removed after each operation, so the set of all attributes is always uniquely valued for every tuple. A '' candidate key'' (or ''minimal superkey'') is a superkey that can't be reduced to a simpler superkey by removing an attribute. For example, in an employee schema with attributes employeeID, name, job, and departmentID, if employeeID values are unique then employeeID combined with any or all of the other attributes can uniquely identify tuples in the table. Each combination, , , , and so on is a superkey. is a candidate key--no subs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Dependency
In relational database theory, a functional dependency is a constraint between two sets of attributes in a relation from a database. In other words, a functional dependency is a constraint between two attributes in a relation. Given a relation ''R'' and sets of attributes X,Y \subseteq R, ''X'' is said to functionally determine ''Y'' (written ''X'' → ''Y'') if and only if each ''X'' value in ''R'' is associated with precisely one ''Y'' value in ''R''; ''R'' is then said to ''satisfy'' the functional dependency ''X'' → ''Y''. Equivalently, the projection \Pi_R is a function, i.e. ''Y'' is a function of ''X''. In simple words, if the values for the ''X'' attributes are known (say they are ''x''), then the values for the ''Y'' attributes corresponding to ''x'' can be determined by looking them up in ''any'' tuple of ''R'' containing ''x''. Customarily ''X'' is called the ''determinant'' set and ''Y'' the ''dependent'' set. A functional dependency FD: ''X'' → ''Y'' is called ''tr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unique Identifier
A unique identifier (UID) is an identifier that is guaranteed to be unique among all identifiers used for those objects and for a specific purpose. The concept was formalized early in the development of computer science and information systems. In general, it was associated with an atomic data type. In relational databases, certain attributes of an entity that serve as unique identifiers are called primary keys. In mathematics, set theory uses the concept of '' element indices'' as unique identifiers. Classification There are some main types of unique identifiers, each corresponding to a different generation strategy: # serial numbers, assigned incrementally or sequentially, by a central authority or accepted reference. # random numbers, selected from a number space much larger than the maximum (or expected) number of objects to be identified. Although not really unique, some identifiers of this type may be appropriate for identifying objects in many practical applications ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surrogate Key
A surrogate key (or synthetic key, pseudokey, entity identifier, factless key, or technical key) in a database is a unique identifier for either an ''entity'' in the modeled world or an ''object'' in the database. The surrogate key is ''not'' derived from application data, unlike a ''natural'' (or ''business'') key. Definition There are at least two definitions of a surrogate: ; Surrogate (1) – Hall, Owlett and Todd (1976): A surrogate represents an ''entity'' in the outside world. The surrogate is internally generated by the system but is nevertheless visible to the user or application. ; Surrogate (2) – Wieringa and De Jonge (1991): A surrogate represents an ''object'' in the database itself. The surrogate is internally generated by the system and is invisible to the user or application. The ''Surrogate (1)'' definition relates to a data model rather than a storage model and is used throughout this article. See Date (1998). An important distinction between a s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Primary Key
In the relational model of databases, a primary key is a ''specific choice'' of a ''minimal'' set of attributes (Column (database), columns) that uniquely specify a tuple (Row (database), row) in a Relation (database), relation (Table (database), table). Informally, a primary key is "which attributes identify a record," and in simple cases constitute a single attribute: a unique ID. More formally, a primary key is a choice of candidate key (a minimal superkey); any other candidate key is an alternate key. A primary key may consist of real-world observables, in which case it is called a ''natural key'', while an attribute created to function as a key and not used for identification outside the database is called a ''surrogate key''. For example, for a database of people (of a given nationality), time and location of birth could be a natural key. National identification number is another example of an attribute that may be used as a natural key. History Although mainly used today in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Social Security Number
In the United States, a Social Security number (SSN) is a nine-digit number issued to U.S. citizens, permanent residents, and temporary (working) residents under section 205(c)(2) of the Social Security Act, codified as . The number is issued to an individual by the Social Security Administration, an independent agency of the United States government. Although the original purpose for the number was for the Social Security Administration to track individuals, the Social Security number has become a ''de facto'' national identification number for taxation and other purposes. A Social Security number may be obtained by applying on Form SS-5, Application for a Social Security Number Card. History Social Security numbers were first issued by the Social Security Administration in November 1936 as part of the New Deal Social Security program. Within three months, 25 million numbers were issued. On November 24, 1936, 1,074 of the nation's 45,000 post offices were designated "typing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Database Administrator
Database administrators (DBAs) use specialized software to store and organize data. The role may include capacity planning, installation, configuration, database design, migration, performance monitoring, security, troubleshooting, as well as backup and data recovery. Skills Some common and useful skills for database administrators are: * Knowledge of database queries * Knowledge of database theory * Knowledge of database design * Knowledge about the RDBMS itself, e.g. Microsoft SQL Server or MySQL * Knowledge of structured query language (SQL), e.g. SQL/PSM or Transact-SQL * General understanding of distributed computing architectures, e.g. Client–server model * General understanding of operating system, e.g. Windows or Linux * General understanding of storage technologies and networking * General understanding of routine maintenance, recovery, and handling failover of a database * Database Management Systems – Managing your data landscapDatabase management System Databas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Confluence (software)
Confluence is a web-based corporate wiki developed by Australian software company Atlassian. Atlassian wrote Confluence in the Java programming language and first published it in 2004. Confluence Standalone comes with a built-in Tomcat web server and hsql database, and also supports other databases. The company markets Confluence as enterprise software, licensed as either on-premises software or software as a service running on AWS. History Atlassian released Confluence 1.0 on March 25, 2004, saying its purpose was to build "an application that was built to the requirements of an enterprise knowledge management system, without losing the essential, powerful simplicity of the wiki in the process." In recent versions, Confluence has evolved into part of an integrated collaboration platform and has been adapted to work in conjunction with Jira and other Atlassian software products, including Bamboo, Clover, Crowd, Crucible, and Fisheye. In 2014, Atlassian released Confluence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
