Indexing and Hashing. Outline. Basic Concepts Ordered Indices B+-Tree Index Files B-Tree Index Files Static Hashing Dynamic Hashing Comparison of Ordered Indexing and Hashing Index Definition in SQL Multiple-Key Access. pointer. search-key. Basic Concepts.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
K1 < K2 < K3 < . . .< Kn–1
B+-tree for account file (n = 5)
B+-tree for account file (n = 3)Example B+-trees
before and after inserting “Clearview”
Before and after deleting “Downtown”
Before and after deleting “Perryridge”
Before and after deleting of “Perryridge”
Initial Extendable Hash structure, bucket size = 2 records
After inserting three Perryridge records
Hash structure after insertion of Redwood and Round Hill records
DROP INDEX <index-name>
1. Use index on branch-name to find accounts with balances of $1000; test branch-name = “Perryridge”.
2. Use indexon balance to find accounts with balances of $1000; test branch-name = “Perryridge”.
3. Use branch-name index to find pointers to all records pertaining to the Perryridge branch. Similarly use index on balance. Take intersection of both sets of pointers obtained.
where branch-name = “Perryridge” and balance < 1000
100110 OR 110011 = 110111 NOT 100110 = 011001