This HTML5 document contains 70 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-eshttp://es.dbpedia.org/resource/
n20https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ruhttp://ru.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n21http://
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8https://winrdbi.asu.edu/
owlhttp://www.w3.org/2002/07/owl#
n6http://doi.acm.org/10.1145/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-zhhttp://zh.dbpedia.org/resource/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:QUEL_query_languages
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
Subject Item
dbr:Relational_algebra
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
Subject Item
dbr:SQL
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
Subject Item
dbr:Relational
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
dbo:wikiPageDisambiguates
dbr:Tuple_relational_calculus
Subject Item
dbr:Tuple_relational_calculus
rdfs:label
元组关系演算 Исчисление кортежей Tuple relational calculus Cálculo relacional basado en tuplas
rdfs:comment
元组演算是埃德加·科德導入的演算，是关系模型的一部分，發展目的是提供宣告式的数据库查询语言。数据库查询语言和后来的SQL中的一些靈感是由元组演算而來。SQL和原來的关系模型和演算已有許多不同，後來成為實際上的数据库查询语言標準，几乎所有的关系数据库管理系统中都會用到SQL或是其變體。後來Lacroix和Pirotte提出了接近于一阶逻辑的域演算，并证明了这两种演算和关系代数在表达能力上是等价的。若关系数据库的查询语言可以表达一種以上上述的查询方式，則可称为具有「关系完备性」。 域关系演算与元组关系演算最大的区别是域关系演算中的变量表示数据库的表属性，而元组关系演算的变量表示元组，即数据库的一行。 El cálculo relacional basado en tuplas es un cálculo introducido por Edgar Frank Codd como parte del cálculo relacional, el cual pertenece al modelo relacional para bases de datos. Fue la inspiración para la creación de los lenguajes de consulta y SQL, de los cuales este último, aunque menos fiel al original, es ahora el lenguaje de consulta más usado. El , formulado por Michel Lacroix and Alain Pirotte, se aproxima más a la lógica de primer orden, sin embargo ambos son equivalentes en su poder expresivo. Tuple calculus is a calculus that was created and introduced by Edgar F. Codd as part of the relational model, in order to provide a declarative database-query language for data manipulation in this data model. It formed the inspiration for the database-query languages QUEL and SQL, of which the latter, although far less faithful to the original relational model and calculus, is now the de facto standard database-query language; a dialect of SQL is used by nearly every relational-database-management system. Michel Lacroix and proposed domain calculus, which is closer to first-order logic and together with Codd showed that both of these calculi (as well as relational algebra) are equivalent in expressive power. Subsequently, query languages for the relational model were called relationally Исчисление кортежей — направление реляционного исчисления, где областями определения переменных являются тела отношений базы данных, то есть допустимым значением каждой переменной является кортеж тела некоторого отношения.
dct:subject
dbc:Logical_calculi dbc:Relational_model
dbo:wikiPageID
175286
dbo:wikiPageRevisionID
1065651237
dbo:wikiPageWikiLink
dbr:Atomic_formula dbr:Calculus_(disambiguation) dbr:First-order_predicate_calculus dbr:Function_(mathematics) dbr:Alain_Pirotte dbr:Partial_function dbr:Relational_algebra dbr:Data_model dbr:Tuple dbr:Data_domain dbr:Relational_calculus dbr:Row_(database) dbc:Logical_calculi dbr:Communications_of_the_ACM dbr:Attribute_(computing) dbr:Table_(database) dbr:SQL dbr:Data_type dbr:Relational_database_management_system dbc:Relational_model dbr:Declarative_programming dbr:Relational_model dbr:Edgar_F._Codd dbr:Domain_calculus dbr:QUEL_query_languages dbr:Domain_relational_calculus dbr:Relational_database dbr:Ordered_pair
dbo:wikiPageExternalLink
n6:362384.362685 n8: n21:des.sourceforge.net
owl:sameAs
dbpedia-zh:元组关系演算 wikidata:Q1000462 dbpedia-ru:Исчисление_кортежей freebase:m.017pzt n20:6j3R dbpedia-es:Cálculo_relacional_basado_en_tuplas
dbp:wikiPageUsesTemplate
dbt:Short_description
dbo:wikiPageInterLanguageLink
dbpedia-de:Kalkül_(Datenbank)
dbo:abstract
Исчисление кортежей — направление реляционного исчисления, где областями определения переменных являются тела отношений базы данных, то есть допустимым значением каждой переменной является кортеж тела некоторого отношения. El cálculo relacional basado en tuplas es un cálculo introducido por Edgar Frank Codd como parte del cálculo relacional, el cual pertenece al modelo relacional para bases de datos. Fue la inspiración para la creación de los lenguajes de consulta y SQL, de los cuales este último, aunque menos fiel al original, es ahora el lenguaje de consulta más usado. El , formulado por Michel Lacroix and Alain Pirotte, se aproxima más a la lógica de primer orden, sin embargo ambos son equivalentes en su poder expresivo. 元组演算是埃德加·科德導入的演算，是关系模型的一部分，發展目的是提供宣告式的数据库查询语言。数据库查询语言和后来的SQL中的一些靈感是由元组演算而來。SQL和原來的关系模型和演算已有許多不同，後來成為實際上的数据库查询语言標準，几乎所有的关系数据库管理系统中都會用到SQL或是其變體。後來Lacroix和Pirotte提出了接近于一阶逻辑的域演算，并证明了这两种演算和关系代数在表达能力上是等价的。若关系数据库的查询语言可以表达一種以上上述的查询方式，則可称为具有「关系完备性」。 域关系演算与元组关系演算最大的区别是域关系演算中的变量表示数据库的表属性，而元组关系演算的变量表示元组，即数据库的一行。 Tuple calculus is a calculus that was created and introduced by Edgar F. Codd as part of the relational model, in order to provide a declarative database-query language for data manipulation in this data model. It formed the inspiration for the database-query languages QUEL and SQL, of which the latter, although far less faithful to the original relational model and calculus, is now the de facto standard database-query language; a dialect of SQL is used by nearly every relational-database-management system. Michel Lacroix and proposed domain calculus, which is closer to first-order logic and together with Codd showed that both of these calculi (as well as relational algebra) are equivalent in expressive power. Subsequently, query languages for the relational model were called relationally complete if they could express at least all of these queries.
prov:wasDerivedFrom
wikipedia-en:Tuple_relational_calculus?oldid=1065651237&ns=0
dbo:wikiPageLength
15396
foaf:isPrimaryTopicOf
wikipedia-en:Tuple_relational_calculus
Subject Item
dbr:Object–relational_impedance_mismatch
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
Subject Item
dbr:Relational_calculus
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
Subject Item
dbr:Tuple_calculus
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
dbo:wikiPageRedirects
dbr:Tuple_relational_calculus
Subject Item
dbr:Tuple_Relational_Calculus
dbo:wikiPageWikiLink
dbr:Tuple_relational_calculus
dbo:wikiPageRedirects
dbr:Tuple_relational_calculus
Subject Item
wikipedia-en:Tuple_relational_calculus
foaf:primaryTopic
dbr:Tuple_relational_calculus