Scribd
Upload
50 views

Explain Plan

A bit map index uses strings of bits to quickly locate rows in a table and are normally used to index low cardinality columns in data warehouses. In a full index scan, the database reads the entire index in order. This can eliminate the need for sorting if the query references a column in the index or no predicate is specified. For example, a query on the employees table is performed as a full scan of an index on department_id, last_name, and salary, reading the data in sorted order and filtering on salary to avoid a full table scan and sorting.

Uploaded by

Muhammad Zuhair Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
50 views

Explain Plan

A bit map index uses strings of bits to quickly locate rows in a table and are normally used to index low cardinality columns in data warehouses. In a full index scan, the database reads the entire index in order. This can eliminate the need for sorting if the query references a column in the index or no predicate is specified. For example, a query on the employees table is performed as a full scan of an index on department_id, last_name, and salary, reading the data in sorted order and filtering on salary to avoid a full table scan and sorting.

Uploaded by

Muhammad Zuhair Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Bit map index

A bit map index uses string of bits to quickly locate rows in a table. They are
normally use to index low cardinality columns in a warehouse environmen

Full Index Scan


In a full index scan, the database reads the entire index in order. A full index scan is available if a
predicate (WHERE clause) in the SQL statement references a column in the index, and in some
circumstances when no predicate is specified. A full scan can eliminate sorting because the data
is ordered by index key.
Example 3-1 Full Index Scan
Suppose that an application runs the following query:
SELECT department_id, last_name, salary
FROM
employees
WHERE salary > 5000
ORDER BY department_id, last_name;

In this example, the department_id, last_name, and salary are a composite key in an index.
Oracle Database performs a full scan of the index, reading it in sorted order (ordered by
department ID and last name) and filtering on the salary attribute. In this way, the database scans
a set of data smaller than the employees table, which contains more columns than are included
in the query, and avoids sorting the data.
The full scan could read the index entries as follows:
50,Atkinson,2800,rowid
60,Austin,4800,rowid
70,Baer,10000,rowid
80,Abel,11000,rowid
80,Ande,6400,rowid
110,Austin,7200,rowid
.
.
.

You might also like