Using boolean circuits for the parallel computation of queries
We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases. For that purpose, we use the well-known equivalence between First Order Logic (FO) and a class of restricted families of boolean ci...
Guardado en:
| Autores principales: | Gagliardi, Edilma Olinda, Herrera, Norma Edith, Reyes, Nora Susana, Turull Torres, José María |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9420 http://journal.info.unlp.edu.ar/wp-content/uploads/p6.pdf |
| Aporte de: |
Ejemplares similares
-
Implementation of boolean neural networks on parallel computers
por: Carvalho, Andre Carlos Ponce de Leon Ferreira de, et al.
Publicado: (1996) -
Computación paralela de queries expresados con circuitos booleanos
por: Gagliardi, Edilma Olinda, et al.
Publicado: (2000) -
Parallel computers : theory and practice /
por: Casavant, Thomas L.
Publicado: (1996) -
Computación de queries a bases de datos relacionales utilizando circuitos booleanos
por: Gagliardi, Edilma Olinda, et al.
Publicado: (2001) -
Teoría de la computación y bases de datos
por: Gagliardi, Edilma Olinda, et al.
Publicado: (2000)