Design and Implementation of Rapid Searching Framework for Relational Database

Abstract — Information explosion opens a challenge for researcher in information retrieval and search. As emergence of digital repositories and information explosion there is clear need of technique to organize information. This need day by day attracts researchers to give better techniques in area of information retrieval and search for large database. Organizations depend on relational database for transaction processing and they prefer selection operation to process in large database. Therefore, when data goes beyond few million records selection operation take lot of time to process such database. In this operation, indexes build on columns and if there are number of tables then it require more time to process whole transaction and result in performance degradation. Searching framework must be nice choice for this kind of transaction processing. Apache LUCENE is nowadays most widely used popular searching framework found in many applications. Toward this end, paper addresses shortcomings of selection operation: the clear need to faster record fetching form big database and offload selection work and with that, it suggests one alternative as LUCENE Indexing. Here we implemented fast searching framework with help of lucene for relational database. Records searched in lucene and then used in mysql for further transaction. Performance of both mysq