This document discusses query processing and algorithms for evaluating relational algebra operations. It begins with an overview of the basic steps in query processing: parsing and translation, optimization, and evaluation. It then discusses how to measure query costs using a cost model based on disk access times. The document outlines several algorithms (A1-A10) for performing selection operations on relations using file scans and indexes. It provides cost estimates for each algorithm based on factors like the number of blocks accessed and index height. The algorithms can handle selections with equality and inequality conditions, as well as complex selections using conjunctions, disjunctions, and negation.