{"id":8910,"date":"1995-01-01T00:00:00","date_gmt":"1995-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/1995\/01\/01\/definicion-y-construccion-de-un-lenguaje-relacional-de-interrogacion-con-capacidad-para-expresar-inferencias-recursivas\/"},"modified":"1995-01-01T00:00:00","modified_gmt":"1995-01-01T00:00:00","slug":"definicion-y-construccion-de-un-lenguaje-relacional-de-interrogacion-con-capacidad-para-expresar-inferencias-recursivas","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/definicion-y-construccion-de-un-lenguaje-relacional-de-interrogacion-con-capacidad-para-expresar-inferencias-recursivas\/","title":{"rendered":"Definicion y construccion de un lenguaje relacional de interrogacion con capacidad para expresar inferencias recursivas."},"content":{"rendered":"<h2>Tesis doctoral de <strong> Eugenio Santos Menendez <\/strong><\/h2>\n<p>Uno de los problemas mas interesantes en bases de datos deductivas es la resolucion de inferencias linealmente recursivas. El algebra relacional no es equivalente a la logica de primer orden, lo cual constituye un serio problema cuando se construyen sistemas de gestion de bases de datos deductivas, mediante la conexion de sistemas de gestion de bases de datos relacionales y lenguajes logicos de programacion.  distintos autores han estudiado el problema de la no completitud funcional del algebra relacional (ioannidis y wong 1987a), (agrawal 1987), (eder 1990), (ahad y yao 1993) y (dar y agrawal 1993). La primera referencia delimita claramente el problema, demostrando que no es posible formular consultas linealmente recursivas en algebra relacional. En (dugundji 1966) son definidos diferentes operadores algebricos, que pensamos pueden ser la base para la definicion de un lenguaje relacional de consulta con las mismas caracteristicas que el algebra relacional (completitud ar), y que ademas permita la formulacion de consultas linealmente recursivas.  partiendo de esta hipotesis, se propone un nuevo operador (el operador de proyeccion inversa), para construir un lenguaje relacional de consulta, basado en algebra relacional, que tenga la propiedad de ser funcionalmente completo. Tomando como base dicho operador, en esta tesis se define y construye el lenguaje relacional de consulta, que hemos denominado sql\/fc, que tiene la capacidad de ser completo funcionalmente, y que esta basado en el lenguaje estandar ansi sql. La correccion tanto del operador elegido como base de la solucion propuesta, como del lenguaje sql\/fc que soporta dicha solucion tambien es demostrada.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Definicion y construccion de un lenguaje relacional de interrogacion con capacidad para expresar inferencias recursivas.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Definicion y construccion de un lenguaje relacional de interrogacion con capacidad para expresar inferencias recursivas. <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Eugenio Santos Menendez <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Polit\u00e9cnica de Madrid<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1995<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>Mar\u00eda Covadonga Fern\u00e1ndez  Baiz\u00e1n<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Rafael Portaencasa Baeza <\/li>\n<li>Arturo Ribagorda Garnacho (vocal)<\/li>\n<li>Angel Garcia Moreno (vocal)<\/li>\n<li> Lopez Brugos Jos\u00e9 Antonio (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Eugenio Santos Menendez Uno de los problemas mas interesantes en bases de datos deductivas es la resolucion [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[6314,1890,126,16008],"tags":[30968,7022,30967,30969,16552,16290],"class_list":["post-8910","post","type-post","status-publish","format-standard","hentry","category-bases-de-datos","category-ciencia-de-los-ordenadores","category-matematicas","category-politecnica-de-madrid","tag-angel-garcia-moreno","tag-arturo-ribagorda-garnacho","tag-eugenio-santos-menendez","tag-lopez-brugos-jose-antonio","tag-maria-covadonga-fernandez-baizan","tag-rafael-portaencasa-baeza"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/8910","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=8910"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/8910\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=8910"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=8910"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=8910"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}