


















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Inverted Files, DBMS searches, Linked Lists, Circular pointers, Tree Index, Three Alternatives, AKA Pointer Chain are the main points of this lecture.
Typology: Slides
1 / 26
This page cannot be seen from the preview
Don't miss anything!
AKA Pointer Chain Needs an extra field in the physical record to store the link Relative addresses are used
Head pointer needs to be stored Pointers for multiple fields can be created Circular pointers Double linked lists
Index is maintained in a hierarchical arrangements of nodes Each node stores key values and pointers; nodes are connected through links
B+ Trees
Example Tree Index
Example Tree Index 10* 15* 20* 25* 33* 37* 40^ 46^ 51^ 55^ 63* 97*
Root 27*
Example Tree Index 10* 15* 20* 23* 33* 34* 40^ 46^ 51^ 55^ 63* 97*
Root 27*
Root 27*
What is actually stored in the leaves of the index for key value “k”?
Alternative 1 Actual data record (with key value k )
Alternative 1 At most one index on a given collection of data records can use Alternative 1.