Using boolean circuits for the parallel computation of queries
| Autor: | Gagliardi, Edilma Olinda, Herrera, Norma Edith, Reyes, Nora Susana, Turull Torres, José María |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2001 |
| Předmět: |
Informática
Computer engineering. Computer hardware computation theory query computability relational databases Ciencias Informáticas Teoría de la computación QA75.5-76.95 TK7885-7895 Computer Science::Emerging Technologies Electronic computers. Computer science Base de datos relacional boolean circuits parallel computation Hardware_LOGICDESIGN |
| Zdroj: | SEDICI (UNLP) Universidad Nacional de La Plata instacron:UNLP Journal of Computer Science and Technology, Vol 1, Iss 05, Pp 13 p.-13 p. (2001) |
| Popis: | 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 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|