Indexing, Hashing, and Query
dev.to·18h·
Discuss: DEV

Create a table

INSERT INTO Students VALUES (101, ‘Arun’, ‘CSBS’, 8.5), (102, ‘Mathan’, ‘ECE’, 8.8), (103, ‘Karthik’, ‘MECH’, 6.9), (104, ‘Hareesh’, ‘CSE’, 9.1), (105, ‘Ravi’, ‘EEE’, 7.2), (106, ‘Srivishal’, ‘CSBS’, 8.8), (107, ‘Vignesh’, ‘IT’, 8.0), (108, ‘Harish’, ‘CSE’, 9.3), (109, ‘Deepak’, ‘ECE’, 7.5), (110, ‘Nidheesh’, ‘CSBS’, 9.0), (111, ‘Pradeep’, ‘MECH’, 6.8), (112, ‘Lokhitha’, ‘EEE’, 7.6), (113, ‘Raj’, ‘CSBS’, 8.7), (114, ‘Divya’, ‘IT’, 8.4), (115, ‘Saravanan’, ‘CSE’, 9.2), (116, ‘Monika’, ‘ECE’, 7.9), (117, ‘Ganesh’, ‘MECH’, 6.7), (118, ‘Kavya’, ‘CSBS’, 9.1), (119, ‘Surya’, ‘EEE’, 7.3), (120, ‘Anitha’, ‘IT’, 8.2);

Create a B-Tree Index on roll_no CREATE INDEX idx_rollno ON Students(roll_no);

Query Using B-Tree In…

Similar Posts

Loading similar posts...