O'Reilly logo

Database Systems: Concepts, Design and Applications by S. K. Singh

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

State True/False

1.Query processing is the procedure of selecting the most appropriate plan that is used in responding to a database request.
2.Execution plan is a series of query complication steps.
3.The cost of processing a query is usually dominated by secondary storage access, which is slow compared to memory access.
4.The transformed query is used to create a number of strategies called execution (or access) plans.
5.The internal query representation is usually a binary query tree.
6.A query is contradictory if its predicate cannot be satisfied by any tuple in the relation(s).
7.A query tree is also called a relational algebra tree.
8.Heuristic rules are used as an optimization technique to modify the internal representation of a query. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required