Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2004-03-25T19:23:30Z
dc.date.available 2004-03-25T03:00:00Z
dc.date.issued 2001
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/9420
dc.description.abstract 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. en
dc.language en es
dc.subject Teoría de la computación es
dc.subject Base de datos relacional es
dc.subject Informática es
dc.title Using boolean circuits for the parallel computation of queries en
dc.type Articulo es
sedici.identifier.uri http://journal.info.unlp.edu.ar/wp-content/uploads/p6.pdf es
sedici.creator.person Gagliardi, Edilma Olinda es
sedici.creator.person Herrera, Norma Edith es
sedici.creator.person Reyes, Nora Susana es
sedici.creator.person Turull Torres, José María es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc/3.0/
sedici.description.peerReview peer-review es
sedici2003.identifier ARG-UNLP-ART-0000000155 es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 1, no. 5 es


Download Files

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)