zbMATH — the first resource for mathematics

Implementation of relational algebra using binary decision diagrams. (English) Zbl 1027.68036
de Swart, Harrie C. M. (ed.), Relational methods in computer science. 6th international conference, RelMiCS 2001 and 1st workshop of COST Action 274 TARSKI, Oisterwijk, The Netherlands, October 16-21, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2561, 241-257 (2002).
Summary: We show how relations and their operations can efficiently be implemented by means of Binary Decision Diagrams. This implementation is used in the computer system RELVIEW. To demonstrate the power of the approach, we show how it can be applied to attack computationally hard problems.
For the entire collection see [Zbl 1014.00018].

68P05 Data structures
03G15 Cylindric and polyadic algebras; relation algebras
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
CUDD; RelView
Full Text: Link