Using boolean circuits for the parallel computation of queries

• Autores: Edilma Olinda Gagliardi, Norma Edith Herrera, Nora Susana Reyes, José María Turull Torres
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 1, Nº. 5, 2001 (Ejemplar dedicado a: Fifth Issue; 15 p.)
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

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