An Effective Approach for Indexed Data Access based on Linear Search Technique Using Reference Key Algorithm

A robust and simple algorithm is implemented to search a record using the index dataset. In an RDBMS, the required dataset or records are accessed using the database name. In this proposed algorithm, the database name is used only once during the creation of index table, and hence forth onwards the database is accessed using the index table. Thus, database hiding concept is implemented to certain extent. The usage of index table reduces the access time complexity to a greater extent when applied to a large database. Security is provided to the database by checking for the authorization before the index table is accessed. The records are searched from database through the index table using the linear search. In this paper, a bi-level linear search is implemented using parallel processing system efficiently at a faster rate. Thus, time complexity is less compared to normal search method which is applied to a large database. Data retrieval is too efficient since the proposed approach operates on the address rather than the data records. The second attribute of the index table uses the concept of pointers. Pointers are the variables that stores the memory address of other variables. Using pointers in index table any record is accessible with time less than a second. Many factors have contributed to decrease the time complexity in accessing the database using index table. Initial processing is done using index table without database access, then the range of records related to the corresponding index is read from memory directly using the pointer variable. Thus, the proposed algorithm not only contributes in data hiding, implementing security, reduced time complexity and but also efficient memory usage.