Bit Vectors Siddhesh
•Télécharger en tant que PPT, PDF•
0 j'aime•883 vues
Introduction to Bit Vectors
![Motivation ,[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommandé
Recommandé
Contenu connexe
Similaire à Bit Vectors Siddhesh
Similaire à Bit Vectors Siddhesh (20)
Plus de Siddhesh Bhobe
Plus de Siddhesh Bhobe (16)
Dernier
Dernier (20)
Bit Vectors Siddhesh
- 1. Processing Queries with Bit-Vector Indexes Originally presented by Anand Deshpande
- 3. Example students table 1 2 3 4 5 6 7 8 9 10 11 12 13 14 CS CS CS CS CS CS EE ME EE EE ME ME AE AE M M M M M M M M F F F F F F H1 H1 H2 H2 H2 H1 H1 H2 H3 H3 H3 H4 H4 H4 Abhay Athavale Bina Bajaj Chinmay Chatterjee David DeMillo Era Edke Frank Fernandez Gauri Gaikwad Hari Hate Indira Irani Jaya Joshi Kader Khan Leo Lobo Meera Malik Naresh Naik RID Name Hostel Gender Dept
- 5. Processing Queries 1 2 3 4 5 6 7 8 9 10 11 12 13 14 CS CS CS CS CS CS EE ME EE EE ME ME AE AE M M M M M M M M F F F F F F H1 H1 H2 H2 H2 H1 H1 H2 H3 H3 H3 H4 H4 H4 Abhay Athavale Bina Bajaj Chinmay Chatterjee David DeMillo Era Edke Frank Fernandez Gauri Gaikwad Hari Hate Indira Irani Jaya Joshi Kader Khan Leo Lobo Meera Malik Naresh Naik RID Name Hostel Gender Dept Dept = CS {1, 5, 7, 8, 12, 14} Hostel = H2 {6, 8,11,12} Dept = CS Hostel = H2 {8, 12}
- 7. B-Tree Index AE CS EE ME {4, 6} {1,5,7,8,12,14} {2, 9, 11} {3, 10, 13} B-Tree Index for Department List of RIDs
- 8. Index Architecture Value-based Index (B-Tree) Lists of RIDs 1 2 3 4 5 6 7 8 9 10 11 12 13 14 CS CS CS CS CS CS EE ME EE EE ME ME AE AE M M M M M M M M F F F F F F H1 H1 H2 H2 H2 H1 H1 H2 H3 H3 H3 H4 H4 H4 RID Hostel Gender Dept Value-based Index (B-Tree) Lists of RIDs
- 11. Bit-Vector Representation of Sets 1 2 3 4 5 6 7 8 9 10 11 12 5 3 7 4 3 2 4 6 2 0 5 4 RID Score 0 -- {10} 1 - {} 2 - {6,9} 3 - {2,5} 4 - {4,7,12} 5 - {1,11} 6 - {8} 7 - {3} Score between 4 and 6 -- S4 U S5 U S6 V4 or V5 or V6 7 5 6 4 3 2 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
- 12. Range Encoded Bit-Vectors Score = 4 V4 V3 Score <= 4 V4 Score >= 2 and Score <= 4 V4 V1 1 2 3 4 5 6 7 8 9 10 11 12 5 3 7 4 3 2 4 6 2 0 5 4 RID Score 7 5 6 4 3 2 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
- 13. Bit-Vectors AE CS EE ME Dept H1 H2 H3 H4 Hostel M F Gender 1 2 3 4 5 6 7 8 9 10 11 12 13 14 CS CS CS CS CS CS EE ME EE EE ME ME AE AE M M M M M M M M F F F F F F H1 H1 H2 H2 H2 H1 H1 H2 H3 H3 H3 H4 H4 H4 RID Hostel Gender Dept
- 15. Processing Queries Bit-vector Bit-vector Bit-vector Dept = CSCI Hostel = H2 Record-Set Record-Set Record-Set Dept = CSCI Hostel = H2 • Dept = CSCI • Bit-Vector Bit-Vector Record-Set Hostel = H2 convert
- 17. N-way AND and ORs Early Exit Strategy Dept = CSCI Hostel = H2 • Age = 19 Age = 20 Age = 21 Age = 22 +