Using boolean circuits for the parallel computation of queries
- Autores
- Gagliardi, Edilma Olinda; Herrera, Norma Edith; Reyes, Nora Susana; Turull Torres, José María
- Año de publicación
- 2001
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- 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.
Facultad de Informática - Materia
-
Ciencias Informáticas
Teoría de la computación
Base de datos relacional
Informática - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/3.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/9420
Ver los metadatos del registro completo
| id |
SEDICI_db094c78bcf25512b8b4b1dc449c4ded |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/9420 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Using boolean circuits for the parallel computation of queriesGagliardi, Edilma OlindaHerrera, Norma EdithReyes, Nora SusanaTurull Torres, José MaríaCiencias InformáticasTeoría de la computaciónBase de datos relacionalInformáticaWe 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.Facultad de Informática2001info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/9420enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/p6.pdfinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:43:16Zoai:sedici.unlp.edu.ar:10915/9420Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:43:16.951SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Using boolean circuits for the parallel computation of queries |
| title |
Using boolean circuits for the parallel computation of queries |
| spellingShingle |
Using boolean circuits for the parallel computation of queries Gagliardi, Edilma Olinda Ciencias Informáticas Teoría de la computación Base de datos relacional Informática |
| 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 |
| dc.creator.none.fl_str_mv |
Gagliardi, Edilma Olinda Herrera, Norma Edith Reyes, Nora Susana Turull Torres, José María |
| author |
Gagliardi, Edilma Olinda |
| author_facet |
Gagliardi, Edilma Olinda Herrera, Norma Edith Reyes, Nora Susana Turull Torres, José María |
| author_role |
author |
| author2 |
Herrera, Norma Edith Reyes, Nora Susana Turull Torres, José María |
| author2_role |
author author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Teoría de la computación Base de datos relacional Informática |
| topic |
Ciencias Informáticas Teoría de la computación Base de datos relacional Informática |
| dc.description.none.fl_txt_mv |
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. Facultad de 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. |
| publishDate |
2001 |
| dc.date.none.fl_str_mv |
2001 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/9420 |
| url |
http://sedici.unlp.edu.ar/handle/10915/9420 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/p6.pdf |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846063846973767680 |
| score |
13.22299 |