Suppose we have 999 records of employees Emp1, Emp2, Emp5, Emp6 and so on up to Emp998 and Emp999 stored in a sequence. Hence, records are nothing but a row in the table. In the employee table, we want to insert new records Emp3 and Emp4 in the sequence, and once we have done insertion we need to update and retrieve the record efficiently to optimize the performance of a database by minimizing the access time when query is being executed.
You are required to solve the problem with the index sequential access method with pros and cons in the given scenario.
10
25
50
75
100
Sort Order:
Student ID Ascending
Student ID Descending
Post Date Ascending
Post Date Descending
Rating Ascending
Rating Descending
No record found.
INSERT INTO Employee (emp_id)
VALUES ("Emp3");
INSERT INTO Employee (emp_id)
VALUES ("Emp4");
UPDATE Employee set emp_id="Emp3" , emp_id="Emp4";
SELECT * FROM Employee;
Comments
Leave a comment