L-rigid Databases and the Expressibility of Incomplete Relational Query Languages

The class of Computable Queries (CQ) was de ned by Chandra and Harel in 1980, as functions on structures rather than functions on numbers (as recursive functions). With this formulation of the notion of a query to a relational database (db), the field of Finite Model Theory became a suitable theore...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Turull Torres, José María
Formato: Articulo Contribucion a revista
Lenguaje:Inglés
Publicado: 1998
Materias:
Ciencias Informáticas
Computable Queries
Finite Model Theory
relational database
relational languages
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/135589
https://publicaciones.sadio.org.ar/index.php/EJS/article/view/138
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares