- 92 Downloads
When a user queries a table, the user is often interested in only some of its records, such as the records having a specified value of some field. An index is a file that allows the database engine to locate such records quickly, without having to search through the entire table. This chapter considers three common ways to implement an index: static hashing, extendable hashing, and B-trees. It then develops new relational algebra operations that take advantage of indexes.
Unable to display preview. Download preview PDF.