Explanation: Parsing and translation, optimization, evaluation are all the basic steps to process a query.

Explanation: A relational algebra operation annotated with instructions on how to evaluate it is called Evaluation primitive. The evaluation primitive is the basis for evaluation of queries.

Explanation: A sequence of primitive operations that can be used to evaluate a query are called as Query evaluation plan. This is used by the query evaluation engine to process the queries.

Explanation: The lowest level operator to access data in query processing is file scan. File scans are algorithms that locate and retrieve records that fulfill a selection criterion.

Explanation: Search algorithms that use an index are called as index scans. We use the selection predicate to guide us through the choice of index to use in processing the query.

Explanation: Sorting of relations that do not fit in memory is called as external sorting.

Explanation: A selection of the form satisfying the intersection of all records satisfying individual simple conditions is a conjunctive selection. This is a form of complex selection predicate.

Explanation: A selection of the form satisfying the intersection of all records satisfying individual simple conditions is a disjunctive selection. This is a form of complex selection predicate.

Explanation: A selection of the form giving all the records not satisfying simple individual conditions is negation. This is a form of complex selection predicate.

Explanation: Conjunctive selection using one index, conjunctive selection using composite index and conjunctive selection by intersection of identifiers can be implemented. These are A7, A8, A9 algorithms that use an index.