NLCS based string approximation for searching indexing keywords in B-tree

When any query is raised by the user in database, record searching process takes place through keywords into the database which are passed as input to indexing process in order to map keywords to records. In case of misspell keywords the system always bypass the indexing process and go for record by record search to match nearest keywords with the input keys. This process of bypassing the indexing system is costly in terms of both memory and time. In this paper NLCS based string approximation method is embedded with traversing method of B-tree for searching nearest keyword stored in B-tree so that misspelled keywords can directly used as searching keys without bypassing the indexing system. This proposed mechanism takes benefit of efficient time and space complexity of the B-tree and also provide tolerance against the misspelled keywords to any indexing process.