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...

Descripción completa

Detalles Bibliográficos
Autores principales: Gagliardi, Edilma Olinda, Herrera, Norma Edith, Reyes, Nora Susana, Turull Torres, José María
Formato: Articulo
Lenguaje:Inglés
Publicado: 2001
Materias:
Ciencias Informáticas
Teoría de la computación
Base de datos relacional
Informática
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:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9420
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Teoría de la computación
Base de datos relacional
Informática
spellingShingle Ciencias Informáticas
Teoría de la computación
Base de datos relacional
Informática
Gagliardi, Edilma Olinda
Herrera, Norma Edith
Reyes, Nora Susana
Turull Torres, José María
Using boolean circuits for the parallel computation of queries
topic_facet Ciencias Informáticas
Teoría de la computación
Base de datos relacional
Informática
description 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 circuits. First, we translate a given query, expressed through a FO formula, into a uniform family of boolean circuits. Then we analyse the depth of the boolean circuits, in order to optimize parallel time. For this sake, we work on the expression tree of the formula, looking for its transformation into an equivalent family of boolean circuits of minimum depth.
format Articulo
Articulo
author Gagliardi, Edilma Olinda
Herrera, Norma Edith
Reyes, Nora Susana
Turull Torres, José María
author_facet Gagliardi, Edilma Olinda
Herrera, Norma Edith
Reyes, Nora Susana
Turull Torres, José María
author_sort Gagliardi, Edilma Olinda
title Using boolean circuits for the parallel computation of queries
title_short Using boolean circuits for the parallel computation of queries
title_full Using boolean circuits for the parallel computation of queries
title_fullStr Using boolean circuits for the parallel computation of queries
title_full_unstemmed Using boolean circuits for the parallel computation of queries
title_sort using boolean circuits for the parallel computation of queries
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/9420
http://journal.info.unlp.edu.ar/wp-content/uploads/p6.pdf
work_keys_str_mv AT gagliardiedilmaolinda usingbooleancircuitsfortheparallelcomputationofqueries
AT herreranormaedith usingbooleancircuitsfortheparallelcomputationofqueries
AT reyesnorasusana usingbooleancircuitsfortheparallelcomputationofqueries
AT turulltorresjosemaria usingbooleancircuitsfortheparallelcomputationofqueries
bdutipo_str Repositorios
_version_ 1764820491058544641

Ejemplares similares