Work

Efficient optimization of a class of relational expressions

Year: 1979
Type: article
Abstract: The design of several database query languages has been influenced by Codd's relational algebra. This paper discusses the difficulty of optimizing queries based on the relational algebra operations select, project, and join. A matrix, called a tableau, is proposed as a useful device for representing the value of a query, and optimization of queries is couched in terms of finding a minimal tableau equivalent to a given one. Functional dependencies can be used to imply additional equivalences among tableaux. Although the optimization problem is NP-complete, a polynomial time algorithm exists to optimize tableaux that correspond to an important subclass of queries.
Language: English
Open Access status: bronze
OpenAlex ID: W1967992696
FWCI: 13.12
Cites: 29
Cited by: 237
Related to: 10