Index seek versus table scan performance and implementation of RDBMS

Abstract

The purpose of this chapter is to make an application which can search the particular piece of information easily within less time. Moreover, it will also show the comparison of two methods that are Table Scan and Index Seek for searching in a database. Table Scan is linear searching method as it traverses each and every row present in the database making the time complexity very large. The objective of this paper is to reduce the problem of the time complexity and it makes indexes to resolve the time complexity issues that are being faced. A seek is the opposite of scan, where a seek uses the indexes to pinpoint the records, which is required to search. Indexing process eliminates the need of unnecessary disk accesses. An UI (User Interface) is made to show user, which searching method is to be used, the time taken in searching, the pages read in total and the complete information of the person who has been searched. This will provide to user, the information of superior method along with whole analysis of time and pages read.