News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Artículo

Using boolean circuits for the parallel computation of queries

Gagliardi, Edilma Olinda et al · SEDICI UNLP · 2001

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Gagliardi, Edilma Olinda et al
Publisher
SEDICI UNLP
Year
2001
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

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

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Gagliardi, E. O. E. A. (2001). Using boolean circuits for the parallel computation of queries. http://sedici.unlp.edu.ar/handle/10915/9420

MLA

Gagliardi, Edilma Olinda et al. "Using boolean circuits for the parallel computation of queries." 2001. http://sedici.unlp.edu.ar/handle/10915/9420.

Chicago

Gagliardi, Edilma Olinda et al. 2001. "Using boolean circuits for the parallel computation of queries.". http://sedici.unlp.edu.ar/handle/10915/9420.

Harvard

Gagliardi, E. O. E. A. 2001, Using boolean circuits for the parallel computation of queries, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/9420 [Accessed 10 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Using boolean circuits for the parallel computation of queries
Author / contributors
Gagliardi, Edilma Olinda et al
Publisher
SEDICI UNLP
Publication year
2001
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Teoría de la computación; Base de datos relacional; Informática
Copied